Improved low-density parity-check codes using irregular graphs and belief propagation

被引：53

作者：

Luby, MG ^{[1
]}

Mitzenmacher, M ^{[1
]}

Shokrollahi, MA ^{[1
]}

Spielman, DA ^{[1
]}

机构：

[1] Int Comp Sci Inst, Berkeley, CA 94704 USA

来源：

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS | 1998年

关键词：

D O I：

10.1109/ISIT.1998.708706

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

We construct new families of low-density parity-check codes, which we call irregular codes. When decoded using belief propagation, our codes can correct more errors than previously known low-density codes. Our improved performance comes from using codes based on irregular random bipartite graphs, based on the work of [2]. Previously studied low-density codes have been derived from regular bipartite graphs. Initial experimental results for our irregular codes suggest that, with improvements, irregular codes may be able to match turbo code performance.

引用

页码：117 / 117

页数：1