IEICE Trans - Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code

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

Shinya MIYAMOTO
Kenta KASAI
Kohichi SAKANIWA

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E90-A No.2 pp.531-534
Publication Date: 2007/02/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.2.531
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
Keyword:
Low-Density Parity-Check codes, Density Evolution, BEC, Belief Propagation, BSC, Gallager's algorithm,

Full Text: PDF(117.9KB)>>

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.

open access publishing via