Simplified procedure for decoding nonsystematic reed-solomon codes over gf(2m) using euclid's algorithm and the fast fourier transform

Gao's algorithm similar to Shiozaki's algorithm for decoding nonsystematic Reed-Solomon (RS) codes which is a subclass of the redundant residue polynomial codes is considered here. This algorithm computes the message polynomial directly without explicitly finding the error-locator polynomial and errorevaluator polynomial. In this letter, a simplified decoding algorithm to correct both errors and erasures is used in conjunction with Gao's algorithm for efficiently decoding RS codes. In addition, we show that the extended Gao algorithm similar to the Shiozaki-Truong-Cheung-Reed algorithm significantly reduces the decoding complexity.

[1]  Shuhong Gao,et al.  A New Algorithm for Decoding Reed-Solomon Codes , 2003 .

[2]  Akira Shiozaki.  Decoding of redundant residue polynomial codes using Euclid's algorithm , 1988, IEEE Trans. Inf. Theory.

[3]  C. Burrus,et al.  Fast Convolution using fermat number transforms with applications to digital filtering , 1974 .

[4]  Trieu-Kien Truong,et al.  The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[5]  E. Petajan,et al.  The US HDTV standard , 1995 .

[6]  Robert T. Moenck,et al.  Fast computation of GCDs , 1973, STOC.

[7]  Trieu-Kien Truong,et al.  Fast, prime factor, discrete Fourier transform algorithms over GF(2m) for 8 leq m leq 10 , 2006, Inf. Sci..

[8]  Peter Trifonov,et al.  A Method for Fast Computation of the Fourier Transform over a Finite Field , 2003, Probl. Inf. Transm..

[9]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[10]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[11]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[12]  S. Wang,et al.  IEEE standard 802.16: a technical overview of the WirelessMAN/sup TM/ air interface for broadband wireless access , 2002, IEEE Communications Magazine.

[13]  R. Blahut.  Theory and practice of error control codes , 1983 .

[14]  S. Wicker.  Error Control Systems for Digital Communication and Storage , 1994 .

[15]  Robert McEliece,et al.  The Theory of Information and Coding: Information theory , 2002 .

[16]  I. S. Hsu,et al.  Simplified procedure for correcting both errors and erasures of Reed-Solomon code using Euclidean algorithm , 1987 .

[17]  L. J. Wang,et al.  Fast, prime factor, discrete Fourier transform , 2004 .

[18]  Masao Kasahara,et al.  Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes , 1992, IEEE Trans. Inf. Theory.

[19]  Masao Kasahara,et al.  A Method for Solving Key Equation for Decoding Goppa Codes , 1975, Inf. Control..

[20]  Sergei V. Fedorenko.  A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm , 2005, IEEE Transactions on Information Theory.

[21]  Yao Wang,et al.  A fast algorithm for the Fourier transform over finite fields and its VLSI implementation , 1988, IEEE J. Sel. Areas Commun..

[22]  I. S. Reed,et al.  Fast transform decoding of nonsystematic Reed-Solomon codes , 1989 .