| Name: | Choosing the Best FFT Algorithm |
| ID: | m12060 |
| Language: | English (en) |
| Summary: | Power-of-two-length FFTs are usually best for general use when the DFT length is somewhat at the user's discretion. The best power-of-two algorithm may depend on the type of computer to be used. When FFTs must be of a specific length, a prime-factor algorithm when applicable or otherwise a common-factor algorithm usually provide fastest performance, while the chirp z-transform is a single, universal method for computing an FFT of any length. |
| Subject: | Science and Technology |
| Keywords: | chirp z-transform, FFT, prime factor algorithm, winograd fourier transform algorithm |
| Document Type: | -//CNX//DTD CNXML 0.5 plus MathML//EN |
| License: | Creative Commons Attribution License (CC-BY 1.0) |
|
|
|
| Authors: | Douglas L. Jones (dl-jones@uiuc.edu) |
| Copyright Holders: | Douglas L. Jones (dl-jones@uiuc.edu) |
| Maintainers: | Douglas L. Jones (dl-jones@uiuc.edu), Harika Basana (ilsai@rice.edu), Kyle Clarkson (kclarks@gmail.com) |
|
|
|
| Version: | 1.3 (history) |
| Created: | May 19, 2004 9:56 am GMT-5 |
| Revised: | Feb 6, 2007 8:02 am US/Central |
| Version: | 1.3 Feb 6, 2007 8:02 am US/Central by Douglas L. Jones |
| Changes: | Fixed typo |
|
|
|
| Version: | 1.2 Aug 26, 2006 2:13 pm GMT-5 by Douglas L. Jones |
| Changes: | EXTENSIVE edits and additions. Added links to other modules and external sources. Added a reference. |
|
|
|
| Version: | 1.1 Jun 25, 2004 10:18 am GMT-5 by Kyle Clarkson |
| Changes: | First Submission |
If you reuse this work, in order to comply with the attribution requirements of the license (CC-BY 1.0), you must include the
If you derive a copy of this content using a Connexions account and publish your version, proper attribution of the original work will be automatically done for you.
The following citation styles comply with the attribution requirements for the license (CC-BY 1.0) of this work:
Jones, D. Choosing the Best FFT Algorithm, Connexions Web site. http://cnx.org/content/m12060/1.3/, Feb 6, 2007.
Jones D. Choosing the Best FFT Algorithm [Connexions Web site]. February 6, 2007. Available at: http://cnx.org/content/m12060/1.3/.
Jones, D. (2007, February 6). Choosing the Best FFT Algorithm. Retrieved from the Connexions Web site: http://cnx.org/content/m12060/1.3/
Jones, Douglas. "Choosing the Best FFT Algorithm." Connexions. February 6, 2007. http://cnx.org/content/m12060/1.3/.
Douglas Jones, "Choosing the Best FFT Algorithm," Connexions, February 6, 2007, http://cnx.org/content/m12060/1.3/.
Jones, D. 2007. Choosing the Best FFT Algorithm. Connexions, February 6, 2007. http://cnx.org/content/m12060/1.3/.
Jones, Douglas. Choosing the Best FFT Algorithm. Connexions. 6 Feb. 2007 <http://cnx.org/content/m12060/1.3/>.