Material Detail
Fast Fourier Transforms
This is a free, open textbook that is part of the Connexions collection at Rice University. "This book uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included, and computer programs are...
Show More
Quality
-
Editor Reviews
- User Rating
- Comments
- Learning Exercises
- Bookmark Collections
- Course ePortfolios
- Accessibility Info
More about this material
- Material Type:
- Open (Access) Textbook
- Date Added to MERLOT:
- April 1, 2010
- Date Modified in MERLOT:
- April 1, 2010
- Author:
- C. Sidney Burrus, Rice University
- Submitter:
-
Cathy Swift
- Primary Audience:
- College Lower Division, College Upper Division
- Technical Format:
- Website
- Mobile Compatibility:
- Not specified at this time
- Language:
- English
- Cost Involved:
- No
- Source Code Available:
- Unknown
- Accessibility Information Available:
- Unknown
- Creative Commons:
-
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States
