| Name: | The FFT Algorithm |
| ID: | m10964 |
| Language: | English (en) |
| Summary: | The FFT, an efficient way to compute the DFT, is introduced and derived throughout this module. |
| Subject: | Science and Technology |
| Keywords: | CTFT, DFT, DTFT, fast fourier transform, FFT, frequency domain |
| Document Type: | -//CNX//DTD CNXML 0.5 plus MathML//EN |
| License: | Creative Commons Attribution License (CC-BY 1.0) |
|
|
|
| Authors: | Robert Nowak (nowak@engr.wisc.edu) |
| Copyright Holders: | Robert Nowak (nowak@engr.wisc.edu) |
| Maintainers: | Liqun Wang (liqun@rice.edu), Robert Nowak (nowak@engr.wisc.edu) |
|
|
|
| Version: | 2.6 (history) |
| Created: | Dec 12, 2002 12:00 am US/Central |
| Revised: | Jul 22, 2005 2:30 pm GMT-5 |
| Version: | 2.6 Jul 22, 2005 2:30 pm GMT-5 by Charlet Reedstrom |
| Changes: | update to cnxml-0.5, fix typos, update apply mo markup |
|
|
|
| Version: | 2.5 Mar 11, 2003 12:00 am US/Central by Michael Haag |
| Changes: | Changed abstract, reformatted the first section, and examined comments. |
|
|
|
| Version: | 2.4 Feb 28, 2003 12:00 am US/Central by Charlet Reedstrom |
| Changes: | edited - emphasis to term, removed extraneous apply leq and marked up lots of inline math and variables as math |
|
|
|
| Version: | 2.3 Dec 20, 2002 12:00 am US/Central by (Unknown) |
| Changes: | checking spelling. Liqun |
|
|
|
| Version: | 2.2 Dec 18, 2002 12:00 am US/Central by (Unknown) |
| Changes: | resubmit the module. Figure not finished yet. Liqun |
|
|
|
| Version: | 2.1 Dec 18, 2002 12:00 am US/Central by (Unknown) |
| Changes: | Finish this module. Figure not included. Liqun |
|
|
|
| Version: | 2.0 Dec 12, 2002 12:00 am US/Central by (Unknown) |
| Changes: | Try to get the ID Liqun |
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:
Nowak, R. The FFT Algorithm, Connexions Web site. http://cnx.org/content/m10964/2.6/, Jul 22, 2005.
Nowak R. The FFT Algorithm [Connexions Web site]. July 22, 2005. Available at: http://cnx.org/content/m10964/2.6/.
Nowak, R. (2005, July 22). The FFT Algorithm. Retrieved from the Connexions Web site: http://cnx.org/content/m10964/2.6/
Nowak, Robert. "The FFT Algorithm." Connexions. July 22, 2005. http://cnx.org/content/m10964/2.6/.
Robert Nowak, "The FFT Algorithm," Connexions, July 22, 2005, http://cnx.org/content/m10964/2.6/.
Nowak, R. 2005. The FFT Algorithm. Connexions, July 22, 2005. http://cnx.org/content/m10964/2.6/.
Nowak, Robert. The FFT Algorithm. Connexions. 22 July 2005 <http://cnx.org/content/m10964/2.6/>.