This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Semi-Fast Fourier Transforms over GF(2m).
March 1978 (vol. 27 no. 3)
pp. 283-285
D.V. Sarwate, Coordinated Science Laboratory and the Department of Electrical Engineerig, University of Illinois
An algorithm which computes the Fourier transform of a sequence of length n over GF(2m) using approximately 2nm multiplications and n2+ nm additions is developed. The number of multiplications is thus considerably smaller than the n2multiplications required for a direct evaluation, though the number of additions is slightly larger. Unlike the fast Fourier transform
Index Terms:
Fourier transforms, Analysis of algorithms, computational complexity, error-correcting codes, finite fields
Citation:
D.V. Sarwate, "Semi-Fast Fourier Transforms over GF(2m).," IEEE Transactions on Computers, vol. 27, no. 3, pp. 283-285, March 1978, doi:10.1109/TC.1978.1675088
Usage of this product signifies your acceptance of the Terms of Use.