A prime factor FFT algorithm using high-speed convolution
- 1 August 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 25 (4), 281-294
- https://doi.org/10.1109/tassp.1977.1162973
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Index mappings for multidimensional formulation of the DFT and convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- An introduction to programming the Winograd Fourier transform algorithm (WFTA)IEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- On computing the Discrete Fourier TransformProceedings of the National Academy of Sciences, 1976
- An algorithm for computing the mixed radix fast Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- Discrete Fourier transforms when the number of data samples is primeProceedings of the IEEE, 1968
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965