Guruswami–Sudan List Decoding for Complex Reed–Solomon Codes
Conference: SCC 2017 - 11th International ITG Conference on Systems, Communications and Coding
02/06/2017 - 02/09/2017 at Hamburg, Germany
Proceedings: ITG-Fb. 268: SCC 2017
Pages: 6Language: englishTyp: PDFPersonal VDE Members are entitled to a 10% discount on this title
Mohamed, Mostafa H.; Puchinger, Sven; Bossert, Martin (Institute of Communications Engineering, Ulm University, 89081 Ulm, Germany)
We analyze the Guruswami–Sudan list decoding algorithm for Reed–Solomon codes over the complex field for sparse recovery in Compressed Sensing. We propose methods of stabilizing both the interpolation and the root-finding steps against numerical instabilities, where the latter is the most sensitive. For this purpose, we modify the Roth–Ruckenstein algorithm and propose a method to refine its result using Newton’s method. The overall decoding performance is then further improved using Generalized Minimum Distance decoding based on intrinsic soft information. This method also allows to obtain a unique solution of the recovery problem. The approach is numerically evaluated and shown to improve upon recently proposed decoding techniques.