An Efficient and Low-Complexity Iterative Reliability-Based Majority-Logic Decoding Algorithm for LDPC Codes

This paper presents a reliability-based iterative majority-logic decoding algorithm for LDPC codes. This decoding algorithm is a binary message-passing algorithm and requires only binary logical operations and integer additions. Consequently, it can be implemented with simple combinational logic circuits. It either outperforms or performs 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, it offers effective trade-off between performance and decoding complexity. It is particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields.

[1]  Amir H. Banihashemi,et al.  A Differential Binary Message-Passing LDPC Decoder , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[2]  Shu Lin,et al.  Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.

[3]  Zhenyu Liu,et al.  A decoding algorithm for finite-geometry LDPC codes , 2005, IEEE Transactions on Communications.

[4]  Christian Schlegel,et al.  Low-Density Parity-Check Codes , 2004 .

[5]  Marc P. C. Fossorier,et al.  A modified weighted bit-flipping decoding of low-density Parity-check codes , 2004, IEEE Communications Letters.

[6]  Nenad Miladinovic,et al.  Improved bit-flipping decoding of low-density parity-check codes , 2002, IEEE Transactions on Information Theory.

[7]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[8]  R. M. Tanner.  Spectral graphs for quasi-cyclic LDPC codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[9]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[10]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[11]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[12]  Adnan Masood.  Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .

[13]  Stig K. Andersen,et al.  Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .

[14]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[15]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[16]  Ming Jiang,et al.  An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes , 2005, IEEE Communications Letters.

[17]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[18]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[19]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .