Iterative application of the Chase algorithm on Reed-Solomon product codes

This work proposes a new iterative application of the Chase algorithm on Reed-Solomon (RS) product codes. Reliability information of bit positions is calculated only once. Although the bit error rates (BER) achieved are not as good as the results obtained with the recent turbo product decoding (TPD) algorithm, decoding complexity is far less. Simulation results are presented for a communications system using binary phase shift keying (BPSK) on an additive white Gaussian noise (AWGN) channel for both hard and soft decoding iterations and their performances are compared with turbo product decoding.

[1]  S. Wicker.  Error Control Systems for Digital Communication and Storage , 1994 .

[2]  Ramesh Pyndiah,et al.  Performance of Reed-Solomon block turbo code , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

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

[4]  Steven W. McLaughlin,et al.  Turbo product codes for partial response channels , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[5]  R. Blahut.  Theory and practice of error control codes , 1983 .

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

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