Finite-Length Scaling for Iteratively Decoded LDPC Ensembles
Abdelaziz Amraoui, Andrea Montanari, Tom Richardson, Rudiger L. Urbanke · IEEE Transactions on Information Theory · 2009
We investigate the behavior of iteratively decoded low-density parity-check (LDPC) codes over the binary erasure channel in the so-called ldquowaterfall region.rdquo We show that the performance curves in this region follow a simple 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 a fast finite-length optimization.