Soft-Decision Decoding of Reed-Solomon Codes Using Successive Error-and-Erasure Decoding

We propose a soft-decision decoding algorithm of Reed-Solomon (RS) codes using successive error-and-erasure decoding. Extensive simulations are conducted to show the possible performance gain of the proposed method. We derive a formula for performance estimation based on ordered statistics of symbol reliability, which matches well with the results of the simulation. The proposed method with almost the same average complexity as a conventional hard-decision decoder outperforms Koetter-Vardy (KV) algorithm and Chase2-GMD algorithm (CGA).

[1]  Shu Lin,et al.  On combining Chase-2 and GMD decoding algorithms for nonbinary block codes , 2001, IEEE Communications Letters.

[2]  B. V. K. Vijaya Kumar,et al.  Error Event Analysis of Partial Response Targets for Perpendicular Magnetic Recording , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[3]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[4]  Shu Lin,et al.  Error performance analysis for reliability-based decoding algorithms , 2002, IEEE Trans. Inf. Theory.

[5]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[6]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[7]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[8]  Alexander Vardy,et al.  Generalized minimum distance decoding in Euclidean space: Performance analysis , 1997, IEEE Trans. Inf. Theory.

[9]  G. David Forney,et al.  Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.