On quasi-cyclic interleavers for parallel turbo codes

Simple item page
dc.creatorBoutros, Joseph
dc.creatorZémor, Gilles
dc.date2005-02-10
dc.date.accessioned2026-07-07T08:17:45Z
dc.date.available2026-07-07T08:17:45Z
dc.descriptionWe 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.
dc.description15 pages, 2 eps figures
dc.identifierhttps://arxiv.org/abs/cs/0502055
dc.identifierhttp://arxiv.org/abs/cs/0502055
dc.identifierIEEE Transactions on Information Theory, IT-52, No 4 (2006) pp. 1732--1739.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134200
dc.subjectInformation Theory
dc.subjectE4
dc.titleOn quasi-cyclic interleavers for parallel turbo codes
dc.typetext

Files

Collections

arXiv