摘要
针对低密度奇偶校验码(LDPC)的置信传播算法(BP)、分层算法(LBP)在迭代过程中以随机的节点顺序更新,不能快速达到收敛的特点,本文详细分析了一种选择可靠度小的节点先更新的动态译码算法,并以应用于CMMB标准的LDPC码进行性能仿真。与LBP算法相比,动态算法的译码收敛速度明显提高,译码的平均迭代次数减少50%。最后对动态算法的译码复杂度进行了分析。
The traditional Belief-Propagation algorithm and Layered Belief-Propagation algorithm of low-density parity-check codes can't converge fast because of the random updating order of the check nodes. This paper discusses a dynamic decoding algorithm in detail, which updates the nodes with low reliability first. Compared with the static hierarchical algorithm, the simulations, which are made in the terms of the standard of CMMB, show tfiat dynamic algorithm significantly improves the convergence rate of decoding and its average iteration number can be reduced to 50%. Finally, complexity is also addressed.
出处
《电路与系统学报》
CSCD
北大核心
2010年第3期59-62,共4页
Journal of Circuits and Systems
基金
国家自然科学基金赞助项目(60976031)