Finite-Length Scaling of Turbo-Like Code Ensembles on the Binary Erasure Channel

A possibility of estimating the finite-length performance of sparse-graph code ensembles gives two opportunities: to compare different codes of the same length in a context very close to real, practical applications and to perform the parameter optimization for a given code length [2]. We need a finite-length approximation that is valid for any code ensemble. The scaling approach seems to be a tool, general enough to provide such an approximation. However, the analytical derivation of parameters of the scaling approximation has been successful only for LDPC codes [1]; despite several attempts [25], [20], no such result was proposed for other code ensembles.

Published in:
Ieee Journal On Selected Areas In Communications, 27, 918-927
Presented at:
IEEE International Symposium on Information Theory, Toronto, CANADA, Jul 06-11, 2008

 Record created 2010-11-30, last modified 2018-03-17

Rate this document:

Rate this document:
(Not yet reviewed)