Finite-length scaling for iteratively decoded LDPC ensembles

  • Authors:
  • Abdelaziz Amraoui;Andrea Montanari;Tom Richardson;Rüdiger Urbanke

  • Affiliations:
  • Swiss Federal Institute of Technology, Lausanne, Switzerland;Department of Electrical Engineering and Statistics, Stanford University, Stanford, CA and Laboratoire de Physique Théorique de l'ENS, Paris, France;Flarion Technologies, Bedminster, NJ;Swiss Federal Institute of Technology, Lausanne, Switzerland

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.84

Visualization

Abstract

We investigate the behavior of iteratively decoded low-density parity-check (LDPC) codes over the binary erasure channel in the so-called "waterfall region". 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.