Abstract—A BP-based algorithm with 2-dimensional classified normalized correction is developed to reduce the complexity and improve the performance of decoding algorithm for the low density parity check (LDPC) codes. The algorithm first utilizes classification according to the absolute values of incoming messages in check nodes. Then it uses 2-dimensional normalization to correct the minimum and sub-minimum values. The 2-dimensional normalized factors can be calculated respectively by using probability and statistic theory in the initialization step. Simulation results illustrate that the proposed algorithm achieves better performance in bit error ratio (BER) and average iteration number than normalized BP-based algorithm in the high signal noise ratio (SNR) region, i.e., it can achieve 0.4 dB SNR gain and reduce 20% number of iterations at BER=10^-5, whose complexity is also much less than that of belief propagation (BP) algorithm. It is concluded that the proposed algorithm offers better tradeoff between performance and complexity.

Index Terms—channel coding theory, density evolution, Iterative decoding algorithm

Cite: Zhou Zhong, Shuming Guo, Xiangyang Xu, and Huiqing Bai, "A Classified Normalized BP-Based Algorithm with 2-Dimensional Correction for LDPC Codes," Journal of Communications, vol. 8, no. 5, pp. 315-321, 2013. Doi: 10.12720/jcm.8.5.315-321