Improved iterative soft-reliability-based majority-logic decoding algorithm for non-binary low-density parity-check codes

Non-binary low-density parity-check (LDPC) codes have some advantages as opposed to their binary counterparts, but unfortunately their decoding complexity is a significant challenge. Hence, the iterative soft-reliability-based (ISRB) majority-logic decoding algorithm is attractive for non-binary LDPC codes, since it involves only finite field additions and multiplications as well as integer additions and comparisons. In this paper, we propose an improved ISRB majority-logic decoding algorithm by using a new reliability update. Our improved algorithm achieves better error performance and faster convergence, while further reducing the computational complexity. For instance, for a (16, 16)-regular (255, 175) cyclic Euclidean geometry LDPC code over GF(28), the proposed algorithm achieves a 0.15 dB coding gain and improves the convergence speed by 10% at a block error rate of 10−4 versus the ISRB majority-logic decoding algorithm. Compared with the ISRB majority-logic decoding algorithm, the proposed algorithm requires the same numbers of finite field additions and multiplications but fewer integer additions and comparisons. Furthermore, the ISRB majority-logic decoding algorithm is based on the accumulation of reliability information, and hence the numerical range of the reliability information increases with iterations. In contrast, the proposed reliability update has a fixed numerical range and thus simplifies hardware implementations.

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

[2]  Shengli Zhou,et al.  Nonbinary LDPC decoding by min-sum with Adaptive Message Control , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[3]  Jingyu Kang,et al.  An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes , 2011, IEEE Transactions on Communications.

[4]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[5]  Shu Lin,et al.  Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach , 2008, IEEE Transactions on Communications.

[6]  Shie Mannor,et al.  Majority-Based Tracking Forecast Memories for Stochastic LDPC Decoding , 2010, IEEE Transactions on Signal Processing.

[7]  Xinmiao Zhang,et al.  Low-Complexity Reliability-Based Message-Passing Decoder Architectures for Non-Binary LDPC Codes , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[9]  Qin Huang,et al.  Two Low-Complexity Reliability-Based Message-Passing Algorithms for Decoding Non-Binary LDPC Codes , 2010, IEEE Transactions on Communications.

[10]  Xinmiao Zhang,et al.  Efficient Check Node Processing Architectures for Non-binary LDPC Decoding Using Power Representation , 2012, 2012 IEEE Workshop on Signal Processing Systems.

[11]  Shu Lin,et al.  Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions - [transactions papers] , 2009, IEEE Transactions on Communications.

[12]  D. Declercq,et al.  Fast Decoding Algorithm for LDPC over GF(2q) , 2003 .

[13]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

[14]  Stefano Valle,et al.  NB-LDPC: Absorbing set and importance sampling , 2012, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[15]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[16]  Keshab K. Parhi,et al.  A Low-Complexity Hybrid LDPC Code Encoder for IEEE 802.3an (10GBase-T) Ethernet , 2009, IEEE Transactions on Signal Processing.

[17]  Khaled A. S. Abdel-Ghaffar,et al.  Two reliability-based iterative majority-logic decoding algorithms for LDPC codes , 2009, IEEE Transactions on Communications.

[18]  Valentin Savin,et al.  Min-Max decoding for non binary LDPC codes , 2008, 2008 IEEE International Symposium on Information Theory.

[19]  Tong Zhang,et al.  Joint (3,k)-regular LDPC code and decoder/encoder design , 2004, IEEE Transactions on Signal Processing.

[20]  Henk Wymeersch,et al.  Log-domain decoding of LDPC codes over GF(q) , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[21]  Hongxin Song,et al.  Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording , 2003 .

[22]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

[23]  Mohamad Sawan,et al.  Delayed Stochastic Decoding of LDPC Codes , 2011, IEEE Transactions on Signal Processing.

[24]  Lara Dolecek,et al.  Lowering LDPC Error Floors by Postprocessing , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

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

[26]  An-Yeu Wu,et al.  High-performance scheduling algorithm for partially parallel LDPC decoder , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[27]  David Declercq,et al.  Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ , 2007, IEEE Transactions on Communications.

[28]  Moon Ho Lee,et al.  Large Girth Non-Binary LDPC Codes Based on Finite Fields and Euclidean Geometries , 2009, IEEE Signal Processing Letters.