Adaptive erasure decoder for Reed-Solomon code and its performance in Rayleigh fading channel

A new reduced complexity decoding algorithm, called adaptive successive erasure correction (ASEC), is considered. It is applied to non-binary Reed Solomon code coupled with general MPSK modulation. The performance of the corresponding system is analyzed under assumption that the transmitted signals suffer from additive white gaussian noise (AWGN) and slow flat Rayleigh fading. The examined algorithm is compared with the General Minimum Distance (GMD) and with the Successive Erasure Minimum Distance (SEMD) decoding algorithms. It has reduced complexity while the loss of performance does not exceed 1 dB in SNR. The relative advantage of the proposed algorithm becomes more significant with increasing of the code symbol size.