基于可靠性更新的低复杂度BP译码算法Low-电子与信息学报.PDF

第31 卷第10 期 电 子 与 信 息 学 报 Vol.31No.10 2009 年10 月 Journal of Electronics Information Technology Oct. 2009 基于可靠性更新的低复杂度BP 译码算法 陈 昕 门爱东 (北京邮电大学电信工程学院 北京 100876) 摘 要：基于部分符号更新策略的BP (Belief Propagation)译码算法减少了LDPC (Low-Density Parity-Check)码 的译码运算量，提高了译码效率。然而在其译码过程中，由于变量节点可靠性判决准确率不高，而且可靠性被误判 的错误节点无法在后继的译码中得到修正，译码性能大大降低。该文提出一种改进的节点可靠性判决准则，提高迭 代过程中对变量节点可靠性判断的准确率；同时，在每次迭代结束后，重新衡量所有变量节点的可靠性，以此来消 除可靠性误判对译码性能的影响。仿真结果表明，改进的算法不仅使传统BP 译码的复杂度降低，而且提高了BP 算法的译码性能。 关键词：低密度奇偶校验码；置信传播算法；可靠性准则；低复杂度译码 中图分类号：TN911.22 文献标识码：A 文章编号：1009-5896(2009)10-2421-06 Low Complexity BP Decoding Algorithm Based on Reliability Updating Schedule Chen Xin Men Ai-dong (School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China) Abstract: BP (Belief Propagation) decoding based on reliability updating schedule reduces the computational complexity and improves the decoding efficiency. However, the poor Bit Error Rate (BER) performance of the decoding appears due to the low accuracy of reliability criteria and the wrong bits which are no longer update. Therefore, an improved reliability criteria and modified updating schedule are proposed to increase the accuracy of the criteria. The simulation results show that the proposed algorithm can reduce the computational complexity and improve the decoding performance of conventional BP algorithm. Key words: Low-Density Parity-Check (LDPC) codes; Belief Propagation (BP) algorithm; Reliability criteria; Low-complexity decoding 1 引言 有错误的节点被停止更新，后继的译码过程将无法 低密度奇偶校验码(LDPC)是Gallager 于 1962 对其修正，所以译