Analysis of the Dual-Threshold-Based Shrinking Scheme for Efficient NB-LDPC Decoding

In this paper, the dual-threshold-based shrinking (DTBS) scheme for efficient non-binary low-density parity-check (NB-LDPC) decoding, which has been initially presented in our previous work [1], is further studied. Particularly, the TIT-MSA is an example to employ this scheme presented in [1]. Its computational complexity is theoretically analyzed in this paper. Numerical results show that more than 70% computational complexity is reduced compared with the SMSA, while the error performance loss is negligible. Besides, when considering memory consumption, we extend this scheme by setting a maximum number of kept values with an efficient searching method, and apply it to the TIT-MSA. Simulation results indicate that the new decoding algorithm achieves both comparable error performance and significant memory reduction. For example, the memory consumption is reduced by about 61% for a (256, 203) code over GF(28) and about 31% for an (837, 726) code over GF(25).

[1]  David Declercq,et al.  One Minimum Only Trellis Decoder for Non-Binary Low-Density Parity-Check Codes , 2015, IEEE Transactions on Circuits and Systems I: Regular Papers.

[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.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[4]  Zhongfeng Wang,et al.  An Efficient NB-LDPC Decoding Algorithm for Next-Generation Memories , 2018, 2018 IEEE International Symposium on Circuits and Systems (ISCAS).

[5]  Hanho Lee,et al.  Basic-Set Trellis Min–Max Decoder Architecture for Nonbinary LDPC Codes With High-Order Galois Fields , 2018, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  Javier Valls-Coquillat,et al.  Reduced-Complexity Nonbinary LDPC Decoder for High-Order Galois Fields Based on Trellis Min–Max Algorithm , 2016, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[7]  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.

[8]  Javier Valls-Coquillat,et al.  Reduction of Complexity for Nonbinary LDPC Decoders With Compressed Messages , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

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

[10]  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.

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

[12]  Javier Valls-Coquillat,et al.  High-Performance NB-LDPC Decoder With Reduction of Message Exchange , 2016, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

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

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

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

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