This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform
July 1979 (vol. 28 no. 7)
pp. 487-492
I.S. Reed, Department of Electrical Engineering, University of Southern California
In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplisbed by performing the cyclic convolution, required by Winograd's method, with the Mersenne prime number-theoretic transform developed originally by Rader. This new algorithm requires fewer multiplications than either the standard fast Fourier transform (FFT) or Winograd's more conventional algorithm. However, more additions are required.
Index Terms:
Winograd's algorithm, Discrete Fourier transform (DFT), fast Fourier transform (FFT)
Citation:
I.S. Reed, T.K. Truong, "A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform," IEEE Transactions on Computers, vol. 28, no. 7, pp. 487-492, July 1979, doi:10.1109/TC.1979.1675393
Usage of this product signifies your acceptance of the Terms of Use.