Performance of convolutional interleavers with different spacing parameters in turbo codes

This paper considers application of a convolutional interleaver and the issue of influence of the space parameter in the turbo code performance. Similarly to previously considered convolutional interleavers, the new interleavers are designed as block interleavers and their performance in different code structures is compared with the interleaver having higher periods and space value of 1. In each comparison, the number of inserted stuff bits at the end of each data block is considered to be of similar order. Finally, suitable modification to the new interleavers is proposed improving performance for the codes with lower number of stuff bits

[1]  Asrar U. H. Sheikh,et al.  Interleaver design for short turbo codes , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[2]  Daniel J. Costello,et al.  A distance spectrum interpretation of turbo codes , 1996, IEEE Trans. Inf. Theory.

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

[4]  T. Wysocki,et al.  Modified convolutional interleavers and their performance in turbo codes , 2004, SympoTIC '04. Joint 1st Workshop on Mobile Future & Symposium on Trends In Communications (IEEE Cat. No.04EX877).

[5]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[6]  Tadeusz A. Wysocki,et al.  Computation of the free distance and low weight distribution of turbo codes with convolutional interleavers , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[7]  Jr. G. Forney,et al.  Burst-Correcting Codes for the Classic Bursty Channel , 1971 .