一种动态自纠正最小和LDPC码的译码算法  

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

作　　者：陈容 陈岚[1] CHEN Rong;CHEN Lan(Institute of Microelectronics,Chinese Academy of Sciences,Beijing 100029,China;School of Electronic,Electrical and Communication Engineering,University of Chinese Academy of Sciences,Beijing 100049,China)

机构地区：[1]中国科学院微电子研究所,北京100029 [2]中国科学院大学电子电气与通信工程学院,北京100049

出　　处：《北京邮电大学学报》2020年第4期15-20,共6页Journal of Beijing University of Posts and Telecommunications

基　　金：国家科技重大专项项目(2018ZX03001006-002)。

摘　　要：针对低密度奇偶校验(LDPC)码的译码算法复杂度和译码性能的均衡,为了提高译码算法的可靠性和适用性,在自纠正最小和(SCMS)算法的基础上,提出了一种动态自纠正最小和(DSCMS)算法.该算法在迭代译码的过程中,根据变量节点消息设置阈值,明确了SCMS算法中对消息可靠性的判断,提高了算法的误码特性和收敛特性.仿真结果表明,所提出的DSCMS算法的误码性能和收敛性能都要优于SCMS算法及其改进算法.当编码效率为1/2时,DSCMS算法与SCMS算法相比,最多能降低7.15%的迭代次数.Aiming at the trade-off between the decoding complexity and the decoding performance of lowdensity 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.

关 键 词：低密度奇偶校验码 置信传播 最小和算法 自纠正最小和算法 

分 类 号：TN911.22[电子电信—通信与信息系统]