Fast Fourier Transforms

View Resource

No Strings Attached

Author:

C. Sidney Burrus

Subject:

Mathematics and Statistics, Science and Technology

Institution Name:

Connexions

Collection:

Connexions

Grade Level:

Post-secondary

Abstract:

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.

Languages:

English

Material Type:

Full Course, Textbooks

Media Format:

Text/HTML, Downloadable docs

Conditions of Use:

Creative Commons Attribution 2.0