摘要
介绍了LDPC(低密度奇偶校验码)码的BP算法和基于BP的简化译码算法,并在AWGN(加性白高斯噪声)环境下进行了各自的仿真。通过误码性能和译码复杂度两方面的比较表明BP算法的性能更优越,但简化算法的复杂度相对来说有大幅的下降。
In this paper,BP and BPbased simplified decoding algorithms for LDPC codes are presented and simulations under AWGN are ginen too. The comparison in error performance and decoding complexity shows that BP algorithm is better in performance, but simplified algorithm gets a large reduce in complexity.
出处
《南京邮电学院学报（自然科学版）》
2003年第3期65-69,共5页
Journal of Nanjing University of Posts and Telecommunications
基金
国家高科技"八六三"计划(2002AA123046)资助项目
关键词
LDPC码
译码算法
低密度奇偶校验码
BP算法
简化译码算法
AWGN
Low density parity check codes
Message passing algorithm
Belief propagation algorithm
Belief propagation-based algorithm
