A Survey of interleaving techniques in turbo codes

  • Authors

    • M. Rajani Devi
    • K. Ramanjaneyulu
    • , B. T. Krishna
    https://doi.org/10.14419/ijet.v7i4.21519

  • This paper focuses on the interleaving techniques used in Turbo codes in wireless communications. The performance of turbo codes is measured in terms of Bit Error Rate (BER) versus Signal to Noise Ratio (SNR) and the number of iterations. It tends to increase with better interleaving, better encoding and decoding algorithms. This paper presents the concepts of turbo coding, different interleaving methods and decoding techniques.

  • References

    1. [1] M. Viterbi, “Shannon theory, concatenated codes and turbo codingâ€, http://occs.donvblack.com/viterbi/index.htm, 1998.

      [2] Shannon CE. “Communication in the presence of Noiseâ€. Proceedings IRE, Jan 1949, reprinted Proceedings IEEE, Vol. 86, and no. 2 Feb 1998.

      [3] J. B. Cain, G. C. Clark, Jr., and J. M. Geist, “Punctured Convolutional Codes of Rate (n¡1)=n and Simplified Maximum Likelihood Decoding,†IEEE Transactions on Information Theory, vol. IT-25, pp. 97–100, Jan 1979. https://doi.org/10.1109/TIT.1979.1055999.

      [4] C. Berrou and A. Glavieux, “Near Optimum Error Correcting Coding and Decoding: Turbo-Codes,†IEEE Transactions on Communications, vol. 44, pp. 1261–1271, Oct. 1996. https://doi.org/10.1109/26.539767.

      [5] Oscar Y. Takeshita and Daniel J. Costello Jr,“New deterministic interleaver designs for turbo codesâ€, IEEE Transactions on Information Theory, Vol. 46, Issue 6, pages 1988–2006, Sept. 2000. https://doi.org/10.1109/18.868474.

      [6] Arya Mazumdar, A. K. Chaturvedi, and Adrish Banerjee, “Construction of turbo code interleavers from 3-regular Hamiltonian graphsâ€, arXiv:cs.IT/0512093 v1, December 2005.

      [7] Libero Dinoi and Sergio Benedetto, “Design of fast-prunable s-random interleaversâ€, IEEE Transactions on Wireless Communications, Vol. 4m No. 5, pages 2540–2548, September 2005.

      [8] D. Divsalar and F. Pollara, “On the design of turbo codesâ€, TDA Progress Report 42-123, November 1995.

      [9] Jonghoon Ryo and Oscar Y. Takeshita, “On quadratic inverses for quadratic permutation polynomials over integer ringsâ€, IEEE Transactions on Information Theory, Vol. 52, No. 3, pages 1254–1260, March 2006. https://doi.org/10.1109/TIT.2005.864442.

      [10] Stephane Y. Le Goff and Faisal Obaid Al-Ayyan, “On the design of bit-interleaved turbo-coded modulationâ€, IEEE Proceedings Information Theory Workshop, pages 73 – 75, September 2001.

      [11] EirikRosnes and OyvindYtrehus, “On the design of bit interleaved turbo-coded modulation with low error floorsâ€, IEEE Transactions on Communications, Vol. 54, No. 9, pages 1563–1573, September 2006. https://doi.org/10.1109/TCOMM.2006.881215.

      [12] Stephane Y. Le Goff and Faisal Obaid Al-Ayyan, “Design of bit interleaved turbo-coded modulationsâ€, IEEE Electronics Letters, Vol. 37, No. 16, pages 1030–1031, August 2001. https://doi.org/10.1049/el:20010702.

      [13] Adrish Banerjee, Francesca Vatta, BartoloScanavino, and Daniel J. Costello Jr., “Nonsystematic turbo codesâ€, IEEE Transactions on Communications. Vol. 53, No. 11, pages 1841–1849, November 2005. https://doi.org/10.1109/TCOMM.2005.858672.

  • Downloads

  • How to Cite

    Devi, M. R., Ramanjaneyulu, K., & Krishna, , B. T. (2018). A Survey of interleaving techniques in turbo codes. International Journal of Engineering & Technology, 7(4), 2949-2952. https://doi.org/10.14419/ijet.v7i4.21519