Complexity Analysis of The GAO Algorithm

In this paper, we investigate the complexity of the Gao algorithm for decoding Reed-Solomon (RS) codes. We study both direct and fast implementations of the Gao algorithm and compare their complexities to those of traditional syndrome-based decoding algorithms. Our results show that, regardless of the implementation, the Gao algorithm has higher complexity than syndrome-based decoding algorithms for high rate RS codes that are used in practice.

[1]  L. L. Joiner,et al.  Adaptive Reed-Solomon decoding using Gao's algorithm , 2002, MILCOM 2002. Proceedings.

[2]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

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

[4]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[5]  Sergei V. Fedorenko.  Correction to "A Simple Algorithm for Decoding Reed-Solomon Codes and Its Relation to the Welch-Berlekamp Algorithm" , 2006, IEEE Trans. Inf. Theory.

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

[7]  Elena Costa,et al.  On computing the syndrome polynomial in Reed-Solomon decoder , 2004, Eur. Trans. Telecommun..

[8]  Joachim von zur Gathen,et al.  Arithmetic and factorization of polynomials over F_2 , 1996, ISSAC 1996.

[9]  David M. Mandelbaum.  On decoding of Reed-Solomon codes , 1971, IEEE Trans. Inf. Theory.

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

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

[12]  Michael B. Monagan,et al.  Fast rational function reconstruction , 2006, ISSAC '06.

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

[14]  Berk Sunar,et al.  Mastrovito Multiplier for All Trinomials , 1999, IEEE Trans. Computers.