Minimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC
Information Theory
2008-03-13 v1 math.IT
Abstract
In this paper we investigate the decoding of parallel turbo codes over the binary erasure channel suited for upper-layer error correction. The proposed algorithm performs on-the-fly decoding, i.e. it starts decoding as soon as the first symbols are received. This algorithm compares with the iterative decoding of codes defined on graphs, in that it propagates in the trellises of the turbo code by removing transitions in the same way edges are removed in a bipartite graph under message-passing decoding. Performance comparison with LDPC codes for different coding rates is shown.
Cite
@article{arxiv.0803.1807,
title = {Minimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC},
author = {Ghassan M. Kraidy and Valentin Savin},
journal= {arXiv preprint arXiv:0803.1807},
year = {2008}
}
Comments
5 pages, submitted SPAWC08