Bit-Reliability Based Low-Complexity Decoding Algorithms for Non-Binary LDPC Codes

This paper presents bit-reliability based majority-logic decoding (MLgD) algorithms for non-binary LDPC codes. The proposed algorithms pass only one Galois field element and its reliability along each edge of the Tanner graph of a non-binary LDPC code. Since their reliability updates are in terms of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on communications Jg. 62; H. 12; S. 4230 - 4240
Hauptverfasser:	Huang, Qin, Zhang, Mu, Wang, Zulin, Wang, Lu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.12.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	binary representation bit-reliability Computational complexity Decoding Hamming distance Iterative decoding majority-logic decoding Non-binary LDPC codes Parity check codes Non-binary LDPC codes majority-logic decoding binary representation bit-reliability hamming distance
ISSN:	0090-6778, 1558-0857
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!