My Tags For This Item

To save your tags,
please sign in
Not a member yet?
Register now

My Review For This Item

To save your reviews,
please sign in
Not a member yet?
Register now

My Notes For This Item

To save your notes,
please sign in
Not a member yet?
Register now

My Saved Searches

To save your searches,
please sign in.
Not a member yet?
Register now.

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

Tags For This Item

Tags are a way to find OER by keywords added by users
This item wasn't tagged yet.

Keywords

Keywords are descriptions assigned by the provider or the OER Commons Team.