On quasi-cyclic interleavers for parallel turbo codes

Joseph Boutros, Gilles Zémor

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

In this correspondence, 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.

Original languageEnglish
Pages (from-to)1732-1739
Number of pages8
JournalIEEE Transactions on Information Theory
Volume52
Issue number4
DOIs
Publication statusPublished - 1 Apr 2006
Externally publishedYes

Fingerprint

Turbo codes
Decoding
Data storage equipment
Error probability

Keywords

  • Convolutional codes
  • Iterative decoding
  • Minimum distance
  • Quasi-cyclic codes
  • Turbo codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

On quasi-cyclic interleavers for parallel turbo codes. / Boutros, Joseph; Zémor, Gilles.

In: IEEE Transactions on Information Theory, Vol. 52, No. 4, 01.04.2006, p. 1732-1739.

Research output: Contribution to journalArticle

@article{904c2a8fcab14b77bfd20e86634c12bd,
title = "On quasi-cyclic interleavers for parallel turbo codes",
abstract = "In this correspondence, 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 = "Convolutional codes, Iterative decoding, Minimum distance, Quasi-cyclic codes, Turbo codes",
author = "Joseph Boutros and Gilles Z{\'e}mor",
year = "2006",
month = "4",
day = "1",
doi = "10.1109/TIT.2006.871061",
language = "English",
volume = "52",
pages = "1732--1739",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - On quasi-cyclic interleavers for parallel turbo codes

AU - Boutros, Joseph

AU - Zémor, Gilles

PY - 2006/4/1

Y1 - 2006/4/1

N2 - In this correspondence, 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.

AB - In this correspondence, 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.

KW - Convolutional codes

KW - Iterative decoding

KW - Minimum distance

KW - Quasi-cyclic codes

KW - Turbo codes

UR - http://www.scopus.com/inward/record.url?scp=33645722477&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645722477&partnerID=8YFLogxK

U2 - 10.1109/TIT.2006.871061

DO - 10.1109/TIT.2006.871061

M3 - Article

VL - 52

SP - 1732

EP - 1739

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

ER -