VLSI architecture design of modified Euclidean algorithm for Reed-Solomon code

In this paper, a novel-decoding algorithm based on Euclidean method is developed correct errors for RS codes. This new decoding algorithm can solve the Berlekamp´s key equation to find the error locator and evaluator polynomials simultaneously without performing the computation of polynomial division and finite field element inversion. Moreover, the number of iterations is fixed, which equals the minimum distance minus one. Also, it saves many extra controlling circuits. Therefore this novel-decoding algorithm is regular, efficient, simple and easy to implement.