On the multiplicative complexity of the Discrete Fourier Transform
- 1 May 1979
- journal article
- Published by Elsevier in Advances in Mathematics
- Vol. 32 (2) , 83-117
- https://doi.org/10.1016/0001-8708(79)90037-9
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On computing the discrete Fourier transformMathematics of Computation, 1978
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970
- 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
- The Interaction Algorithm and Practical Fourier AnalysisJournal of the Royal Statistical Society Series B: Statistical Methodology, 1958