摘要
提出了一种改进的低密度奇偶校验(LDPC)码串行译码算法.与传统的串行译码算法不同的是,该算法只需在初始化时计算一次变量节点对校验节点软信息的求和式,而在译码过程中该式可通过简单的局部更新得到.与传统串行算法相比,所提算法在不降低性能的前提下,具有更低的计算复杂度和更高的处理速度.
A modified serial decoding algorithm for low-density parity-check(LDPC) codes is proposed. Unlike conventional approaches, this algorithm calculates the sum of variable-to-check messages only once at the initialization stage, and then updates it by simple recursions during the decoding stage. Compared with the conventional serial LDPC decoding algorithm, the proposed algorithm has lower computational complexity and higher processing speed without any performance deterioration.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2008年第4期130-134,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家“973计划”项目(2007CB310604)
关键词
低密度奇偶校验码
串行译码
置信传播
迭代译码
low-density parity-check codes
serial decoding
belief propagation
iterative decoding