Two reliability-based iterative majority-logic decoding algorithms for LDPC codes

This paper presents two novel reliability-based iterative majority-logic decoding algorithms for LDPC codes. Both algorithms are binary message-passing algorithms and require only logical operations and integer additions. Consequently, they can be implemented with simple combinational logic circuits...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on communications Ročník 57; číslo 12; s. 3597 - 3606
Hlavní autoři:	Huang, Q, Kang, J, Zhang, L, Lin, S, Abdel-Ghaffar, K
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.12.2009 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Applied sciences binary message passing Coding, codes Combinational circuits Complexity Convergence Decoding Errors Exact sciences and technology Information, signal and communications theory Integers Iterative algorithms Iterative decoding Logic circuits majority-logic decoding Message passing Null space orthogonal check-sums Parity check codes Row-column constraint Signal and communications theory Sparse matrices Sum product algorithm Telecommunications and information theory Tradeoffs Performance evaluation Bit flipping Error estimation binary message passing Majority logic Row-column constraint Algorithm Iterative decoding Implementation Logic circuit Message passing Algorithm complexity Error correcting code Parity check codes majority-logic decoding orthogonal check-sums
ISSN:	0090-6778, 1558-0857
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	This paper presents two novel reliability-based iterative majority-logic decoding algorithms for LDPC codes. Both algorithms are binary message-passing algorithms and require only logical operations and integer additions. Consequently, they can be implemented with simple combinational logic circuits. They either outperform or perform just as well as the existing weighted bit-flipping or other reliability-based iterative decoding algorithms for LDPC codes in error performance with a faster rate of decoding convergence and less decoding complexity. Compared to the sum-product algorithm for LDPC codes, they offer effective trade-offs between performance and decoding complexity.
Bibliografie:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
ISSN:	0090-6778 1558-0857
DOI:	10.1109/TCOMM.2009.12.080493