A Fast Method for Decoding Reed-Solomon Codes on Processors

Author

Yan Haw Chen ; Ching Fu Huang ; Shao-I Chu ; Chih-Yuan Lien ; Chien-En Kao

Author_Institution

Dept. of Inf. Eng., I-Shou Univ., Kaohsiung, Taiwan

fYear

2014

fDate

27-29 Aug. 2014

Firstpage

293

Lastpage

296

Abstract

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.

Keywords

Reed-Solomon codes; codecs; decoding; polynomials; table lookup; DVD; HDTV; Horner´s rule; RAID 6; Reed-Solomon codes; VCD; computing syndrome; decoding technique; syndrome evaluation time; table lookup algorithm; Finte Field; Horner rule; Lookup Table; Reed-Solomon code; Syndrome;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP), 2014 Tenth International Conference on

Conference_Location

Kitakyushu

Print_ISBN

978-1-4799-5389-9

Type

conf

DOI

10.1109/IIH-MSP.2014.79

Filename

6998325