Fast fourier transforms /

Saved in:
Bibliographic Details
Author / Creator:Burrus, C. S.
Imprint:Houston, Tex. : Connexions, Rice University, 2008-
Language:English
Subject:Fourier transformations.
Fourier analysis.
Fourier analysis.
Fourier transformations.
Textbooks
Textbooks.
Format: E-Resource Journal
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11364542
Hidden Bibliographic Details
Date / volume:Began Jun 2, 2008.
Notes:"This work is licensed by C. Sidney Burrus under a Creative Commons Attribution License (CC-BY 2.0): http://creativecommons.org/licenses/by/2.0/."
Unique identifier : col10550.
Contents viewed on Jan. 28, 2011; title from home page (last updated Apr 10, 2010).
Summary: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.