This paper presents a theoretical analysis of the BER (Bit Error Rate) of turbo code and explains an optimal encoder design method by applying this analysis. The ensemble bound on the BER of the optimum code is derived with the use of a so-called unif...
This paper presents a theoretical analysis of the BER (Bit Error Rate) of turbo code and explains an optimal encoder design method by applying this analysis. The ensemble bound on the BER of the optimum code is derived with the use of a so-called uniform interleaver assumption. The ensemble bound is the average BER over all possible interleavers. In order to verify the analysis results, we consider two encoders, RSC (Recursive Systematic Convolutional) (7,5) encoder and RSC (5,7) encoder with two memories. For these cases, we presents the analytic bounds, and simulation results with the practical interleavers.