Fast Fourier Transforms
by C. Sidney Burrus, at al.
Publisher: Connexions 2008
Number of pages: 254
Description:
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.
Download or read it online for free here:
Download link
(1.4MB, PDF)
Similar books
Modern Signal Processingby Daniel N. Rockmore, Jr, Dennis M. Healy - Cambridge University Press
The book about the mathematical basis of signal processing and its many areas of application for graduate students. The text emphasizes current challenges, new techniques adapted to new technologies, and recent advances in algorithms and theory.
(17588 views)
Fourier Transforms: High-tech Application and Current Trendsby G. Nikolic, M. Cakic, D. Cvetkovic (eds) - InTech
The book provides a review on recent advances in Fourier transforms as the most powerful analytical tool for applications in electronic and computer engineering, as well as spectral techniques with a wide range of nanotechnological applications.
(6881 views)
Digital Filtersby Fausto Pedro García Marquez - InTech
Digital filters are the most versatile, practical and effective methods for extracting the information necessary from the signal. This book presents the most advanced digital filters including different case studies and the most relevant literature.
(12111 views)
Optimum Signal Processingby Sophocles J. Orfanidis
In this edition the emphasis is on real-time adaptive signal processing, eigenvector methods of spectrum estimation, and parallel processor implementations of optimum filtering and prediction algorithms, and including several new developments.
(13580 views)