Skip to main content
Log in

Turbo codes with modified welch-costas interleavers

Turbocodes avec des entrelaceurs welch-costas modifiés

  • Published:
Annales Des Télécommunications Aims and scope Submit manuscript

Abstract

An upper bound for the minimum distance of turbo codes with Welch-Costas interleavers is established. This paper also proposes a modified Welch-Costas interleaver for which the obtained minimum distance is larger than the established upper bound. At the cost of a slight increase of memory compared to the classic Welch-Costas interleaver, the minimum distance obtained by the proposed method is comparable to that corresponding to the S-random interleaver.

Résumé

Une limite supérieure pour la distance minimale des turbocodes avec des entrelaceurs de Welch-Costas est établie. Cet article propose aussi un entrelaceur Welch-Costas modifié pour lequel la distance minimale obtenue est plus grande que la limite supérieure établie. Au coût d’une légère augmentation de mémoire par rapport à Ventrelaceur classique Welch-Costas, la distance minimale obtenue par la méthode proposée est comparable à celle correspondant à Ventrelaceur S-aléatoire.

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

Access this article

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., Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes, Proc. Oficc, Geneva, Switzerland, pp. 1064–1070, May 1993.

    Google Scholar 

  2. Breiling M., A Logarithmic Upper Bound on the Minimum Distance of Turbo Codes, IEEE Trans. On Inf. Theory, 50, no 8, pp. 1692–1710, 2004.

    MathSciNet  Google Scholar 

  3. Perotti A., Benedetto S., A New Upper Bound on the Minimum Distance of Turbo Codes, IEEE Trans. On Inf. Theory, 50, no 12, pp. 2985–2997, 2004.

    MathSciNet  Google Scholar 

  4. Heegard C, Wicker S. B., Turbo Coding, Kluwer Academic Publishers, Dordrecht, the Netherlands, 1999.

    Google Scholar 

  5. Dolinar S., Divsalar D., Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations, JPL TDA Progress Report, pp. 42–122, 1995.

    Google Scholar 

  6. Divsalar D., Pollara F., Turbo Codes for pes Applications, Proc. of IEEE Conf ofComm., Washington, 1, pp. 54–59, June 1995.

    Google Scholar 

  7. Popovici C, Teoria numerelor, Editura Didáctica si Pedagógica, Bucuresti, Romania, 1973.

    Google Scholar 

  8. Garello R., Pierleoni P., Bipenedetto S., Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleaves: Algorithms and Applications, IEEE J. on Selected Areas in Comm., 19, no 5, pp. 800–812, 2001.

    Google Scholar 

  9. Trifina L., Munteanu V., Tarniceriu D., Welch Costas interleaver with cyclic shifts on groups of elements, IEE Electronics Letters, 42, no 24, pp. 1413–1415, nov.2006.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trifina, L., Munteanu, V. & Tarniceriu, D. Turbo codes with modified welch-costas interleavers. Ann. Telecommun. 62, 1045–1052 (2007). https://doi.org/10.1007/BF03253305

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03253305

Key words

Mots clés

Navigation