A New Low-Resolution Min-Sum Decoder Based on Dynamic Clipping for LDPC Codes

Compared with the sum-product algorithm (SPA) with high decoding complexity for low-density parity-check (LDPC) codes, its approximated version, the min-sum algorithm (MSA), reduces the computational complexity at the cost of slight performance degradation. In order to compensate the oversized check-node messages in the MSA, the effect of clipping on variable-node messages is investigated under two-bit resolution. Our results show that the performance of clipped MSA degrades at the high bit error rate (BER) and increases at the low BER as clipping threshold enlarges. Based on these results, we propose a modified quantized MS decoding algorithm where the adaptive clipping threshold is applied on the variable-node messages according to the number of unsatisfied checks per-iteration. The adaptive rule is designed for easy hardware implementations. Numerical results show that the proposed algorithm has considerable improvement in performance compared with the MSA under two-bit precision. And it can achieve the performance near the SPA for some short-length LDPC codes.

[1]  Lara Dolecek,et al.  Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices , 2009, IEEE Transactions on Communications.

[2]  Gottfried Lechner,et al.  Improved Sum-Min Decoding for Irregular LDPC Codes , 2006 .

[3]  Peilin Liu,et al.  A Survey on Nonconvex Regularization-Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning , 2018, IEEE Access.

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

[5]  Jean-Yves Chouinard,et al.  On the correlation between error weights and syndrome weights for belief propagation decoding of LDPC codes , 2009, 2009 11th Canadian Workshop on Information Theory.

[6]  Jinghu Chen,et al.  Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.

[7]  Erik G. Larsson,et al.  Massive MIMO for next generation wireless systems , 2013, IEEE Communications Magazine.

[8]  Gottfried LECHNER.  Improved Sum-Min Decoding of LDPC Codes , .

[9]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[10]  Marc P. C. Fossorier,et al.  Two-dimensional correction for min-sum decoding of irregular LDPC codes , 2006, IEEE Communications Letters.

[11]  Robert C. Qiu,et al.  Cognitive Networked Sensing and Big Data , 2013 .

[12]  Robert G. Maunder,et al.  The 5G channel code contenders , 2016 .

[13]  L. Chu.  Efficient Nonlinear Precoding for Massive MU-MIMO Downlink Systems with 1-Bit DACs , 2018 .

[14]  Paul H. Siegel,et al.  Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes , 2012, IEEE Transactions on Communications.

[15]  Fei Wen,et al.  Robust Precoding Design for Coarsely Quantized MU-MIMO Under Channel Uncertainties-V0 , 2019, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

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

[17]  Robert C. Qiu,et al.  Efficient Nonlinear Precoding for Massive MIMO Downlink Systems With 1-Bit DACs , 2018, IEEE Transactions on Wireless Communications.

[18]  Fei Wen,et al.  Eigen-Inference Precoding for Coarsely Quantized Massive MU-MIMO System With Imperfect CSI , 2018, IEEE Transactions on Vehicular Technology.

[19]  Ajay Dholakia,et al.  Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.

[20]  Amir H. Banihashemi,et al.  On implementation of min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes , 2005, IEEE Transactions on Communications.