On quasi-cyclic interleavers for parallel turbo codes

Joseph J. Boutros, Gilles Zémor

Research output: Contribution to journalArticle

11 Citations (Scopus)


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
Issue number4
Publication statusPublished - 1 Apr 2006



  • 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