Connexions

Sections
You are here: Home » Content » Efficient FFT Algorithm and Programming Tricks

About: Efficient FFT Algorithm and Programming Tricks

Module by: Douglas L. Jones

View content

Metadata

Name: Efficient FFT Algorithm and Programming Tricks
ID: m12021
Language: English (en)
Summary: Many tricks and techniques have been developed to speed up the computation of FFTs. Significant reductions in computation time result from table lookup of twiddle factors, compiler-friendly or assembly-language programming, special hardware, and FFT algorithms for real-valued data. Higher-radix algorithms, fast bit-reversal, and special butterflies yield more modest but worthwhile savings.
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)
Version: 1.6 (history)
Created: May 18, 2004 10:40 am GMT-5
Revised: Feb 24, 2007 12:15 pm US/Central

Version History

Version: 1.6 Feb 24, 2007 12:15 pm US/Central by Douglas L. Jones
Changes: 
Fixed a few typos.
Version: 1.5 Feb 24, 2007 12:00 pm US/Central 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 GMT-5 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 GMT-5 by Kyle Clarkson
Changes: 
Added cnxns and links
Version: 1.2 Jun 14, 2004 2:21 pm GMT-5 by Elizabeth Gregory
Changes: 
Corrected some MathML.
Version: 1.1 Jun 7, 2004 3:58 pm GMT-5 by Kyle Clarkson
Changes: 
First Submission

How to Reuse and Attribute This Content

If you reuse this work, in order to comply with the attribution requirements of the license (CC-BY 1.0), you must include the

  • authors' names
  • title of the work
  • and the Connexions URL where the work can be found

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.

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:

Jones, D. Efficient FFT Algorithm and Programming Tricks, Connexions Web site. http://cnx.org/content/m12021/1.6/, Feb 24, 2007.

American Medical Assocation (AMA) Manual of Style:

Jones D. Efficient FFT Algorithm and Programming Tricks [Connexions Web site]. February 24, 2007. Available at: http://cnx.org/content/m12021/1.6/.

American Psychological Assocation (APA) Publication Manual:

Jones, D. (2007, February 24). Efficient FFT Algorithm and Programming Tricks. Retrieved from the Connexions Web site: http://cnx.org/content/m12021/1.6/

Chicago Manual of Style (Bibliography):

Jones, Douglas. "Efficient FFT Algorithm and Programming Tricks." Connexions. February 24, 2007. http://cnx.org/content/m12021/1.6/.

Chicago Manual of Style (Note):

Douglas Jones, "Efficient FFT Algorithm and Programming Tricks," Connexions, February 24, 2007, http://cnx.org/content/m12021/1.6/.

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

Jones, D. 2007. Efficient FFT Algorithm and Programming Tricks. Connexions, February 24, 2007. http://cnx.org/content/m12021/1.6/.

Modern Languages Association (MLA) Style Manual:

Jones, Douglas. Efficient FFT Algorithm and Programming Tricks. Connexions. 24 Feb. 2007 <http://cnx.org/content/m12021/1.6/>.