Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions

Takayuki NOZAKI  Kenta KASAI  Tomoharu SHIBUYA  Kohichi SAKANIWA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E91-A   No.10   pp.2737-2744
Publication Date: 2008/10/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e91-a.10.2737
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
detailedly represented irregular LDPC code ensembles,  evolution of degree distributions in residual graphs,  peeling algorithm,  binary erasure channel,  

Full Text: PDF(276.3KB)>>
Buy this Article




Summary: 
Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles. Evolution of degree distributions in residual graphs is important characteristic which is used for finite-length analysis of the expected block and bit error probability over the binary erasure channel. In this paper, we derive detailed evolution of degree distributions in residual graphs for irregular LDPC code ensembles with joint degree distributions.