Modified polynomial selection architecture for low-complexity chase decoding of Reed-Solomon codes
Hao Wang, Wei Zhang, Boyang Pan · 2012
Reed-Solomon (RS) codes are widely used in modern communication and computer systems. Compared with the hard-decision decoding algorithms, the algebraic soft-decision decoding (ASD) algorithm can achieve significant coding gain. Among ASD algorithms, the low-complexity Chase (LCC) decoding has a better performance and lower complexity. In the LCC decoding, 2ηtest vectors need to be interpolated and a polynomial selection scheme is required to choose the right interpolation output. A modified polynomial selection (MPS) algorithm is proposed in this paper. By deleting the reliability information, the MPS requires less hardware and provides the same performance as its present counterpart. For a (63, 55) RS code over GF (26), the MPS can save 20% chip area and 21.2% power consumption.