Finite-Length Scaling for Iteratively Decoded LDPC Ensembles

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.


Published in:
Proc. 41th Annual Allerton Conference on Communication, Control and Computing
Year:
2003
Keywords:
Laboratories:




 Record created 2006-11-22, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)