A reduced complexity decoding algorithm for NB-LDPC codes

Non-binary low-density parity-check (NB-LDPC) codes perform much better than their binary counterparts, when codeword length is moderate or high-order modulation is used. However, the implementation of a NB-LDPC decoder usually suffers from excessive hardware complexity and large memory requirement. Many new algorithms and decoding schedules have been introduced in recent literatures to reduce the decoding complexity in further. However, the complexity of current decoding algorithms for NB-LDPC codes is still high. In this paper, a two-extra-column trellis min-sum algorithm (TEC-TMSA) is proposed. The TEC-TMSA combines the two-extra-column method and the trellis min-sum algorithm in an intelligent way. Since only the minimum value of a row needs to be sorted out for configuration constructions, the computational complexity of the proposed TEC-TMSA is much lower than that of the TMSA. Furthermore, we develop a novel location-fixed selection scheme, which significantly decreases the number of required comparison operations in the TEC-TMSA with negligible performance loss.

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

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

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

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

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

[6]  Hanho Lee,et al.  Two-Extra-Column Trellis Min–Max Decoder Architecture for Nonbinary LDPC Codes , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[7]  David Declercq,et al.  Trellis-Based Extended Min-Sum Algorithm for Non-Binary LDPC Codes and its Hardware Structure , 2013, IEEE Transactions on Communications.

[8]  David Declercq,et al.  Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images , 2008, IEEE Transactions on Communications.

[9]  David Declercq,et al.  Simplified Trellis Min–Max Decoder Architecture for Nonbinary Low-Density Parity-Check Codes , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[10]  Sangmin Kim.  Improved trellis-based decoder for non-binary LDPC codes , 2016, 2016 International Conference on Computing, Networking and Communications (ICNC).

[11]  Emmanuel Boutillon,et al.  Bubble check: a simplified algorithm for elementary check node processing in extended min-sum non-binary LDPC decoders , 2010 .

[12]  Xiaoheng Chen,et al.  High-Throughput Efficient Non-Binary LDPC Decoder Based on the Simplified Min-Sum Algorithm , 2012, IEEE Transactions on Circuits and Systems I: Regular Papers.

[13]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

[14]  Zongwang Li,et al.  A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes , 2012, IEEE Transactions on Communications.

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

[16]  David Declercq,et al.  Low-complexity decoding for non-binary LDPC codes in high order fields , 2010, IEEE Transactions on Communications.

[17]  Dan Feng Zhao,et al.  Min-Max decoding for non binary LDPC codes , 2016 .