Adapted iterative decoding of product codes

This paper deals with iterative decoding of product codes for high spectral efficiency transmissions. A solution is proposed to adapt the decoding algorithm to the characteristics of the encoder, the modulation and the number of decoding steps. A coding gain of up to 2 dB is then obtained for short codes. For long codes, the number of decoding steps to achieve a specified bit error rate (BER) can be reduced by 1 or 2, which is interesting in terms of decoding latency and power consumption.

[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]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

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

[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]  P. A. Wintz,et al.  Error Free Coding , 1973 .

[6]  Peter Elias,et al.  Error-free Coding , 1954, Trans. IRE Prof. Group Inf. Theory.

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