Abstract
A modified Euclidean decoding algorithm to solve the Berlekamp’s key equation of Reed–Solomon code for correcting errors, is presented in this paper. It is derived to solve the error locator and evaluator polynomials simultaneously without performing the operations of polynomial division and field element inversion. In this algorithm, the number of iterations used to solve the equation is fixed, and also the weights used to reduce the degree of the error evaluator polynomial at each iteration can be extracted from the coefficient of fixed degree. Therefore, this proposed algorithm saves many controlling circuits, and provides module architecture with regularity. As a result it is simple and easy to implement, and in addition it can be easily configured for various applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
