Home → Course Related Materials → Efficient FFT Algorithm and Programming Tricks
 
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.

Efficient FFT Algorithm and Programming Tricks

View Resource
No Strings Attached
Author:
Subject:
Science and Technology
Institution Name:
Connexions
Collection:
Connexions
Grade Level:
Post-secondary
Abstract:

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.

Course Type:
Learning Module
Languages:
English
Material Type:
Readings, Syllabi
Media Format:
Text/HTML
Conditions of Use:
Creative Commons Attribution 1.0
Creative Commons Attribution 1.0

Comments

Add Comment

Send link to this page

The e-mail address to send this link to.
A comment about this link.
Save
Log in or Register
▼

Rate and Review

Evaluate Resource What is this?

Common Core Standards

Align Resource
Not Yet Aligned

    Add new alignment tag:

    Share

    Tags

    Keywords, descriptive words, interested groups & more