FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes

Recently, a new polynomial basis over binary extension fields was proposed, such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order O(n lg(n)), where n is the number of points evaluated in FFT. In this paper, we reformulate this FFT algorithm, such that it can be easier understood and be extended to develop frequencydomain decoding algorithms for (n = 2m, k) systematic Reed-Solomon (RS) codes over F2m, m ∈ Z+, with n- k a power of two. First, the basis of syndrome polynomials is reformulated in the decoding procedure so that the new transforms can be applied to the decoding procedure. A fast extended Euclidean algorithm is developed to determine the error locator polynomial. The computational complexity of the proposed decoding algorithm is O(n lg(n-k)+(n-k) lg2(n-k)), improving upon the best currently available decoding complexity O(n lg2(n) lglg(n)), and reaching the best known complexity bound that was established by Justesen in 1976. However, Justesen's approach is only for the codes over some specific fields, which can apply Cooley-Tukey FFTs. As revealed by the computer simulations, the proposed decoding algorithm is 50 times faster than the conventional one for the (216, 215) RS code over F216.

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

[2]  Yunghsiang Sam Han,et al.  A Unified Form of Exact-MSR Codes via Product-Matrix Frameworks , 2015, IEEE Transactions on Information Theory.

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

[4]  Erich Kaltofen,et al.  On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

[5]  Ning Chen,et al.  Complexity Analysis of Reed-Solomon Decoding over GF(2m) without Using Syndromes , 2008, EURASIP J. Wirel. Commun. Netw..

[6]  T. C. Cheng,et al.  Fast Transform for Decoding Both Errors and Erasures of Reed – Solomon Codes Over GF ( 2 m ) for 8 m 10 , 2006 .

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

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

[9]  F. Moore,et al.  Polynomial Codes Over Certain Finite Fields , 2017 .

[10]  Joachim von zur Gathen,et al.  Modern Computer Algebra (3. ed.) , 2003 .

[11]  Trieu-Kien Truong,et al.  Fast transform for decoding both errors and erasures of Reed-Solomon codes over GF(2/sup m/) for 8/spl les/m/spl les/10 , 2006, IEEE Transactions on Communications.

[12]  Cheng Huang,et al.  Erasure Coding in Windows Azure Storage , 2012, USENIX Annual Technical Conference.

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

[14]  Victor Y. Pan,et al.  Faster solution of the key equation for decoding BCH error-correcting codes , 1997, STOC '97.

[15]  J. Wolf.  Adding two information symbols to certain nonbinary BCH codes and some applications , 1969 .

[16]  O. Ore.  On a special class of polynomials , 1933 .

[17]  Arnold Schönhage,et al.  Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2 , 1977, Acta Informatica.

[18]  M. Sarfraz,et al.  KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS , 2003 .

[19]  Gerhard Merz.  Fast Fourier Transform Algorithms with Applications , 1983 .

[20]  David G. Gantor.  On arithmetical algorithms over finite fields , 1989 .

[21]  Shuhong Gao,et al.  Additive Fast Fourier Transforms Over Finite Fields , 2010, IEEE Transactions on Information Theory.

[22]  Yunghsiang Sam Han,et al.  Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[23]  Jørn Justesen,et al.  On the complexity of decoding Reed-Solomon codes (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[24]  D. N. Kim,et al.  Fast Fourier Transform - Algorithms and Applications , 2010 .

[25]  David G. Cantor,et al.  On arithmetical algorithms over finite fields , 1989, Journal of combinatorial theory. Series A.

[26]  Nihar B. Shah,et al.  Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.