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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on communications Ročník 65; číslo 12; s. 5110 - 5122
Hlavní autori:	Huang, Qin, Song, Liyuan, Wang, Zulin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.12.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!