Study on intra-symbol interleaving for Multi-Non-Binary Turbo Codes

Multi-Non-Binary Turbo Codes (MNBTC), i.e. the latest generation of turbo codes, operate with arrays of symbols, each symbol consisting of several bits. The interleaving for these multi-binary arrays of symbols required in turbo coding involves two steps: an inter-symbol interleaving and an intra-symbol interleaving. Inter-symbol interleaving mixes the data arrays columns. This can be achieved by using already existing dedicated interleavers. The novelty is intra-symbol interleaving, mixing symbols or even bits in each column of the data array. This paper investigates several possible intra-symbol interleaving methods in terms of their bit/frame error rate versus signal to noise ratio (BER/FERvsSNR) performances. The study allows some practical conclusions.

[1]  Wolfgang Koch,et al.  Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference (applicable to digital mobile radio receivers) , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[2]  Catherine Douillard,et al.  Multi-non-binary turbo codes , 2013, EURASIP Journal on Wireless Communications and Networking.

[3]  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).

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

[5]  Dariush Divsalar,et al.  Turbo codes for PCS applications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[6]  Claude Berrou,et al.  The advantages of non-binary turbo codes , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[7]  Paul Guinand,et al.  High-performance low-memory interleaver banks for turbo-codes , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[8]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

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

[10]  Fabrizio Pollara,et al.  Stopping Rules for Turbo Decoders , 2000 .

[11]  H. Balta,et al.  Study on inter- and intra-symbol interleaving succession in multi-binary turbo codes , 2012, 2012 10th International Symposium on Electronics and Telecommunications.

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

[13]  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.

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