Asymptotic performances of nonrepetitive and repetitive turbo codes

The analytically calculated asymptotic BER performance of turbo codes using a transfer function bound technique is presented. Good code structures for constraints lengths 3, 4, and 5 are listed. The repetitive turbo code is introduced with two types of decoding algorithms. Its asymptotic BER performance is presented. Good repetitive turbo codes are also listed. It is shown that the BER performance can be improved using the repetitive turbo code.