# Optimality of the Fast Fourier transform

```@article{Papadimitriou1979OptimalityOT,
title={Optimality of the Fast Fourier transform},
journal={J. ACM},
year={1979},
volume={26},
pages={95-102}
}```
A graph-theoretic model for a class of linear algorithms computing the discrete Fourier transform of sequences of length a power of 2, the mformat~on flow network, is presented The information flow network correspondmg to the fast Fourier transform IS shown to be umquely optimal in tim class with respect to a naturally defined cost

## Figures from this paper

Super fast Fourier transform
• Computer Science
Electronic Imaging
• 2006
A new fast Fourier transform algorithm with linear multiplicative complexity is introduced that is comparable to the existing methods such as Duhamel, Heideman, Burrus, Vetterli, Wang.
Fast Algorithms for Dempster-Shafer Theory
• Computer Science
IPMU
• 1990
New algorithms with a polynomial runtime are presented and appear to be optimal in the class of the so-called M-algorithms.
Computational aspects of the Mobius transformation of graphs
• R. Kennes
• Computer Science
IEEE Trans. Syst. Man Cybern.
• 1992
It is proved that Mobius transformation algorithms are actually the best algorithms among a large class of algorithms, which have a polynomial routine, whereas the usual algorithms have an exponential routine.
New Fast Fourier Transform with Linear Multiplicative Complexity
• Computer Science, Mathematics
Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.
• 2005
A new fast Fourier transform algorithm with linear multiplicative complexity for real and complex input signals and reduces the total number of operations compared to the existing methods.
New Fast Hartley Transform with Linear Multiplicative Complexity
• Computer Science, Mathematics
2006 International Conference on Image Processing
• 2006
A new Hartley transform algorithm with linear multiplicative complexity that minimizes the number of multiplications and reduces the total number of operations compared to the existing and recently published methods.
The Complexity of Computing a Fourier Perturbation
• Computer Science
ArXiv
• 2016
The quasi-entropy method is generalized so as to show that driving e down does not allow such a free ride in case of the Walsh-Hadamard Fourier transform, and that the linear algebraic lower bound is, in fact, Ω((n logn)/ log e).
Computing Fourier Transforms and Convolutions on the 2-Sphere
• Computer Science, Mathematics
• 1994
Convolution theorems generalizing well known and useful results from the abelian case are used to develop a sampling theorem on the sphere, which reduces the calculation of Fourier transforms and convolutions of band-limited functions to discrete computations.
Computational Aspects of the Mobius Transform
• Computer Science
ArXiv
• 2013
The 'fast Mobius transformations' are the fastest algorithms for computing the Mobius transformation of (O) and are provided, via the commonality function, an algorithm for computing Dempster's rule of combination which is much faster than the usual one.
The Complexity of Computing (Almost) Unitary Matrices With \$\eps\$-Copies of the Fourier Transform
• Computer Science
• 2016
The paper explains why this research direction, if fruitful, has a chance of solving much bigger questions about the complexity of the Fourier transform, and sheds light on new interesting, and problems on the intersection of computational complexity and group theory.
The main result shows that a factor \$b\$ speedup implies existence of not just one but \$b-ill conditioned bottlenecks occurring at \$\Omega(n)\$ different steps, each causing information from independent (orthogonal) components of the input to either overflow or underflow.

## References

SHOWING 1-10 OF 13 REFERENCES
On computing the Discrete Fourier Transform.
• Computer Science
Proceedings of the National Academy of Sciences of the United States of America
• 1976
New algorithms for computing the Discrete Fourier Transform of n points are described, which use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions.
The Linear Complexity of Computation
An additive degree of freedom is defined, which turns out to be an exact measure of the complexity of computation of a family 7 of linear forms in r variables over a field.
Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
A lower bound for the number of additions necessary to compute a family of linear functions by a linear algorithm is given when an upper bound <italic>c</italic> can be assigned to the modulus of the
The Design and Analysis of Computer Algorithms
• Computer Science
• 1974
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
An algorithm for the machine calculation of complex Fourier series
• Computer Science
• 1965
Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Fast Convolution using fermat number transforms with applications to digital filtering
• Computer Science
• 1974
The structure of transforms having the convolution property is developed and an implementation on the IBM 370/155 is presented and compared with the fast Fourier transform (FFT) showing a substantial improvement in efficiency and accuracy.
AL What IS the fast Fourier transform~
• IEEE Trans Audio and Electroacoust A
Fast convolution using Fermat number transforms lEEE Trans Acoust
• Speech, Szgnal Processing, A SSP-22,
• 1974
The Design and Analysts of Computer Algorithms
• The Design and Analysts of Computer Algorithms
• 1974