A very low complexity block turbo decoder for product codes

This paper presents a low complexity block turbo decoder for product codes. This new decoder, which has been derived from the near-optimum block turbo decoder is a very good compromise between complexity and performance. For performance evaluation, we have considered the [BCH(64,57,4)]/sup 2/ product code transmitted over a Gaussian channel using a QPSK modulation. The complexity of the new block turbo decoder is about ten times less than that of the near-optimum block turbo decoder for a coding gain degradation of only 0.7 dB.

[1]  Ramesh Pyndiah,et al.  Performance of turbo-decoded product codes used in multilevel coding , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[2]  Sudhakar M. Reddy,et al.  Random error and burst correction by iterated codes , 1972, IEEE Trans. Inf. Theory.

[3]  Sudhakar M. Reddy.  On decoding iterated codes , 1970, IEEE Trans. Inf. Theory.

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

[5]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[6]  Ramesh Pyndiah,et al.  Near optimum decoding of product codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[7]  Ramesh Pyndiah,et al.  Performance of block turbo coded 16-QAM and 64-QAM modulations , 1995, Proceedings of GLOBECOM '95.