Comparison of Bit Error Rate and Interleaver in Coding Scheme

Abstract

The powerful channel coding schemes, namely, those based on turbo codes with different type of interleaver design and iterative scheme of decoding. The Shannon’s predictions to optimal codes would imply random like codes and intuitively implying that the decoding operation on these codes would be prohibitively complex in nature. A brief comparison of Turbo codes with different type interleaver will be given in this section, both in term of actual performance and complexity of codes. In order to give to different comparison of the codes, we use codes of the different input word length when comparing. The rate of both codes is R = 1/2 and 1/3. However, the Berrou’s coding scheme could be constructed by combining two or more than two simple codes. These codes could then be decoded separately in coding scheme, while exchanging the probabilistic, uncertainty and information about the quality of the decoding of each bit to other bits. This implied that all the complex codes had now become practical. This discovery triggered to a series of new, focused research programmers, and prominent researchers devoted their time to this new area of research. Leading on the work from Turbo codes design, the University of Cambridge revisited some 35-year-old work [5], who had constructed a different class of codes with different interleaver design. Building on the increased understanding of iterative decoding scheme and probability propagation on graphs that led on the work from Turbo codes, As a review, this paper will consider both these classes of codes, and compare the bit error rate performance and the interleaver of these codes.