ARP and QPP interleaves selection based on the convergence of iterative decoding process for the construction of 16-state Duo Binary Turbo Codes

This paper presents the results obtained in a second algorithmic step of the design of Duo Binary Turbo Codes (DBTCs). The design as a whole is based on an exhaustive search on the code-interleaver pairs having as selection criterion the convergence of the iterative decoding process. The first step of this search establishes a hierarchy of the recursive systematic duo-binary convolutional (RSDBC) codes with memory 2, 3, 4 and 5. The second step consists in searching the interlevears set individually for each of the best codes found previously. In this paper the obtained results for the 16-state DBTCs are presented. The permutations considered in this paper correspond at two of the most efficient types of interleavers: Almost Regular Permutations (ARP) and Quadratic Polynomial Permutations (QPP). The Bit and the Frame Error Rate (BER/FER) performances obtained in this paper with the best code-interleaver pairs are superior to those already reported in literature.