The search functionality is under construction.
The search functionality is under construction.

Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code

Shinya MIYAMOTO, Kenta KASAI, Kohichi SAKANIWA

  • Full Text Views

    0

  • Cite this

Summary :

Decoding performance of LDPC (Low-Density Parity-Check) codes is highly dependent on the degree distributions of the Tanner graphs which define the LDPC codes. We compare two LDPC code ensembles, one has a uniform degree distribution and the other a non-uniform one over a BEC (Binary Erasure Channel) and a BSC (Binary Symmetric Channel) thorough DE (Density Evolution). We then derive sufficient conditions on the erasure probability of a BEC and the error probability of a BSC, under which the LDPC code ensembles with uniform degree distributions outperform those with non-uniform degree distributions.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.2 pp.531-534
Publication Date
2007/02/01
Publicized
Online ISSN
1745-1337
DOI
10.1093/ietfec/e90-a.2.531
Type of Manuscript
LETTER
Category
Coding Theory

Authors

Keyword