论文部分内容阅读
文中通过分析信息在短环中传递的特性,提出了一种基于节点选择更新的简化LDPC译码算法。该算法可以通过在一定程度上避免短环对译码的影响来降低译码运算复杂度。仿真结果表明对于二元以及多元LDPC码,该算法相对于BP算法只有少量性能损失。
In this paper, a simplified LDPC decoding algorithm based on node selection update is proposed by analyzing the characteristics of information transmission in short loop. This algorithm can reduce the computational complexity of decoding by avoiding the influence of short loop on decoding to some extent. The simulation results show that the proposed algorithm has only a small loss of performance compared with the BP algorithm for binary and multivariate LDPC codes.