| Name: | Power-of-two FFTs |
| ID: | m12059 |
| Language: | English (en) |
| Summary: | FFTs of length equal to a power of two are by far the most commonly used. Radix-2 decimation-in-time and decimation-in-frequency algorithms are the simplest power-of-two algorithms. Radix-4 and higher-radix algorithms require somewhat fewer complex multiplications but the same number of complex additions. The split-radix algorithm requires fewer complex multiplies than other power-of-two algorithms. |
| Subject: | Science and Technology |
| Keywords: | FFT, radix-2 FFT, radix-4 FFT, split-radix FFT |
| 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), Kyle Clarkson (kclarks@gmail.com) |
|
|
|
| Version: | 1.2 (history) |
| Created: | May 14, 2004 5:21 pm GMT-5 |
| Revised: | Aug 31, 2006 9:32 am GMT-5 |
| Version: | 1.2 Aug 31, 2006 9:32 am GMT-5 by Douglas L. Jones |
| Changes: | Essentially rewrote it completely. Added lots of links. |
|
|
|
| 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. Power-of-two FFTs, Connexions Web site. http://cnx.org/content/m12059/1.2/, Aug 31, 2006.
Jones D. Power-of-two FFTs [Connexions Web site]. August 31, 2006. Available at: http://cnx.org/content/m12059/1.2/.
Jones, D. (2006, August 31). Power-of-two FFTs. Retrieved from the Connexions Web site: http://cnx.org/content/m12059/1.2/
Jones, Douglas. "Power-of-two FFTs." Connexions. August 31, 2006. http://cnx.org/content/m12059/1.2/.
Douglas Jones, "Power-of-two FFTs," Connexions, August 31, 2006, http://cnx.org/content/m12059/1.2/.
Jones, D. 2006. Power-of-two FFTs. Connexions, August 31, 2006. http://cnx.org/content/m12059/1.2/.
Jones, Douglas. Power-of-two FFTs. Connexions. 31 Aug. 2006 <http://cnx.org/content/m12059/1.2/>.