Low Complexity Soft Decision Decoding Algorithms for Reed-Solomon Codes
Branka S. Vucetic, V. Ponampalam, Jelena Vučković · IEICE Transactions on Communications · 2001
We propose a method to represent non-binary error patterns for Reed-Solomon codes using a trellis. All error patterns are sorted according to their Euclidean distances from the received vector. The decoder searches through the trellis until it finds a codeword. This results in a soft-decision maximum likelihood algorithm with lower complexity compared to other known MLD methods. The proposed MLD algorithm is subsequently modified to further simplify complexity, reflecting in a slight reduction in the error performance. key words: Reed-Solomon code, soft decision decoding