Computer Science – Information Theory
Scientific paper
2007-11-07
Computer Science
Information Theory
Submitted to the IEEE Trans. on Information Theory, November 7th, 2007
Scientific paper
This paper provides simple lower bounds on the number of iterations which is required for successful message-passing decoding of some important families of graph-based code ensembles (including low-density parity-check codes and variations of repeat-accumulate codes). The transmission of the code ensembles is assumed to take place over a binary erasure channel, and the bounds refer to the asymptotic case where we let the block length tend to infinity. The simplicity of the bounds derived in this paper stems from the fact that they are easily evaluated and are expressed in terms of some basic parameters of the ensemble which include the fraction of degree-2 variable nodes, the target bit erasure probability and the gap between the channel capacity and the design rate of the ensemble. This paper demonstrates that the number of iterations which is required for successful message-passing decoding scales at least like the inverse of the gap (in rate) to capacity, provided that the fraction of degree-2 variable nodes of these turbo-like ensembles does not vanish (hence, the number of iterations becomes unbounded as the gap to capacity vanishes).
Sason Igal
Wiechman Gil
No associations
LandOfFree
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-502485