On quasi-cyclic interleavers for parallel turbo codes
Information Theory
2007-07-16 v1 math.IT
Abstract
We present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e. growing as a logarithm of the interleaver size. These interleavers are also very practical in terms of memory requirements and their decoding error probabilities for small block lengths compare favorably with previous interleaving schemes.
Keywords
Cite
@article{arxiv.cs/0502055,
title = {On quasi-cyclic interleavers for parallel turbo codes},
author = {Joseph Boutros and Gilles Zémor},
journal= {arXiv preprint arXiv:cs/0502055},
year = {2007}
}
Comments
15 pages, 2 eps figures