Connexions

Sections
You are here: Home » Content » The FFT Algorithm

About: The FFT Algorithm

Module by: Robert Nowak. E-mail the author

View the content: The FFT Algorithm

Metadata

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)
Latest version: 2.6 (history)
First publication date: Dec 12, 2002 12:00 am -0600
Last revision to module: Jul 22, 2005 2:30 pm -0500

Downloads

PDF: m10964_2.6.pdf PDF file, for viewing content offline and printing. Learn more.
XML: m10964_2.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.

Version History

Version: 2.6 Jul 22, 2005 2:30 pm -0500 by Charlet Reedstrom
Changes: 
update to cnxml-0.5, fix typos, update apply mo markup
Version: 2.5 Mar 11, 2003 12:00 am -0600 by Michael Haag
Changes: 
Changed abstract, reformatted the first section, and examined comments.
Version: 2.4 Feb 28, 2003 12:00 am -0600 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 -0600 by (Unknown)
Changes: 
checking spelling.
Liqun
Version: 2.2 Dec 18, 2002 12:00 am -0600 by (Unknown)
Changes: 
resubmit the module. Figure not finished yet.
Liqun
Version: 2.1 Dec 18, 2002 12:00 am -0600 by (Unknown)
Changes: 
Finish this module. Figure not included.
Liqun
Version: 2.0 Dec 12, 2002 12:00 am -0600 by (Unknown)
Changes: 
Try to get the ID
Liqun

How to Reuse and Attribute This Content

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

  • the authors' names: Robert Nowak
  • the title of the work: The FFT Algorithm
  • the Connexions URL where the work can be found: http://cnx.org/content/m10964/2.6/

See the citation section below for examples you can copy.

How to Cite and Attribute This Content

The following citation styles comply with the attribution requirements for the license (CC-BY 1.0) of this work:

American Chemical Society (ACS) Style Guide:

Nowak, R. The FFT Algorithm, Connexions Web site. http://cnx.org/content/m10964/2.6/, Jul 22, 2005.

American Medical Assocation (AMA) Manual of Style:

Nowak R. The FFT Algorithm [Connexions Web site]. July 22, 2005. Available at: http://cnx.org/content/m10964/2.6/.

American Psychological Assocation (APA) Publication Manual:

Nowak, R. (2005, July 22). The FFT Algorithm. Retrieved from the Connexions Web site: http://cnx.org/content/m10964/2.6/

Chicago Manual of Style (Bibliography):

Nowak, Robert. "The FFT Algorithm." Connexions. July 22, 2005. http://cnx.org/content/m10964/2.6/.

Chicago Manual of Style (Note):

Robert Nowak, "The FFT Algorithm," Connexions, July 22, 2005, http://cnx.org/content/m10964/2.6/.

Chicago Manual of Style (Reference, in Author-Date style):

Nowak, R. 2005. The FFT Algorithm. Connexions, July 22, 2005. http://cnx.org/content/m10964/2.6/.

Modern Languages Association (MLA) Style Manual:

Nowak, Robert. The FFT Algorithm. Connexions. 22 July 2005 <http://cnx.org/content/m10964/2.6/>.