Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
