On quasi-cyclic interleavers for parallel turbo codes Academic Article

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. 2006 IEEE.

authors

• Boutros, Joseph

published proceedings

• IEEE TRANSACTIONS ON INFORMATION THEORY

author list (cited authors)

• Boutros, J. J., & Zemor, G.

citation count

• 11

complete list of authors

• Boutros, JJ||Zemor, G

publication date

• April 2006

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Convolutional Codes
• Iterative Decoding
• Minimum Distance
• Quasi-cyclic Codes
• Turbo Codes

Digital Object Identifier (DOI)

• 10.1109/TIT.2006.871061

start page

• 1732

end page

• 1739

volume

• 52

issue

• 4