Title
Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code
Abstract
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.
Year
DOI
Venue
2007
10.1093/ietfec/e90-a.2.531
IEICE Transactions
Keywords
Field
DocType
degree distribution,regular ldpc code better,error probability,ldpc code ensemble,binary erasure channel,binary symmetric channel,uniform degree distribution,sufficient conditions,irregular ldpc code,decoding performance,ldpc code,non-uniform degree distribution,erasure probability
Discrete mathematics,Concatenated error correction code,Binary symmetric channel,Low-density parity-check code,Binary erasure channel,Theoretical computer science,Degree distribution,Decoding methods,Mathematics,Belief propagation,Erasure
Journal
Volume
Issue
ISSN
E90-A
2
0916-8508
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Shinya Miyamoto101.01
K. Kasai231933.57
Kohichi Sakaniwa333047.69