Abstract

Turbo code has been shown to have ability to achieve performance that is close to Shannon limit. It has been adopted by various commercial communication systems. Both universal mobile telecommunications system (UMTS) TDD and FDD have also employed turbo code as the error correction coding scheme. It outperforms convolutional code in large block size, but because of its time delay, it is often only used in the non-real-time service. In this paper, we discuss the encoder and decoder structure of turbo code in B3G mobile communication System. In addition, various decoding techniques, such as the Log-MAP, Max-log-MAP and SOVA algorithm for non-real-time service are deduced and compared. The performance results of decoder and algorithms in different configurations are also shown.

Highlights

  • A turbo code can be thought as a refinement of the concatenated encoding structure and an iterative algorithm for decoding the associated code sequence [1]

  • To best exploit the information learned from each decoder, the decoding algorithm must effect an exchange of soft rather than hard decisions [6]

  • In SOVA the difference is calculated between the ML and the most likely path that merges with ML path and gives different uk

Read more

Summary

Introduction

A turbo code can be thought as a refinement of the concatenated encoding structure and an iterative algorithm for decoding the associated code sequence [1]. The codes are constructed by applying two or more component codes to different interleaved versions of the same information sequence [2][3]. To best exploit the information learned from each decoder, the decoding algorithm must effect an exchange of soft rather than hard decisions [6]. For a system with two component codes, the concept behind turbo decoding is to pass soft decisions from the output of one decoder to the input of the other, and to iterate this process several times to produce better decisions [7]

Principle of Iterative Decoding
Log-MAP Algorithm
Comparison of the Decoding Algorithms
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.