Prunable Collision Free Random Interleaver Design

In this article we introduce a new collision free prunable random interleaver. The suggested interleaver is a joint structure involving rectangular and S-random interleaver. It comprises a general model for all kind of collision free prunable random interleavers. In addition, it can be designed for any number of parallel processors and any length of information sequence vector and can be considered also as a template for collision free prunable interleavers. The proposed interleaver can be used with all kind of turbo-like codes. The performance of the proposed interleaver is measured with parallel decodable serially concatenated convolutional codes (PDSCCCs) and compared to the PDSCCCs’ performance with collision full S-random interleaver.

[1]  Brian K. Classon,et al.  ARP and QPP Interleavers for LTE Turbo Coding , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[2]  Kwyro Lee,et al.  Design of dividable interleaver for parallel decoding in turbo codes , 2002 .

[3]  Matthew Valenti,et al.  Turbo Codes , 2007 .

[4]  Branka Vucetic,et al.  Turbo Codes: Principles and Applications , 2000 .

[5]  Sandro Bellini,et al.  Prunable S-random interleavers , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[6]  E. Dunscombe,et al.  Optimal interleaving scheme for convolutional coding , 1989 .

[7]  S. Benedetto,et al.  Design of fast-prunable S-random interleavers , 2005, IEEE Transactions on Wireless Communications.

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

[9]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[10]  Sergio Benedetto,et al.  Design of parallel concatenated convolutional codes , 1996, IEEE Trans. Commun..

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

[12]  Sergio Benedetto,et al.  Serial concatenation of block and convolutional codes , 1996 .

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

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

[15]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

[16]  Ali Özgür Yilmaz,et al.  On Parallelized Serially Concatenated Codes , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[17]  Paul Guinand,et al.  Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers , 2005, Ann. des Télécommunications.

[18]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.