On Computing the Discrete Fourier Transform
- 1 January 1978
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 32 (141), 175-199
- https://doi.org/10.2307/2006266
Abstract
A new algorithm for computing the Discrete Fourier Transform is described. The algorithm is based on a recent result in complexity theory which enables us to derive efficient algorithms for convolution. These algorithms are then used to obtain the new Discrete Fourier Transform algorithm.Keywords
This publication has 2 references indexed in Scilit:
- 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