By Topic

An efficient Euclidean algorithm for Reed-Solomon code to correct both errors and erasures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chang, Y.W. ; Dept. of Electr. Eng., I-Shou Univ., Kaohsiung, Taiwan ; Jeng, J.H. ; Truong, T.K.

In this paper, an efficient Euclidean decoding algorithm is presented to solve the Berlekamp's key equation of Reed-Solomon (RS) code for correcting erasures as well as errors by replacing the initial condition of the Euclidean algorithm with the erasure locator polynomial and the Forney syndrome polynomial. By this proposed algorithm, the errata locator polynomial and errata evaluator polynomial can be obtained simultaneously without the computations of polynomial division and field element inversion. Moreover, the whole recursive decoding produce for solving Berlekamp's key equation could be performed with a fixed number of iterations. And, the weights used to reduce the degree of the errata evaluator polynomial at each iteration can be extracted from the coefficient of fixed degree. As a consequence, the complexity of RS decoder to correct both errors and erasures is reduced substantially. Therefore, this proposed algorithm provides more modular, regular and simple for both software and hardware implementation. An example using this proposed algorithm is given for a (255,239) RS code for correcting erasures and errors with s + 2v ≤ 16.

Published in:

Communications, Computers and signal Processing, 2003. PACRIM. 2003 IEEE Pacific Rim Conference on  (Volume:2 )

Date of Conference:

28-30 Aug. 2003