Wireless Personal Communications

, Volume 46, Issue 3, pp 365–370 | Cite as

A Low Complexity Algorithm for Generating Turbo Code s-Random Interleavers

  • Kostas V. Koutsouvelis
  • Christos E. Dimakis


In this paper we present a low complexity algorithm based on the bubble search sorting method that can be used to generate Turbo code interleavers that fulfill several criteria like spreading (s-randomness), code matched criteria and even the odd–even property for Turbo Trellis Coded Modulation. Simulation results show that for \(s < \sqrt{N/2}\) the algorithm is extremely efficient for short to medium interleaver lengths.


Turbo codes Turbo Trellis Coded Modulation (TTCM) s-Random Code-matched interleaver (CMI) 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near shannon limit error-correcting coding and decoding: Turbo codes. In Proceedings 1993 IEEE International Conference on Communications, Geneva, Switzerland, May 1993, pp. 1064–1070.Google Scholar
  2. 2.
    Dolinar, S., & Divsalar, D. (1995). Weight distributions for turbo codes using random and nonrandom permutations. TDA Progress Report 42–122, August 1995.Google Scholar
  3. 3.
    Yuan J., Vucetic B., Feng W. (1999). Combined turbo codes and interleaver design. IEEE Transactions on Communications 47: 484–487CrossRefGoogle Scholar
  4. 4.
    Crozier, S. (2000). New high-spread high-distance interleavers for Turbo codes. In Proceedings of the 20th Biennial Symposium on Communications, May 2000 (pp. 3–7). Kingston: Queen’s University.Google Scholar
  5. 5.
    Robertson P., Wörz T. (1998). Bandwidth-efficient Turbo Trellis-Coded Modulation using punctured component codes. IEEE Journal on Selected Areas in Communications 16(2): 206–218CrossRefGoogle Scholar
  6. 6.
    Fragouli C., Wesel R.D. (2001). Turbo-encoder design for symbol-interleaved parallel concatenated trellis coded modulation. IEEE Transactions on Communications 49: 425–435MATHCrossRefGoogle Scholar
  7. 7.
    Wu Y., Ogiwara H. (2004). Symbol-interleaver design for Turbo Trellis-Coded Modulation. IEEE Communications Letters 8l: 632–634CrossRefGoogle Scholar
  8. 8.
    Mouhamedou, Y., Crozier, S., & Kabal, P. (2004). Distance measurement method for double binary Turbo codes and a new interleaver design for DVB-RCS. In Proceedings of IEEE Globecom 2004, pp. 172–178.Google Scholar
  9. 9.
    Garello R., Pierleoni P., Benedetto S. (2001). Computing the free distance of Turbo codes and serially concatenated codes with interleavers: Algorithms and Applications. IEEE Journal on Selected Areas in Communications 19(5): 800–812CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC. 2007

Authors and Affiliations

  1. 1.Aristotle University of ThessalonikiThessalonikiGreece

Personalised recommendations