Finite-Length Scaling for Iteratively Decoded LDPC Ensembles

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper we investigate the behavior of iteratively decoded low-density parity-check codes over the binary erasure channel in the so-called ``waterfall region." We show that the performance curves in this region follow a very basic 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 fast finite-length optimization.
45 pages, 14 figures

Keywords

Information Theory, Disordered Systems and Neural Networks, Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133384

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0406050
 http://arxiv.org/abs/cs/0406050

Collections

arXiv