Novel Interpolation and Polynomial Selection for Low-Complexity Chase Soft-Decision Reed-Solomon Decoding

Algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes can achieve substantial coding gain with polynomial complexity. Particularly, the low-complexity Chase (LCC) ASD decoding has better performance-complexity tradeoff. In the LCC decoding, 2η test vectors need to be interpolated over, and a polynomial selection scheme needs to be employed to select one interpolation output to send to the rest decoding steps. The interpolation and polynomial selection can account for a significant part of the LCC decoder area, especially in the case of long RS codes and large η . In this paper, simplifications are first proposed for a low-complexity polynomial selection scheme. Then a novel interpolation scheme is developed by making use of the simplified polynomial selection. Instead of interpolating over each vector, our scheme first generates information necessary for the polynomial selection. Then only the selected vectors are interpolated over. The proposed interpolation and polynomial selection schemes can lead to 162% higher efficiency in terms of throughput-over-area ratio for an example LCC decoder with η = 8 for a (458, 410) RS code over GF(210).

[1]  Zhongfeng Wang,et al.  Backward Interpolation Architecture for Algebraic Soft-Decision Reed–Solomon Decoding , 2009, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[2]  Xinmiao Zhang,et al.  A novel polynomial selection scheme for low-complexity chase algebraic soft-decision reed-solomon decoding , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

[3]  Xinmiao Zhang,et al.  Factorization-free Low-complexity Chase soft-decision decoding of Reed-Solomon codes , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[4]  Xinmiao Zhang,et al.  High-speed re-encoder design for algebraic soft-decision Reed-Solomon decoding , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[5]  Xinmiao Zhang,et al.  Algebraic Soft-Decision Decoder Architectures for Long Reed–Solomon Codes , 2010, IEEE Transactions on Circuits and Systems II: Express Briefs.

[6]  Yu Zheng,et al.  Efficient codeword recovery architecture for low-complexity Chase Reed-Solomon decoding , 2011, 2011 Information Theory and Applications Workshop.

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

[8]  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.

[9]  Zhongfeng Wang,et al.  High-Speed Interpolation Architecture for Soft-Decision Decoding of Reed–Solomon Codes , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[10]  Wei Zhang,et al.  Modified Low-Complexity Chase Soft-Decision Decoder of Reed–Solomon Codes , 2012, J. Signal Process. Syst..

[11]  Xinmiao Zhang,et al.  Reduced-complexity multi-interpolator algebraic soft-decision Reed-Solomon decoder , 2010, 2010 IEEE Workshop On Signal Processing Systems.

[12]  Aleksandar Kavcic,et al.  Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part I: An Algebraic Soft-In Hard-Out Chase Decoder , 2010, IEEE Transactions on Information Theory.