Finite-Length Scaling for Iteratively Decoded LDPC Ensembles
2003
Abstract
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.
Details
Title
Finite-Length Scaling for Iteratively Decoded LDPC Ensembles
Author(s)
Amraoui, A. ; Montanari, A. ; Richardson, T. ; Urbanke, R.
Published in
Proc. 41th Annual Allerton Conference on Communication, Control and Computing
Date
2003
Keywords
Laboratories
LTHC
Record Appears in
Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LTHC - Communication Theories Laboratory
Scientific production and competences > I&C - School of Computer and Communication Sciences > MICS - Mobile Information & Communication Systems
Scientific production and competences > MICS - Mobile Information & Communication Systems
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Scientific production and competences > I&C - School of Computer and Communication Sciences > MICS - Mobile Information & Communication Systems
Scientific production and competences > MICS - Mobile Information & Communication Systems
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Record creation date
2006-11-22