conference paper
Finite-Length Scaling for Iteratively Decoded LDPC Ensembles
2003
Proc. 41th Annual Allerton Conference on Communication, Control and Computing
In this paper we investigate the behaviour of iteratively decoded low-density parity-check codes over the binary erasure channel in the so-called "waterfall region". We show that, according to a simplified model, the performance curves in this region follow a very basic scaling law. This scaling law together with the error floor expressions developed previously can be used for fast finite-length optimization of low-density parity-check codes.
Type
conference paper
Author(s)
Date Issued
2003
Published in
Proc. 41th Annual Allerton Conference on Communication, Control and Computing
Subjects
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
November 22, 2006
Use this identifier to reference this record