Novel pipelined interpolator for low-complexity chase soft-decision Reed-Solomon decoder

Reed-Solomon (RS) codes are widely used in digital communication and storage systems. Compared with other ASD algorithms for RS codes, the low-complexity chase (LCC) decoding algorithm needs less computation complexity with similar or better coding gain. Forward interpolation (FI) costs more iterations and become the bottleneck of the LCC decoding. In this paper, a novel pipelined interpolator (NPI) architecture is proposed to accelerate FI. For the (255,239) RS code with η = 5, the interpolation latency and the efficiency will be 44% and 1.76 times of the previous design, respectively.

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

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

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