基于置信传播的优化译码算法研究
doi: 10.3724/SP.J.1146.2005.00764
Research of Optimal Decoding Algorithm Based on Belief Propagation
-
摘要: 该文在对LDPC码的译码算法分析的基础上，针对校验矩阵中含有的环对译码算法的影响，提出了一种在置信传播算法基础之上的译码算法。该算法通过及时切断消息在环上的重传回路，可消除因校验矩阵中的环回传原始信息对译码造成的影响，保证优质的原始信息能尽可能地传播到其能传播的节点，从而提升了LDPC码的译码性能。仿真实验表明，在低信噪比的信道中，该算法具有相当于传统算法的性能和更低的计算复杂度；在良好的信道条件下可以取得比传统算法更优异的性能。Abstract: In this paper, the decoding algorithm of Low-Density Parity-Check (LDPC) 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 back to its source, and this will decrease the decoding performance. The new algorithm records each cycles 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. The 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.
-
[1] Gallager R G. Low-density parity-check codes[J].IEEE Trans. on Inform. Theory.1962, 8(1):21-28 [2] Moura J M F, Lu Jin, and Zhang Haotian. Structured low density parity-check codes[J].IEEE Signal Processing Magazine.2004, 21(1):42-55 [3] Mackay D J C. Good error-correcting codes based on very sparse matrices[J].IEEE Trans. on Inform. Theory.1999, 45(3):399-431 [4] Kaschischang F R, Frey B J, and Loeliger H A. Factor graphs and the sum-product algorithm[J].IEEE Trans. on Inform. Theory.2001, 47(2):498-519 [5] 贺玉成. 基于图模型的低密度校验码理论及应用研究. [博士论文], 西安: 西安电子科技大学, 2002. [6] Gallager R G. Low-Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963: 87-88. -
计量
- 文章访问数: 3492
- HTML全文浏览量: 98
- PDF下载量: 1554
- 被引次数: 0
下载:
