Skip to content Skip to navigation
Collection type: Book
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.
Institution: Rice University
This collection contains: Modules by: C. Sidney Burrus, Ivan Selesnick, Markus Pueschel, Matteo Frigo, Steven G. Johnson