Finite-Length Scaling for Iteratively Decoded LDPC Ensembles

Details Finite-Length Scaling for Iteratively Decoded LDPC Ensembles Finite-Length Scaling for Iteratively Decoded LDPC Ensembles

2004-06-26

arxiv.org/abs/cs/0406050v1

Computer Science

Information Theory

45 pages, 14 figures

Scientific paper

In this paper we investigate the behavior of iteratively decoded low-density parity-check codes over the binary erasure channel in the so-called ``waterfall region." We show that the performance curves in this region follow a very basic scaling law. We conjecture that essentially the same scaling behavior applies in a much more general setting and we provide some empirical evidence to support this conjecture. The scaling law, together with the error floor expressions developed previously, can be used for fast finite-length optimization.

Affiliated with

Also associated with

No associations

Rating

Finite-Length Scaling for Iteratively Decoded LDPC Ensembles 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 Finite-Length Scaling for Iteratively Decoded LDPC Ensembles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite-Length Scaling for Iteratively Decoded LDPC Ensembles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706439