Set Message-Passing Decoding Algorithms for Regular Non-Binary LDPC Codes

In the check node (CN) update of non-binary message-passing algorithms, each element of reliability vectors takes the same computational complexity. However, our analysis indicates that various elements in the same vector have various correct probabilities, thus have different contributions to error...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications Jg. 65; H. 12; S. 5110 - 5122
Hauptverfasser:	Huang, Qin, Song, Liyuan, Wang, Zulin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.12.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithm design and analysis Algorithms Binary codes Binary system check node update Codes Complexity Computation Computational complexity Computer simulation Decoding Error correcting codes Error correction fixed paths Message passing Non-binary LDPC codes Parity check codes Partitioning algorithms Reliability Reliability analysis set partition
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!