Performance analysis of sub-interleaver based turbo codes | Cluster Computing Skip to main content
Springer Nature Link
Log in

Performance analysis of sub-interleaver based turbo codes

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Most of the research works carried so far concentrated on decoders and interleavers. The performance of Turbo codes depends on different constituent components such as encoder, decoder and interleaver with metrics of bit error rate and complexity. In this paper a new interleaver structure using sub interleavers is proposed to provide a faster turbo codes for channel with less effect of noise. The major concern of this work is to find an optimum number of sub interleavers which satisfies certain limits of bit error rate and processing time. The simulation was performed using MATLAB and the results shows that the processing time has been reduced to about 10% than the conventional block interleaver.

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
¥17,985 /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 includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon limit error-correcting coding and decoding: turbo codes. In: Proceedings of IEEE ICC93, pp. 1064–1070. Geneva, Switzerland (1993)

  2. Singh, N., Kaur, G.: Performance analysis of serially concatenated convolutional codes using different generator polynomial and constraint length. Adv. R. Electr. Electron. Eng. 2(1), 73–76 (2014)

    Google Scholar 

  3. Bahl, L., Cocke, J., Jelinek, F., Raviv, J.: Optimal decoding of linear codes for minimizing symbol error rate (Corresp.). IEEE Trans. Inf. Theory 20(2), 284–287 (1974)

    Article  Google Scholar 

  4. Battail, Gerard: A Conceptual Framework for Understanding Turbo Codes. IEEE J. Sel. Areas Commun. 16(2), 245–254 (1998)

    Article  Google Scholar 

  5. Khandani, A.K.: Design of turbo-code interleaver using hungarian method. Electron. Lett. 34(1), 63–65 (1998)

    Article  Google Scholar 

  6. Dolinar, S., Divsalar, D.: Weight distribution for turbo codes using random and nonrandom permutations. TDA Progress Report 42–122, pp. 56–65 (1995)

  7. Benedetto, S., Montorsi, G.: Unveiling turbo-codes: some results on parallel concatenated coding schemes. IEEE Trans. Inf. Theory 42(2), 409–428 (1996)

    Article  Google Scholar 

  8. Sklar, B.: Digital communications: fundamentals and applications. Second ed. Fundamentals of Turbo Codes. 2001: Prentice Hall

  9. Heegard, C., Wicker, S.B.: Turbo Coding, 1st edn. Kluwer Academic Publisher, Boston (1999)

    Book  Google Scholar 

  10. Kumar, P.M., Sutha, S., KrishnaMourthy, V.: Mathematical implementation of MAX LOG MAP algorithm for low power applications in turbo decoders. Int. J. Adv. Res. Electr. Electron. Instr. Eng. 3(5), 1–13 (2014)

    Google Scholar 

  11. P. Deborah Roseline, G. Thavaseelan and R. Rani Hemamalini, “Design of Hybrid Log-MAP Algorithm for Turbo Decoding Using QPP Interleaver”, Middle-East Journal of Scientific Research 23 (Sensing, Signal Processing and Security), 2015

  12. Valenti, M.C., Sun, J.: The UMTS turbo code and an efficient decoder implementation suitable for software-defined radios. Int. J. Wireless Inf. Netw. 8(4), 203–214 (2001)

    Article  Google Scholar 

  13. Gross, W.J., Gulak, P.G.: Simplified MAP algorithm suitable for implementation of turbo decoders. IEEE Electron. Lett. 34, 1577–1578 (1998)

    Article  Google Scholar 

  14. Classon, B., Blankenship, K., Desai, V.: Turbo decoding with the constant log-MAP algorithm. In: Proceedings of Second International Symposium Turbo Codes and Related Applications, (Brest, France), pp. 467–470 (2000)

  15. Sun, J., Takeshita, O.Y.: Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Trans. Inf. Theory 51(1), 101–119 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. JNTU, Kakinada, Kakinada, India

    M. Rajani Devi & B. T. Krishna

  2. PVP Siddhartha Institute of Technology, Kanuru, India

    K. Ramanjaneyulu

Authors
  1. M. Rajani Devi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Ramanjaneyulu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. T. Krishna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Rajani Devi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Devi, M.R., Ramanjaneyulu, K. & Krishna, B.T. Performance analysis of sub-interleaver based turbo codes. Cluster Comput 22 (Suppl 6), 14091–14097 (2019). https://doi.org/10.1007/s10586-018-2237-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-018-2237-5

Keywords

Search

Navigation