Design of Cascaded Hybrid Interleaver for Fast Turbo Coding and Decoding

Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 5)

Abstract

Turbo code in an attempt to realize a technique that approaches the theoretic limit utilizes a crucial component, interleaver, which converts burst errors caused by impulsive noise to simple errors. But the processing of data through the interleaver incurs time as well as memory. Both time and memory complexities are directly related to the total number of information bits. The time required for interleaver processing is so high because of which some applications omits the complete interleavers. But the consequent schemes suffer from high bit error rate. In this chapter a novel hybrid two stage interleaving scheme was proposed which reduces the time required for interleaving processing while maintaining the BER criteria up to the levels obtained with block or 3GPP interleavers.

Keywords

Interleaver Turbo code Block interleaver 3GPP interleaver 

References

  1. 1.
    Benedetto. S., Bieglieri. E.,: Principles of digital transmission with wireless applications. Kluwer academic/Plenum publishers, (1999)Google Scholar
  2. 2.
    Shannon. C.E,: A mathematical theory of communication. Bell System Technical Journal, vol. 27, pp. 379–423(1948)Google Scholar
  3. 3.
    Forney. G.D,: Concatenated codes. MIT Press (1966)Google Scholar
  4. 4.
    Seghers. J,: On the free distance of turbo codes and related product codes. Swiss Federal Institute of Technology, Zurich, Switzerland, Diploma project 6613, vol. 42, (1995)Google Scholar
  5. 5.
    Dolinar. S, Divsalar. D,: Weight distributions for turbo codes using random and nonrandom permutations. TDA Progress Report, vol.15, pp. 56–65, (1995)Google Scholar
  6. 6.
    Sun. J, Takeshita. O.Y,: Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Transactions on Information Theory, no. 1, pp. 101–119, (2005)Google Scholar
  7. 7.
    Atousa H. S. Mohammadi, Weihua Zhuang,:Variance of the Turbo Code Performance Bound Over the Interleavers. IEEE Transactions on Information Theory, Vol. 48, (2002)Google Scholar
  8. 8.
    Prabhavati D. Bahirgonde, Shantanu K. Dixit,: BER Analysis of Turbo Code Interleaver. International Journal of Computer Applications (0975–8887) Volume 126 – No.14, (2015)Google Scholar
  9. 9.
    Maan A. Kousa,: Performance of Turbo codes with Matrix Interleavers. The Arabian Journal for Science and Engineering, Volume 28, Number 2B, (2003)Google Scholar
  10. 10.
    Ching-Lung Chi,: Quadratic Permutation Polynomial Interleavers for LTE Turbo Coding. International Journal of Future Computer and Communication, Vol. 2, No. 4, (2013).Google Scholar
  11. 11.
    Arya Mazumdar, Chaturvedi. A.K, Adrish Banerjee,: Construction of Turbo Code Interleavers from 3-regular Hamiltonian Graphs. IEEE Communications Letters, Vol. 10, No. 4, (2006)Google Scholar
  12. 12.
    Jing Sun, Takeshita. O.Y,: Interleavers for Turbo Codes Using PermutationPolynomials Over Integer Rings. IEEE Transactions On Information Theory, Vol. 51, No. 1, (2005)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  • M. Rajani Devi
    • 1
  • K. Ramanjaneyulu
    • 2
  • B. T. Krishna
    • 3
  1. 1.JNTU KakinadaKakinadaIndia
  2. 2.PVP Siddhartha Institute of TechnologyVijayawadaIndia
  3. 3.JNTUVizianagaramIndia

Personalised recommendations