Material Detail

Fast Fourier Transforms

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 provided.... Show More

Keywords:: Winograd Fourier Transform Algorithm, Fft, Wfta, Fast Fourier Transform, Cooley Tukey FFT, Prime Factor Algorithm, PFA

Disciplines:

Mathematics and Statistics / Mathematics

Go to Material

Bookmark / Add to Course ePortfolio

Create a Learning Exercise

Add Accessibility Information

Rate

Add a Comment

Quality

User Rating
Comments
Learning Exercises
Bookmark Collections
Course ePortfolios
Accessibility Info

Report Broken Link
Report as Inappropriate

More about this material

Material Type:: Open (Access) Textbook
Date Added to MERLOT:: July 11, 2016
Date Modified in MERLOT:: July 11, 2016
Author:: C. Sidney Burrus
Submitter:: Barbra Bied Sperling

Primary Audience:: College General Ed
Technical Format:: Website
Mobile Compatibility:: Not specified at this time
Language:: English
Cost Involved:: No
Source Code Available:: No
Accessibility Information Available:: Unknown
Creative Commons:: This work is licensed under a Attribution 3.0 United States