DocumentCode
2621307
Title
Fast parallel algorithms for decoding Reed-Solomon codes
Author
Dabiri, Dariush ; Blake, Ian F.
Author_Institution
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
97
Abstract
New algorithms for decoding Reed-Solomon (RS) codes based on remainder polynomials are given. The algorithms solve the Welch-Berlekamp (1983) equations and have a parallel structure suitable for systolic implementation on a linear array of processors
Keywords
Reed-Solomon codes; decoding; parallel algorithms; polynomials; systolic arrays; Reed-Solomon codes; Welch-Berlekamp equations; decoding; fast parallel algorithms; linear processors array; remainder polynomials; systolic implementation; Computer architecture; Decoding; Equations; Parallel algorithms; Polynomials; Reed-Solomon codes; Systolic arrays;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394851
Filename
394851
Link To Document