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}
}
  • C. Papadimitriou
  • Published 1979
  • Computer Science
  • J. ACM
  • 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 
    37 Citations

    Figures and Topics from this paper

    Super fast Fourier transform
    • 2
    Fast Algorithms for Dempster-Shafer Theory
    • 41
    Computational aspects of the Mobius transformation of graphs
    • R. Kennes
    • Computer Science
    • IEEE Trans. Syst. Man Cybern.
    • 1992
    • 109
    New Fast Fourier Transform with Linear Multiplicative Complexity
    • S.S. Agaian, O. Caglayan
    • Mathematics
    • Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.
    • 2005
    • 1
    New Fast Hartley Transform with Linear Multiplicative Complexity
    • S. Agaian, O. Caglayan
    • Mathematics, Computer Science
    • 2006 International Conference on Image Processing
    • 2006
    • 2
    The Complexity of Computing a Fourier Perturbation
    • 2
    • PDF
    Computational Aspects of the Mobius Transform
    • 18
    • PDF
    Tighter Fourier Transform Complexity Tradeoffs
    • 2
    • PDF