基于RMP调度的简化差分域LDPC译码算法  

The simplified difference-domain LDPC decoding algorithm based on RMP-scheduling

作　　者：雷海军[1] 刘鹏[2] 何业军[2] 谢莲花[2] 

机构地区：[1]深圳大学计算机与软件学院,深圳518060 [2]深圳大学信息工程学院,深圳518060

出　　处：《四川大学学报（自然科学版）》2012年第3期582-586,共5页Journal of Sichuan University(Natural Science Edition)

基　　金：国家自然科学基金项目(60972037);省部产学研项目(2009B090300267);深圳市基础研究计划(JC200903120101A);深圳大学国家特色专业教学项目(2011016;2010021);大学生创新实验项目(0000175630)

摘　　要：针对对数域和积LDPC(Low Density Parity Check Codes)译码算法复杂度高和译码采用的SMP(Standard Message Passing)调度算法收敛速度慢的问题,提出基于RMP(RowMessage Passing)调度的简化差分域LDPC译码算法.用RMP调度优化变量节点信息更新使收敛速度提高一倍.由于在Tanner图上传递的是概率的差分值,并且在校验节点信息更新时选择w个绝对值最小的差分值进行,降低了算法复杂度.实验表明本文算法在不降低译码性能条件下降低了算法复杂度,提高了算法收敛速度.As for the problems of the high complexity of LogDomain sumproduct LDPC decoding algorithm and the slow convergence rate based on SMP scheduling, this paper propose the simplified differencedomain LDPC decoding algorithm based on RMP scheduling.The update of variablenodes are optimized by RMP scheduling,which can accelerate the convergence rate one time. Due to that the messages pass on the Tanner graph are probability differences and the update of checknodes are carried out by w minimum absolute values, which can further reduce the complexity of computation.In contrast with decoding algorithm by experiment show that the proposed algorithm can reduce the complexity of computation and accelerate the convergence rate, while it has no obvious loss of decoding performance.

关 键 词：LDPC码 SMP调度 RMP调度 对数域和积译码 差分域和积译码 

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