DocumentCode
3410560
Title
A new fast Reed-Solomon decoding algorithm without Chien search
Author
Chi, Danny T.
Author_Institution
Kodak Berkeley Res., Berkeley, CA, USA
Volume
3
fYear
1993
fDate
11-14 Oct 1993
Firstpage
948
Abstract
This paper presents a novel Reed-Solomon (RS) decoding algorithm based on finite fields with an infinite element. The Chien Search procedure included in all existing general RS decoding algorithms can be totally eliminated in this new method. Hence it can reduce the decode time significantly. Comparisons with other RS decoding methods and hardware structure of this new algorithm are also discussed
Keywords
Galois fields; Reed-Solomon codes; coding errors; computational complexity; decoding; heuristic programming; military communication; parallel algorithms; polynomials; decode time; fast Reed-Solomon decoding algorithm; finite fields; hardware structure; infinite element; Circuits; Decoding; Equations; Error correction codes; Galois fields; Hardware; Polynomials; Power generation; Reed-Solomon codes; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Military Communications Conference, 1993. MILCOM '93. Conference record. Communications on the Move., IEEE
Conference_Location
Boston, MA
Print_ISBN
0-7803-0953-7
Type
conf
DOI
10.1109/MILCOM.1993.408681
Filename
408681
Link To Document