How Fast is the Fourier Transform?

Persi Diaconis
Additional contact information
Persi Diaconis: Stanford University

A chapter in Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface, 1981, pp 43-44 from Springer

Abstract: Abstract The average running time for several FFT algorithms is analyzed. The Cooley-Tukey algorithm is shown to require about n1.61 operations. The chirp algorithm always works in 0(n log n) operations. Examples are given to show that padding by zeros to the nearest power of 2 can lead to real distortions.

Keywords: Fast Fourier transform; analysis of algorithms; probabilistic number theory (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-9464-8_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461394648

DOI: 10.1007/978-1-4613-9464-8_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().