Two Low-Complexity Reliability-Based Message-Passing Algorithms for Decoding Non-Binary LDPC Codes

This paper presents two low-complexity reliability-based message-passing algorithms for decoding LDPC codes over non-binary finite fields. These two decoding algorithms require only finite field and integer operations and they provide effective trade-off between error performance and decoding comple...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications 2010-11, Vol.58 (11), p.3140-3147
Hauptverfasser:	Chen, Chao-Yu, Huang, Qin, Chao, Chi-chao, Lin, Shu
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Coding, codes Complexity theory Decoding Exact sciences and technology fast Fourier transform q-ary sum-product algorithm Geometry Information, signal and communications theory Iterative decoding non-binary LDPC codes Reliability Reliability-based message-passing algorithms Signal and communications theory Telecommunications and information theory Variable speed drives
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper presents two low-complexity reliability-based message-passing algorithms for decoding LDPC codes over non-binary finite fields. These two decoding algorithms require only finite field and integer operations and they provide effective trade-off between error performance and decoding complexity compared to the non-binary sum product algorithm. They are particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields.
ISSN:	0090-6778 1558-0857
DOI:	10.1109/TCOMM.2010.091310.090327