Low Complexity Soft Decision Decoding Algorithms for Reed-Solomon Codes

Branka VUCETIC  Vishakan PONAMPALAM  Jelena VUKOVI  

IEICE TRANSACTIONS on Communications   Vol.E84-B   No.3   pp.392-399
Publication Date: 2001/03/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Innovative Mobile Communication Technologies at the Dawn of the 21st Century)
Reed-Solomon code,  soft decision decoding,  

Full Text: PDF>>
Buy this Article

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.