Efficient FFT Algorithm and Programming Tricks
| Rating: | Not rated yet |
| Rate item | |
| Type: | Course Related Materials |
| Grade Level: | Post-secondary |
Author: Douglas L. Jones
Subject: Science and Technology
Institution Name:
Connexions
Collection Name: Connexions
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.
Details
Course Type: Learning Module
Material Types: Readings, Syllabi
Media Formats: Text/HTML
Language: English
Additional Information
Geographic
Regional Relevance: All
