Note a note on prime factor FFT algorithms
- 1 October 1983
- journal article
- research article
- Published by Elsevier in Journal of Computational Physics
- Vol. 52 (1) , 198-204
- https://doi.org/10.1016/0021-9991(83)90024-4
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Self-sorting mixed-radix fast Fourier transformsJournal of Computational Physics, 1983
- A prescription of winograd's discrete Fourier transform algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- Fast computation of discrete Fourier transforms using polynomial transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- On computing the discrete Fourier transformMathematics of Computation, 1978
- A prime factor FFT algorithm using high-speed 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
- An algorithm for computing the mixed radix fast Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- A Fast Fourier Transform Algorithm Using Base 8 IterationsMathematics of Computation, 1968
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- The Interaction Algorithm and Practical Fourier AnalysisJournal of the Royal Statistical Society Series B: Statistical Methodology, 1958