Open AccessPerformance analysis of the odd–even uniform interleaver for turbo codes
Author(s) -
Arkoudogiannis Konstantinos S.,
Dimakis Christos E.
Publication year - 2019
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2018.6250
Subject(s) - turbo code , interleaving , computer science , constraint (computer aided design) , turbo , algorithm , theoretical computer science , focus (optics) , turbo equalizer , serial concatenated convolutional codes , error floor , concatenated error correction code , mathematics , block code , decoding methods , physics , engineering , automotive engineering , geometry , optics , operating system
Interleaver design has been an intense research area since the invention of turbo codes, both from theoretical and technological perspectives, still receiving the attention of engineers. This work is a theoretical treatment on the subject of interleaver design, bringing into focus the odd‐even constraint. Odd‐even interleavers constrain information symbols at odd (even) positions to remain at odd (even) positions after interleaving. Having been adopted in a range of operational communication standards as parts of turbo codes on the one hand, and having raised scepticism about their gain in the literature of turbo trellis‐coded modulation on the other hand, these interleavers have motivated the present article. Concretely, the authors perform a bit‐error analysis of turbo‐code ensembles generated by the odd–even uniform interleaver , following the union‐bound approach by Benedetto et al. for the analysis of the uniform interleaver. They find that the odd–even constraint does not affect the interleaver gain of uniform‐interleaver ensembles; rather, it triggers a redistribution of multiplicities that leads to slightly worse performance mainly in the error‐floor region. The authors' findings are corroborated by bit‐error‐rate simulations.