Skip to main content

Advertisement

Springer Nature Link
Log in

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

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

  2. Dolinar, S., & Divsalar, D. (1995). Weight distributions for turbo codes using random and nonrandom permutations. TDA Progress Report 42–122, August 1995.

  3. Yuan J., Vucetic B., Feng W. (1999). Combined turbo codes and interleaver design. IEEE Transactions on Communications 47: 484–487

    Article  Google Scholar 

  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.

  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–218

    Article  Google Scholar 

  6. Fragouli C., Wesel R.D. (2001). Turbo-encoder design for symbol-interleaved parallel concatenated trellis coded modulation. IEEE Transactions on Communications 49: 425–435

    Article  MATH  Google Scholar 

  7. Wu Y., Ogiwara H. (2004). Symbol-interleaver design for Turbo Trellis-Coded Modulation. IEEE Communications Letters 8l: 632–634

    Article  Google Scholar 

  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.

  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–812

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aristotle University of Thessaloniki, Thessaloniki, Greece

    Kostas V. Koutsouvelis & Christos E. Dimakis

Authors
  1. Kostas V. Koutsouvelis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos E. Dimakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kostas V. Koutsouvelis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koutsouvelis, K.V., Dimakis, C.E. A Low Complexity Algorithm for Generating Turbo Code s-Random Interleavers. Wireless Pers Commun 46, 365–370 (2008). https://doi.org/10.1007/s11277-007-9439-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-007-9439-0

Keywords

Search

Navigation