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 Jg. 58; H. 11; S. 3140 - 3147
Hauptverfasser:	Chen, Chao-Yu, Huang, Qin, Chao, Chi-chao, Lin, Shu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.11.2010 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
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 Finite field Error estimation Fast Fourier transformation Decoding Algorithm Binary code Field experiment Reliability-based message-passing algorithms Message passing Algorithm complexity fast Fourier transform q-ary sum-product algorithm Error correcting code Parity check codes non-binary LDPC codes
ISSN:	0090-6778, 1558-0857
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!