Guruswami-Sudan list decoding for complex reed-Solomon codes

Mostafa H. Mohamed, Sven Puchinger, Martin Bossert

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

Abstract

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.

OriginalspracheEnglisch
TitelSCC 2017 - 11th International ITG Conference on Systems, Communications and Coding
Herausgeber (Verlag)VDE VERLAG GMBH
ISBN (elektronisch)9783800743629
PublikationsstatusVeröffentlicht - 2019
Extern publiziertJa
Veranstaltung11th International ITG Conference on Systems, Communications and Coding, SCC 2017 - Hamburg, Deutschland
Dauer: 6 Feb. 20179 Feb. 2017

Publikationsreihe

NameSCC 2017 - 11th International ITG Conference on Systems, Communications and Coding

Konferenz

Konferenz11th International ITG Conference on Systems, Communications and Coding, SCC 2017
Land/GebietDeutschland
OrtHamburg
Zeitraum6/02/179/02/17

Fingerprint

Untersuchen Sie die Forschungsthemen von „Guruswami-Sudan list decoding for complex reed-Solomon codes“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren