View the content:
Efficient FFT Algorithm and Programming Tricks
| Name: | Efficient FFT Algorithm and Programming Tricks |
| ID: | m12021 |
| Language: | English (en) |
| Summary: | |
| Subject: | Science and Technology |
| Keywords: | assembly language, bit reverse, compiler, DFT, FFT, real FFT, table lookup |
| 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) |
|
|
|
| Latest version: | 1.6 (history) |
| First publication date: | May 18, 2004 10:40 am -0500 |
| Last revision to module: | Feb 24, 2007 12:15 pm -0600 |
| PDF: | m12021_1.6.pdf | PDF file, for viewing content offline and printing. Learn more. |
| EPUB: | m12021_1.6.epub | Electronic publication file, for viewing in handheld devices. Learn more. |
| XML: | m12021_1.6.cnxml | XML that defines the structure and contents of the module, minus any included media files. Can be reimported in the editing interface. Learn more. |
| Source Export ZIP: | m12021_1.6.zip | ZIP containing the module XML plus any included media files. Can be reimported in the editing interface. Learn more. |
| Version: | 1.6 Feb 24, 2007 12:15 pm -0600 by Douglas L. Jones |
| Changes: | Fixed a few typos. |
|
|
|
| Version: | 1.5 Feb 24, 2007 12:00 pm -0600 by Douglas L. Jones |
| Changes: | Fixed typos in 3/5 equations; thanks to David Obenauf for pointing them out! |
|
|
|
| Version: | 1.4 Sep 22, 2006 10:31 pm -0500 by Douglas L. Jones |
| Changes: | Added several new sections and greatly expanded material. Added links to other modules in text. |
|
|
|
| Version: | 1.3 Jun 18, 2004 5:31 pm -0500 by Kyle Clarkson |
| Changes: | Added cnxns and links |
|
|
|
| Version: | 1.2 Jun 14, 2004 2:21 pm -0500 by Elizabeth Gregory |
| Changes: | Corrected some MathML. |
|
|
|
| Version: | 1.1 Jun 7, 2004 3:58 pm -0500 by Kyle Clarkson |
| Changes: | First Submission |
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.
If you reuse this work elsewhere, in order to comply with the attribution requirements of the license (CC-BY 1.0), you must include
See the citation section below for examples you can copy.
The following citation styles comply with the attribution requirements for the license (CC-BY 1.0) of this work:
Jones, D. Efficient FFT Algorithm and Programming Tricks, Connexions Web site. http://cnx.org/content/m12021/1.6/, Feb 24, 2007.
Jones D. Efficient FFT Algorithm and Programming Tricks [Connexions Web site]. February 24, 2007. Available at: http://cnx.org/content/m12021/1.6/.
Jones, D. (2007, February 24). Efficient FFT Algorithm and Programming Tricks. Retrieved from the Connexions Web site: http://cnx.org/content/m12021/1.6/
Jones, Douglas. "Efficient FFT Algorithm and Programming Tricks." Connexions. February 24, 2007. http://cnx.org/content/m12021/1.6/.
Douglas Jones, "Efficient FFT Algorithm and Programming Tricks," Connexions, February 24, 2007, http://cnx.org/content/m12021/1.6/.
Jones, D. 2007. Efficient FFT Algorithm and Programming Tricks. Connexions, February 24, 2007. http://cnx.org/content/m12021/1.6/.
Jones, Douglas. Efficient FFT Algorithm and Programming Tricks. Connexions. 24 Feb. 2007 <http://cnx.org/content/m12021/1.6/>.