A fast Fourier transform compiler
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 34 (5) , 169-180
- https://doi.org/10.1145/301618.301661
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- How to declare an imperativeACM Computing Surveys, 1997
- Automatic generation of prime length FFT programsIEEE Transactions on Signal Processing, 1996
- Algorithms for parallel memory, II: Hierarchical multilevel memoriesAlgorithmica, 1994
- Algorithms for parallel memory, I: Two-level memoriesAlgorithmica, 1994
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- A prime factor FFT algorithm implementation using a program generation techniqueIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- The design of optimal DFT algorithms using dynamic programmingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- On computing the discrete Fourier transformMathematics of Computation, 1978
- Fourgen: A fast fourier transform program generatorComputer Physics Communications, 1976
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965