Reliability-Based Forward Recursive Algorithms for Algebraic Soft-Decision Decoding of Reed--Solomon Codes

We propose efficient forward recursive algorithms for algebraic soft-decision list decoding of Reed-Solomon codes, which utilize channel reliability information, and outperform the Koetter-Vardy (KV) algorithm with lower decoding latency. We evaluate the performance of the proposed decoding algorithms on additive white Gaussian noise and partial response channels. Simulation results show that we can achieve better performance on a modified extended-extended partial response class 4 channel than on the best possible performance of the KV algorithm, as given by the asymptotic bound for high-rate codes.

[1]  Frank R. Kschischang,et al.  Simulation Results for Algebraic Soft-Decision Decoding of Reed-Solomon Codes , 2002 .

[2]  Krishna R. Narayanan,et al.  Iterative soft decision decoding of Reed Solomon codes based on adaptive parity check matrices , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[3]  Frank R. Kschischang,et al.  A VLSI architecture for interpolation in soft-decision list decoding of Reed-Solomon codes , 2002, IEEE Workshop on Signal Processing Systems.

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

[5]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, 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]  J. R. Cruz,et al.  Application of soft-decision Reed-Solomon decoding to magnetic recording channels , 2004, IEEE Transactions on Magnetics.

[8]  Shu Lin,et al.  An efficient hybrid decoding algorithm for Reed-Solomon codes based on bit reliability , 2003, IEEE Trans. Commun..

[9]  Naresh R. Shanbhag,et al.  Reduced complexity interpolation for soft-decoding of reed-solomon codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[10]  Aleksandar Kavcic,et al.  A Low-Complexity Method for Chase-Type Decoding of Reed-Solomon Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[11]  Haitao Xia,et al.  Reduced-complexity implementation of algebraic soft-decision decoding of Reed-Solomon codes , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[12]  Haitao Xia,et al.  Retry mode soft Reed-Solomon decoding , 2002 .

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

[14]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[15]  Elwyn R. Berlekamp,et al.  Bounded distance+1 soft-decision Reed-Solomon decoding , 1996, IEEE Trans. Inf. Theory.

[16]  R. Blahut Theory and practice of error control codes , 1983 .

[17]  Tom Høholdt,et al.  Decoding Reed-Solomon Codes Beyond Half the Minimum Distance , 2000 .

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

[19]  Seiichi Mita,et al.  Turbo-EEPRML: An EEPR4 channel with an error-correcting post-processor designed for 16/17 rate quasi-MTR code , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[20]  R. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[21]  Cheng Zhong,et al.  A Chase-type algorithm for soft-decision Reed-Solomon decoding on Rayleigh fading channels , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[22]  Paul H. Siegel,et al.  Iterative soft-decision Reed-Solomon decoding on partial response channels , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[23]  Haitao Xia,et al.  Soft-decision decoding of Reed-Solomon codes on magnetic recording channels with erasures , 2003, IEEE International Conference on Communications, 2003. ICC '03..