Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding
Francisco Argüello · Electronics Letters · 2005
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.