Estimating the minimum distance of turbo-codes using double and triple impulse methods

A long-standing problem for turbo-codes has been the efficient and accurate determination of the distance spectrum, or even just the minimum distance, for specific interleavers. This letter compares a number of distance estimation techniques and introduces two new approaches based on iterative processing. The new approaches are more reliable and are particularly useful for long blocks with high minimum distances. Distance measurement results are presented for random, high-spread random (HSR) and dithered relative prime (DRP) interleavers.

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

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

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

[4]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

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

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

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

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

[10]  Evangelos Eleftheriou,et al.  On the computation of the minimum distance of low-density parity-check codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

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

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