论文信息 - An introduction to programming the Winograd Fourier transform algorithm (WFTA)

An introduction to programming the Winograd Fourier transform algorithm (WFTA)

Recently, Dr. Shmuel Winograd discovered a new approach to the computation of the discrete Fourier transform (DFT). Relative to fast Fourier transform (FFT), the Winograd Fourier transform algorithm (WFTA) significantly reduces the number of multiplication operations; it does not increase the number of addition operations in many cases. This paper introduces the new algorithm and discusses the operations comparison problem. A guide for programming is included, as are some preliminary running times.

Harvey F. Silverman | H. Silverman

[1] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[2] C. Rader. Discrete Fourier transforms when the number of data samples is prime , 1968 .

[3] Harvey F. Silverman,et al. A method for programming the complex general-N Winograd Fourier transform algorithm , 1977 .

[4] Richard C. Singleton,et al. Algorithm 339: an algol procedure for the fast Fourier transform with arbitrary factors , 1968, Commun. ACM.

[5] G. D. Bergland,et al. A fast Fourier transform algorithm using base 8 iterations , 1968 .

[6] Harvey F. Silverman,et al. A parametrically controlled spectral analysis system for speech , 1974 .

[7] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .