Performance Analysis Of Turbo Code

In 1993, a new class of error-correcting code named Turbo codes was proposed by C.Berrou in France, whose performances are close to the Shannon limit when the data block length is long enough. So turbo code is regarded as the milestone in channel encoding theory history, which makes us covert to decrease the numbers of light weight code (error coefficient) from increasing the minimum Hanming weigh.Turbo codes are parallel-concatenated recursive systematic convolutional codes. Their encoders consist of two constituent RSC sub-encoders linked by an interleaver. The decoding is an iterative algorithm by two concatenated component decoders.A systematic analysis of Turbo codes, especially the coding, interleaving and performance technique of Turbo codes have been given in this paper.The thesis investigates some aspects of Turbo code with emphasis on the improvement of the decoding algorithm and the design of the interleaver. The main results are below:1. The development of channel coding theory and technique is outlined, and the fundamental principle, development and application of Turbo codes are also discussed briefly.2. The theory of the interleaver is discussed, and brings forward the design principle of it and the method of optimized design for the interleaver of Turbo codes based on S-Random algorithm.3. Comparing with the various interleaver by simulation.4. Bringing forward a linear algorithm based on LOG-MAP by the systematic analysis of those decoding algorithm of Turbo Codes, and predigestion of LOG-MAP algorithm.5. Comparing with the effect of these design parameters for the decoding performance by computer simulation.