论文信息 - A Prime Factor FFT Algorithm Using - 字舞流文

A Prime Factor FFT Algorithm Using

High-speed Convolution | High-speed Convolution

[1] C. Burrus. Index mappings for multidimensional formulation of the DFT and convolution , 1977 .

[2] Harvey F. Silverman,et al. An introduction to programming the Winograd Fourier transform algorithm (WFTA) , 1977 .

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

[4] R. Singleton. An algorithm for computing the mixed radix fast Fourier transform , 1969 .

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

[6] Irving John Good,et al. The Interaction Algorithm and Practical Fourier Analysis , 1958 .

[7] C. K. Yuen,et al. Theory and application of digital signal processing , 1975 .