Interleaver design for turbo codes based on the performance of iterative decoding

The performance of a turbo code is dependent on two properties of the code: its distance spectrum and its suitability to be iteratively decoded. Both these properties are dependent on the specific interleaver used in the turbo-coding scheme. This paper describes a strategy for interleaver design that includes a criterion for the performance of iterative decoding. This criterion is based upon correlation properties of the extrinsic information, which is used as a priori inputs to the constituent decoders. Simulations comparing interleaver choices indicate an improved turbo code performance for interleavers designed with algorithms including a correlation criterion.

[1]  Fred Daneshgaran,et al.  Design of Interleavers for Turbo Codes Based on a Cost Function , 1997 .

[2]  P. Jung,et al.  Comprehensive comparison of turbo-code decoders , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[3]  Dariush Divsalar,et al.  Turbo code performance as a function of code block size , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[4]  Ove Edfors,et al.  A survey on trellis termination alternatives for turbo codes , 1999, 1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363).

[5]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[6]  Jakob Dahl Andersen,et al.  Interleaver Design for Turbo Coding , 1997 .

[7]  S. S. Pietrobon,et al.  Terminating the trellis of turbo-codes in the same state , 1995 .