Paper Info
Title
Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations
Abstract
Communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding is considered. The average bit error probability of an irregular LDPC code ensemble after a fixed number of iterations converges to a limit, which is calculated via density evolution, as the blocklength n tends to infinity. The difference between the bit error probability with blocklength n and the large-blocklength limit behaves asymptotically like α/n, where the coefficient α depends on the ensemble, the number of iterations and the erasure probability of the BEC. In [1], α is calculated for regular ensembles. In this paper, α for irregular expurgated ensembles is derived. It is demonstrated that convergence of numerical estimates of α to the analytic result is significantly fast for irregular unexpurgated ensembles.
Year
DOI
Venue
2009
10.1109/ISIT.2009.5206063
international symposium on information theory
Keywords
Field
DocType
bit error probability,fixed number,irregular ldpc code ensemble,average bit error probability,finite number,blocklength n,finite-length analysis,irregular expurgated ensemble,iterations converges,irregular expurgated ldpc code,irregular unexpurgated ensemble,binary erasure channel,erasure probability,iteration method,block codes,data mining,binary codes,probability density function,channel coding,decoding,error probability,lead
Discrete mathematics,Combinatorics,Low-density parity-check code,Block code,Binary code,Binary erasure channel,Decoding methods,Probability density function,Mathematics,Belief propagation,Erasure
Journal
Volume
Citations 
PageRank 
abs/0901.2204
0
0.34
References 
Authors
5
4
Name
Order
Citations
PageRank
Ryuhei Mori125224.62
Toshiyuki Tanaka225523.32
K. Kasai331933.57
Kohichi Sakaniwa433047.69