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.

[1]  Claude Berrou,et al.  Designing good permutations for turbo codes: towards a single model , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[2]  Interleaving Distances Spectrum Comparison between Turbo-codes Interleavers , 2006, 2006 European Conference on Wireless Technology.

[3]  D. Divsalar,et al.  Multiple turbo codes for deep-space communications , 1995 .

[4]  Catherine Douillard,et al.  The Minimum Likelihood APP Based Early Stopping Criterion for Multi-Binary Turbo Codes , 2006 .

[5]  Oscar Y. Takeshita,et al.  On maximum contention-free interleavers and permutation polynomials over integer rings , 2005, IEEE Transactions on Information Theory.

[6]  Claude Berrou,et al.  Turbo codes with rate-m/(m+1) constituent convolutional codes , 2005, IEEE Transactions on Communications.

[7]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[8]  Jing Sun,et al.  Interleavers for turbo codes using permutation polynomials over integer rings , 2005, IEEE Transactions on Information Theory.

[9]  Oscar Y. Takeshita,et al.  Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective , 2006, IEEE Transactions on Information Theory.

[10]  Rolf Johannesson,et al.  Fundamentals of Convolutional Coding , 1999 .

[11]  Alexandru Isar,et al.  Double-binary RSC convolutional codes selection based on convergence of iterative turbo-decoding process , 2011, ISSCS 2011 - International Symposium on Signals, Circuits and Systems.

[12]  G. David Forney,et al.  Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.