Density evolution for two improved BP-based decoding algorithms of LDPC codes

被引：283

作者：

Chen, JH ^{[1
]}

Fossorier, MPC ^{[1
]}

机构：

[1] Univ Hawaii, Dept Elect Engn, Honolulu, HI 96822 USA

来源：

IEEE COMMUNICATIONS LETTERS | 2002年 / 6卷 / 05期

基金：

美国国家科学基金会;

关键词：

block codes; density evolution; iterative decoding; LDPC codes;

D O I：

10.1109/4234.1001666

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

In this letter, we analyze the performance of two improved belief propagation (BP) based decoding algorithms for LDPC codes, namely the normalized BP-based and the offset BP-based algorithms, by means of density evolution. The numerical calculations show that with one properly chosen parameter for each of these two improved BP-based algorithms, performances very close to that of the BP algorithm can be achieved. Simulation results for LDPC codes with code length moderately long validate the proposed optimization.

引用

页码：208 / 210

页数：3

共 9 条

[1]

ANASTASOPOULOS A, 2001, P GLOB 2001 SAN ANT

[2]

[Anonymous], 2000, THESIS MIT

[3] Near optimum universal belief propagation based decoding of low-density parity check codes [J].