Optimality of the Fast Fourier transform
- 1 January 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 26 (1), 95-102
- https://doi.org/10.1145/322108.322118
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- The Linear Complexity of ComputationJournal of the ACM, 1975
- Fast Convolution using fermat number transforms with applications to digital filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier TransformJournal of the ACM, 1973
- Schnelle Multiplikation großer ZahlenComputing, 1971
- What is the fast Fourier transform?IEEE Transactions on Audio and Electroacoustics, 1967
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965