The iterative decoding algorithm research of Turbo Product Codes

This article has researched encoding and decoding algorithms of Turbo Product Codes focusing on analysis of Chase-Pyndiah algorithm-based soft in/soft out (SISO) iterative decoding algorithm. The algorithm simulation done under matlab7.0 environment shows that, on an AWGN channel using BPSK modulation, Turbo Product Codes do a similar decoding performance as Turbo codes with a simpler decoding method and faster convergence. After several iterations, the decoding performance of Turbo Product Codes, which can be regarded as a kind of excellent channel coding pattern, has been significantly improved. Finally, a further research on modified decoding algorithm, that is gradient decoding algorithm, has been done and the simulation result approves that it offers a very good compromise between complexity and performance.

[1]  Ramesh Pyndiah,et al.  A very low complexity block turbo decoder for product codes , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[2]  Ramesh Pyndiah,et al.  Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..

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

[4]  Li Hong-xin Study of Gradient Algorithm for Turbo Product Codes , 2008 .

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