DocumentCode
989755
Title
Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding
Author
Argüello, F.
Author_Institution
Dept. of Electron. & Comput. Sci., Univ. of Santiago, Santiago de Compostela, Spain
Volume
41
Issue
13
fYear
2005
fDate
6/23/2005 12:00:00 AM
Firstpage
754
Lastpage
755
Abstract
The binary GCD algorithm, discovered by Stein, is an alternative to the Euclidean algorithm for computing the greatest common divisor of two integers. In this work, the binary GCD algorithm is applied to Reed-Solomon decoding and a novel iterative algorithm for computing error locator polynomials is proposed. Compared to Euclidean-based algorithms, this algorithm exhibits some speed and area advantages.
Keywords
Reed-Solomon codes; error correction codes; iterative decoding; polynomials; Euclidean algorithm; Reed-Solomon decoding; binary GCD algorithm; error locator polynomials; greatest common divisor; iterative algorithm;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:20050769
Filename
1459884
Link To Document