Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Journal of Beijing University of Posts and Telecommunications ›› 2020, Vol. 43 ›› Issue (4): 15-20.doi: 10.13190/j.jbupt.2019-222

• PAPERS • Previous Articles     Next Articles

A Dynamic Self-Corrected Minimum Sum Decoding Algorithm for LDPC Codes

CHEN Rong1,2, CHEN Lan1   

  1. 1. Institute of Microelectronics, Chinese Academy of Sciences, Beijing 100029, China;
    2. School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences, Beijing 100049, China
  • Received:2019-10-18 Published:2020-08-15

Abstract: Aiming at the trade-off between the decoding complexity and the decoding performance of low-density parity check (LDPC) codes, and improving the reliability and applicability of the decoding algorithm, a dynamic self-corrected minimum sum(DSCMS)algorithm is proposed based on the self-corrected minimum sum(SCMS)algorithm. In the process of iterative decoding, the algorithm sets the threshold according to the variable node message, clarifies the judgement of the message reliability in SCMS, and improves the error characteristics and convergence characteristics of the algorithm. Simulation results show that the error performance and convergence performance of DSCMS are better than those of SCMS. When the coding rate is 1/2, the number of iterations of DSCMS can be reduced by up to 7.15% compared with SCMS.

Key words: low-density parity-check codes, belief propagation, minimum sum algorithm, self-corrected minimum sum algorithm

CLC Number: