Near optimal reduced-complexity decoding algorithms for LDPC codes

被引：10

作者：

Chen, J ^{[1
]}

Dholakia, A ^{[1
]}

Eleftheriou, E ^{[1
]}

Fossorier, M ^{[1
]}

Hu, XY ^{[1
]}

机构：

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

来源：

ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/ISIT.2002.1023727

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, two families of reduced-complexity algorithms for decoding low-density parity-check (LDPC) codes based on incorporating either a normalization or a correction term in the check-node update are presented. A simplified symbol-node update can also be used. Using simulations, it is shown that these simplified belief propagation (BP) approaches provide near optimum performance with different classes of LDPC codes.

引用

页码：455 / 455

页数：1