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
Detection of Abrupt Changes: Theory and Applicationby Michele Basseville, Igor V. Nikiforov - Prentice-Hall
This book presents mathematical tools and techniques for solving change detection problems in wide domains like signal processing, controlled systems and monitoring. The book is intended for engineers and researchers involved in signal processing.
(14946 views)
Signal Processing for Communicationsby Paolo Prandoni, Martin Vetterli - EFPL Press
The book is less focused on the mathematics and more on the concepts, allowing students to think about the subject at a higher conceptual level, thus building the foundations for more advanced topics and helping students solve real-world problems.
(10718 views)
Introduction to Signal Processingby Sophocles J. Orfanidis - Prentice Hall
An applications-oriented introduction to digital signal processing. The author covers all the basic DSP concepts, such as sampling, DFT/FFT algorithms, etc. The book emphasizes the algorithmic, computational, and programming aspects of DSP.
(16023 views)
Mathematics of the Discrete Fourier Transform (DFT): with Audio Applicationsby Julius O. Smith III - W3K Publishing
Detailed mathematical derivation of DFT (Discrete Fourier Transform), with elementary applications to audio signal processing. Matlab programming examples are included. High-school math background is a prerequisite, including some calculus.
(22252 views)