Fast chase algorithms for decoding Reed-Solomon codes

This paper presented the modified Chase algorithms to improve the decoding time by reducing the number of candidate codewords. Generally speaking, the candidate codewords will increase with the error correction capability of the code. This fact leads to decoding complexity. The innovations of the proposed algorithm lie in the two-step reliability information selection. Simulation results showed the decoding time of the new scheme is significantly improved, while the error correction performance is almost the same as compared with the conventional Chase-2 algorithm.