- Start
- Fast Fourier Transforms
Fast Fourier Transforms
Angebote / Angebote:
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.
Folgt in ca. 10 Arbeitstagen
