一种多进制LDPC码动态扩展最小和译码算法  

A Dynamic Extension Min-sum Decoding Algorithm for Nonbinary LDPC Codes

作　　者：王欣婷 潘克刚 赵瑞祥 WANG Xin-ting;PAN Ke-gang;ZHAO Rui-xiang(Army Engineering University of PLA,Nanjing Jiangsu 210007,China)

机构地区：[1]陆军工程大学,江苏南京210007

出　　处：《通信技术》2020年第11期2627-2634,共8页Communications Technology

基　　金：国家自然科学基金项目(No.61671476)。

摘　　要：针对多进制LDPC码扩展最小和(Extended Min-Sum,EMS)译码算法复杂度较高的问题,提出了一种新的动态EMS算法。通过判定每次迭代过程中校验节点的收敛特性,动态调整校验节点更新过程中的截短长度,缩短收敛性较低节点的消息向量长度以降低运算量,同时降低了其对下次迭代过程产生的影响。仿真结果表明,所提算法与标准EMS算法相比性能相当,且平均截短长度更小,具有更低的运算复杂度。Aiming at the problem of EMS(Extended Min-Sum)decoding algorithm,a new dynamic EMS algorithm is proposed.By determining the convergence characteristics of check nodes in each iteration,the truncation length in check nodes update process is dynamically changed,the message vector length of the node with lower convergence shortened to reduce the amount of calculation,and at the same time,its impact on the next iteration process reduced.The simulation results indicate that the proposed algorithm has the similar performance,smaller average truncation length and lower computational complexity as compared with the standard EMS algorithm.

关 键 词：多进制LDPC码 扩展最小和算法 截短规则 收敛性 

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