Deterministic Compressed Sensing with Power Decoding for Complex Reed–Solomon Codes
Conference: SCC 2015 - 10th International ITG Conference on Systems, Communications and Coding
02/02/2015 - 02/05/2015 at Hamburg, Germany
Pages: 6Language: englishTyp: PDFPersonal VDE Members are entitled to a 10% discount on this title
Mohamed, Mostafa; Rizkalla, Shrief; Zoerlein, Henning; Bossert, Martin (Institute of Communications Engineering, Ulm University, 89081 Ulm, Germany)
Complex Reed–Solomon (CRS) codes can be used for deterministic Compressed Sensing (CS). In order to improve the recovery capabilities, power decoding for CRS codes is investigated. We discuss the robustness of known error locator algorithms against the numerical instabilities arising from floating point calculations. A novel noise robust algorithm inspired by Generalized Minimum Distance decoding is introduced. Its performance is evaluated and compared to Orthogonal Matching Pursuit which is a well known CS algorithm.