Iterative application of the Chase algorithm on Reed-Solomon product codes
Cenk Argon, Stephen McLaughlin, T. Souvignier · 2002
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.