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

Author

Huang, Qin ; Kang, Jingyu ; Zhang, Li ; Lin, Shu ; Abdel-Ghaffar, Khaled

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA, USA

Volume

57

Issue

12

fYear

2009

fDate

12/1/2009 12:00:00 AM

Firstpage

3597

Lastpage

3606

Abstract

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.

Keywords

binary codes; iterative decoding; parity check codes; telecommunication network reliability; LDPC codes; binary message-passing algorithms; combinational logic circuits; decoding complexity; error performance; integer additions; iterative logic decoding algorithms; reliability; sum-product algorithm; Combinational circuits; Convergence; Helium; Iterative algorithms; Iterative decoding; Message passing; Null space; Parity check codes; Sparse matrices; Sum product algorithm; Row-column constraint; binary message passing; majority-logic decoding; orthogonal check-sums;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2009.12.080493

Filename

5351656