Reweighted LP Decoding for LDPC Codes

Reweighted LP Decoding for LDPC Codes

We introduce a novel algorithm for decoding binary linear codes by linear programming (LP). We build on the LP decoding algorithm of Feldman and introduce a postprocessing step that solves a second linear program that reweights the objective function based on the outcome of the original LP decoder o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2012-09, Vol.58 (9), p.5972-5984
Hauptverfasser: Khajehnejad, A., Dimakis, A. G., Hassibi, B., Vigoda, B., Bradley, W.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm design and analysis
Algorithms
Applied sciences
Coding theory
Coding, codes
Construction
Decoders
Decoding
Error correction
Exact sciences and technology
Gain
Information theory
Information, signal and communications theory
LDPC codes
Linear code
Linear codes
Linear programming
LP decoding
Mathematical analysis
Maximum likelihood decoding
Parity check codes
Signal and communications theory
Telecommunications and information theory
Vectors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We introduce a novel algorithm for decoding binary linear codes by linear programming (LP). We build on the LP decoding algorithm of Feldman and introduce a postprocessing step that solves a second linear program that reweights the objective function based on the outcome of the original LP decoder output. Our analysis shows that for some LDPC ensembles we can improve the provable threshold guarantees compared to standard LP decoding. We also show significant empirical performance gains for the reweighted LP decoding algorithm with very small additional computational complexity.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2012.2202211