LDPC码的交替迭代分层置信传播译码
Layered alternate iteration of shuffled belief propagation decoding of LDPC
姜小波 1李芳苑1
作者信息
- 1. 华南理工大学电子与信息学院,广东广州510641
- 折叠
摘要
低密度奇偶校验码(LDPC)通过迭代译码算法进行译码,例如置信传播算法(belief-propagation)便是其中一种译码方式.标准BP算法是并行译码,在更新所有校验节点及比特节点过程中,使用上一次迭代的更新信息.为了提高一定迭代次数下的收敛速度,在研究不同算法的基础上,如Layered BP算法(LBP)和Shuffled BP算法(SBP),通过改变节点的更新顺序,提出了改进的shuffled迭代译码算法.相对于普通的SBP算法,文章所提改进型SBP算法是传统置信传播收敛速度的两倍,并且在保持性能的同时降低复杂度.最后给出了CMMB标准下LDPC码的仿真结果.
Abstract
Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative decoding algorithm,such as belief-propagation (BP),over the factor graph of the codes.The standard BP schedule is a parallelizable decoding,using the same pre-update information during updating all the check nodes and bit nodes.In order to improve the convergence speed in terms of number of iterations,this paper proposes a modified shuffled version of iterative decoding of low-density parity-check codes by changing the updating order at bit nodes based on the study of several sequential schedules,such as the Layered belief-propagation (LBP) and the Shuffled belief-propagation (SBP).Compared with the plain shuffled version,the proposed scheme has the same convergence rate which is twice as the conventional belief propagation,and can reduce complexity without any performance degradation.At last,the simulation result is shown with respect to the LDPC codes in CMMB standard.
关键词
低密度奇偶校验码/迭代译码/并行分层译码/置信传播/CMMBKey words
LDPC/Iterative decoding/Parallel-layered decoding/belief-propagation/CMMB引用本文复制引用
出版年
2013
NETL
NSTL
维普
万方数据