A Fast Method for Decoding Reed-Solomon Codes on Processors

This paper presents an efficient table lookup algorithm for high-throughput decoding of the Reed-Solomon code. The main idea behind this decoding technique is based on the two-term polynomial evaluation. The number of multiplications for the values of the received polynomial is reduced by a factor of two. Moreover, the syndrome evaluation time for the (255, 223, t=16) Reed-Solomon code by using the proposed algorithm is improved by 81.62% as compared to the traditional Horner´s rule. Because of the high throughput characteristics, the presented method for computing syndrome in Reed-Solomon codes is readily adaptable for use in many applications such as CDs, VCDs, DVDs, HDTV, and RAID 6.