Estimating the minimum distance of large-block turbo codes using iterative multiple-impulse methods

A difficult problem for turbo codes is the efficient and accurate determination of the distance spectrum, or even just the minimum distance, for specific interleavers. This is especially true for large blocks, with many thousands of data bits, if the distance is high. This paper compares a number of recent distance estimation techniques and introduces a new approach, based on using specific event impulse patterns and iterative processing, that is specifically tailored to handle long interleavers with high spread. The new method is as reliable as two previous iterative multiple-impulse methods, but with much lower complexity. A minimum distance of 60 has been estimated for a rate 1/3, 8-state, turbo code with a dithered relative prime (DRP) interleaver of length K = 65 536. Copyright © 2007 John Wiley & Sons, Ltd.

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

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

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

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

[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]  D. Divsalar,et al.  Turbo codes for deep-space communications , 1995 .

[7]  Paul Guinand,et al.  Estimating the minimum distance of turbo-codes using double and triple impulse methods , 2005, IEEE Communications Letters.

[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]  Daniel J. Costello,et al.  A distance spectrum interpretation of turbo codes , 1996, IEEE Trans. Inf. Theory.

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

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

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