Detailedly Represented Irregular Low-Density Parity-Check Codes

Kenta KASAI  Tomoharu SHIBUYA  Kohichi SAKANIWA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E86-A   No.10   pp.2435-2444
Publication Date: 2003/10/01
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
density evolution,  irregular low-density parity-check codes,  low-density parity-check codes,  belief propagation,  

Full Text: PDF>>
Buy this Article

Richardson and Urbanke developed a powerful method density evolution which determines, for various channels, the capacity of irregular low-density parity-check code ensembles. We develop generalized density evolution for minutely represented ensembles and show it includes conventional representation as a special case. Furthermore, we present an example of code ensembles used over binary erasure channel and binary input additive white Gaussian noise channel which have better thresholds than highly optimized ensembles with conventional representation.