Efficient distance measurement method for turbo codes that use structured interleavers

This letter presents an efficient and accurate distance measurement method for tail-biting turbo codes that use structured interleavers. This method takes advantage of the structure in the interleaver as well as the circular property of tail-biting. As such, it significantly reduces the computational complexity, which allows the accurate determination of high minimum distance (dmin) in reasonable time. The efficiency of this method is demonstrated by its ability to determine the true dmin of 51 and the corresponding true multiplicities for a rate-1/3 turbo code that uses the UMTS 8-state polynomial generators and an MPEG-sized interleaver (1504 information bits) in reasonable time

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

[3]  Andres I. Vila Casado,et al.  The all-zero iterative decoding algorithm for turbo code minimum distance computation , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[4]  Pedro Velez-Belchi.  Interaction channel for satellite distribution systems , 2000 .

[5]  Øyvind Ytrehus,et al.  Improved algorithms for the determination of turbo-code weight distributions , 2005, IEEE Transactions on Communications.

[6]  Claude Berrou,et al.  Computing the minimum distance of linear codes by the error impulse method , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[7]  Peter Kabal,et al.  Comparison of Distance Measurement Methods for Turbo Codes , 2005 .

[8]  Peter Kabal,et al.  Distance measurement method for double binary turbo codes and a new interleaver design for DVB-RCS , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[9]  Claude Berrou,et al.  Multiple parallel concatenation of circular recursive systematic convolutional (Crsc) codes , 1999, Ann. des Télécommunications.

[10]  Roberto Garello,et al.  Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications , 2001, IEEE J. Sel. Areas Commun..

[11]  S. Crozier.  Construction and Performance of New Tail-Biting Turbo Codes , 1998 .

[12]  C. Berrou,et al.  Computing the minimum distances of linear codes by the error impulse method , 2002, Proceedings IEEE International Symposium on Information Theory,.

[13]  E. Rosnes,et al.  Improved algorithms for high rate turbo code weight distribution calculation , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

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