Advertisement

The Modified Max-Log-MAP Turbo Decoding Algorithm by Extrinsic Information Scaling for Wireless Applications

  • Mustafa Taskaldiran
  • Richard C.S. Morling
  • Izzet Kale
Chapter
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 44)

Abstract

Turbo codes have found use in various wireless communication applications and have been incorporated into important standards like 3GPP and DVB. The iterative nature of turbo decoding algorithms increases their complexity compare to the conventional FEC decoding algorithms. A simple but effective technique to improve the performance of the Max-Log-MAP turbo decoding algorithm is to scale the extrinsic information exchanged between two MAP decoders. A comprehensive analysis of the selection of the scaling factors according to channel conditions and decoding iterations is presented in this chapter. Choosing a constant scaling factor for all SNRs and iterations is compared with the best scaling factor selection for changing channel conditions and decoding iterations. It is observed that a constant scaling factor for all channel conditions and decoding iterations is the best solution and provides a 0.2–0.4 dB gain over the standard Max-Log-MAP algorithm. Therefore, a constant scaling factor should be chosen for the best compromise.

Keywords

Turbo Code Extrinsic Information Iterative Decode Turbo Decode Recursive Systematic Convolutional 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    C.E. Shannon, A mathematical theory of communication. Bell System Technical Journal, 1948. 27: 379–423, 623–656.MATHMathSciNetGoogle Scholar
  2. 2.
    C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes. In Proc. ICC'93, 1993. 2: 1064–1070.Google Scholar
  3. 3.
    A. Burr, Turbo-codes: the ultimate error control codes? Electronics & Communication Engineering Journal, 2001. 13(4): 155–165.CrossRefMathSciNetGoogle Scholar
  4. 4.
    S. Benedetto and G. Montorsi, Unveiling turbo codes: some results on parallel concatenated coding schemes. IEEE Transactions on Information Theory, 1996. 42(2): 409–428.CrossRefMATHGoogle Scholar
  5. 5.
    European Telecommunication Standards Institute, Universal Mobile Telecommunications System (UMTS): Multiplexing and channel coding (TDD),3GPP TS 25.222 version 7.3.0 Release 7, p. 18–23, May 2005.Google Scholar
  6. 6.
    Third Generation Partnership Project 2, Physical Layer Standard for cdma2000 Spread Spectrum Systems, C.S0002-D, version 2.0, p. 2.97–2.105, Sept.,2005.Google Scholar
  7. 7.
    M.C. Valenti and J. Sun, Turbo Codes. Handbook of Rf and Wireless Technologies, ed. F. Dowla. 2004, London: NewNesPress. pp. 375–399.CrossRefGoogle Scholar
  8. 8.
    H.R. Sadjadpour, N.J.A. Sloane, and G. Nebe, Interleaver design for turbo codes. IEEE Journal On Selected Areas In Communications, 2001. 19(5): 831–837.CrossRefGoogle Scholar
  9. 9.
    B. Sklar, Digital Communications: Fundamentals and Applications. Second ed. Fundamentals of Turbo Codes. 2001, NJ: Prentice Hall.Google Scholar
  10. 10.
    C. Heegard and S.B. Wicker, Turbo Coding. 1 ed. 1999, Boston: Kluwer Academic Publisher.MATHGoogle Scholar
  11. 11.
    M.C. Valenti and J. Sun, The UMTS turbo code and an efficient decoder implementation suitable for software-defined radios. International Journal of Wireless Information Networks, 2001. 8(4): 203–214.CrossRefGoogle Scholar
  12. 12.
    J. Vogt and A. Finger, Improving the Max-Log-MAP turbo decoder. Electronics Letters, 2000. 23: 1937–1939.CrossRefGoogle Scholar
  13. 13.
    H. Claussen, H.R. Karimi, and B. Mulgrew, Improved max-log map turbo decoding using maximum mutual information combining. 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. 1: 424–428.CrossRefGoogle Scholar
  14. 14.
    L. Papke, P. Robertson, and E. Villebrun, Improved decoding with the SOVA in a parallel concatenated (Turbo-code) scheme. IEEE International Conference on Communications, 1996. 1: 102–106.Google Scholar
  15. 15.
    B. Vucetic et al., Recent advances in turbo code design and theory. Proceedings of the IEEE Custom Integrated Circuits Conference (CICC), 2007. 95(6): 1323–1344.Google Scholar
  16. 16.
    R.G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.Google Scholar
  17. 17.
    A. Abbasfar, D. Divsalar, and K. Yao, A class of turbo-like codes with efficient and practical high-speed decoders. IEEE Military Communications Conference, MILCOM 2004, 2004. 1: p. 245–250.Google Scholar
  18. 18.
    D. Divsalar, H. Jin, and R. McEliece, “Coding theorems for turbo-like codes,” in Proc. Allerton Conf., 1998. 201–210.Google Scholar
  19. 19.
    H. Jin, A. Khandekar, and R. McEliece, “Irregular repeat-accumulate codes,” in Proc. 2nd Int. Symp. Turbo Codes, 2000. 1–8.Google Scholar
  20. 20.
    A. Abbasfar, D. Divsalar, and K. Yao, Accumulate-Repeat-accumulate codes. IEEE Transactions on Communications, 2007. 55: 692–702.CrossRefGoogle Scholar
  21. 21.
    G. Masera et al., VLSI architectures for turbo codes. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1999. 7(3): 369–379.CrossRefGoogle Scholar
  22. 22.
    I. Ahmed and T. Arslan, A low energy VLSI design of random block interleaver for 3GPP turbo decoding. 2006 IEEE International Symposium on Circuits and Systems, 2006. ISCAS 2006. Proceedings, 2006. 4.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Mustafa Taskaldiran
    • 1
  • Richard C.S. Morling
    • 1
  • Izzet Kale
    • 1
  1. 1.Applied DSP and VLSI Research Group, Department of Electronic SystemsUniversity of WestminsterLondonUK

Personalised recommendations