摘要
基于低密度校验(LDPC)码置信传播译码算法,综合译码性能、复杂度和延时,提出了低复杂度并行译码算法.该算法通过对校验节点传递给比特节点的信息进行有效简化,使计算复杂度接近“最小和”算法.仿真结果表明,其性能与置信传播算法非常接近.
Baed on decoding performance, complexity and latency of low density parity check (LDPC) codes, a low-complexity parallel decoding algorithm was proposed. By simplifying the message sent from check nodes to bit nodes, the complexity of the algorithm approaches that of the “mini-sum” algorithm. Simulation results show that the performance is very close to belief propagation algorithm in performance.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2005年第5期59-61,共3页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(60272052)
国家"863计划"项目(2001AA123016)
关键词
低密度校验码
二分图
置信传播算法
low density parity check code
bipartite graph
belief propagation algorithm