A Dynamic Self-Corrected Minimum Sum Decoding Algorithm for LDPC Codes [一种动态自纠正最小和LDPC码的译码算法]

作者：Chen R.; Chen L.^*

来源：Journal of Beijing University of Posts and Telecommunications, 2020, 43(4): 15-20.

DOI：10.13190/j.jbupt.2019-222

• Belief propagation
• Low-density parity-check codes
• Minimum sum algorithm
• Self-corrected minimum sum algorithm

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. ? 2020, Editorial Department of Journal of Beijing University of Posts and Telecommunications. All right reserved.

• 单位
  中国科学院大学