Optimality of the Fast Fourier transform
@article{Papadimitriou1979OptimalityOT, title={Optimality of the Fast Fourier transform}, author={C. Papadimitriou}, 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 and Topics from this paper
Figures
37 Citations
Computational aspects of the Mobius transformation of graphs
- Computer Science
- IEEE Trans. Syst. Man Cybern.
- 1992
- 109
New Fast Fourier Transform with Linear Multiplicative Complexity
- Mathematics
- Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.
- 2005
- 1
New Fast Hartley Transform with Linear Multiplicative Complexity
- Mathematics, Computer Science
- 2006 International Conference on Image Processing
- 2006
- 2