Issue No. 07 - July (1979 vol. 28)
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.
Winograd's algorithm, Discrete Fourier transform (DFT), fast Fourier transform (FFT)
I. Reed and T. Truong, "A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform," in IEEE Transactions on Computers, vol. 28, no. , pp. 487-492, 1979.