LDPC码的低复杂度译码算法研究  

A Study on Low Complexity Decoding Algorithm of LDPC Codes

作　　者：邓勇强[1] 朱光喜[1] 刘文明[1] 

机构地区：[1]华中科技大学电子与信息工程系

出　　处：《计算机科学》2006年第7期16-19,共4页Computer Science

基　　金：国家自然科学基金重大项目"未来移动通信系统基础理论与技术研究"(No.60496315);国家高技术研究发展计划(863计划)(No.2003AA12331005)。

摘　　要：本文在对LDPC码的译码算法分析的基础上,针对校验矩阵中含有的环对译码算法的影响,提出了一种基于置信传播算法基础上的低复杂度译码算法。该算法通过及时切断消息在环上的重传回路,可消除因校验矩阵中的环回传原始信息对译码造成的影响,保证优质的原始信息能尽可能地传播到其能传播的节点,从而提升了LDPC码的译码性能。仿真实验表明,该算法具有低于传统算法的复杂度,在低信噪比的信道中可以获得相当于传统算法的性能,在良好的信道条件下可以取得比传统算法更优异的性能。In this paper, the decoding algorithm of low-density parity-check（I.DPC）codes is analyzed,and a new decoding algorithm based on the belief propagation（BP）algorithm to eliminate the influence of cycles in the factor graph is proposed. In the traditional BP algorithm, the cycles of factor graph will send message hack to its source,and this will decrease the decoding performance. The new algorithm records each cycle＇s path and length of each node,and cuts off the path by which message is propagated when the message will come back. It can advance the decoding performance by protect the message of good quality be propagated as widely as possible. Our results of simulation show that the performance of new algorithm is not worse than that of traditional BP algorithm in the low SNR channel and the new algorithm significantly outperform traditional BP algorithm in good channel condition.

关 键 词：低密度校验码 置信传播算法 环 因子图 迭代译码 

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