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
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.
(10777 views)
Think DSP: Digital Signal Processing in Pythonby Allen B. Downey - Green Tea Press
'Think DSP: Digital Signal Processing in Python' is an introduction to signal processing and system analysis using a computational approach. The premise of this book is that if you know how to program, you can use that skill to learn other things.
(10931 views)
Optimal Filteringby B.D.O. Anderson, J.B. Moore - Prentice-Hall
This graduate-level text augments and extends studies of signal processing, particularly in regard to communication systems and digital filtering theory. Topics include filtering, linear systems, and estimation; the discrete-time Kalman filter; etc.
(19697 views)
Introduction To Random Processesby William A. Gardner - McGraw-Hill
A first course on random processes for graduate engineering and science students, particularly those with an interest in the analysis and design of signals and systems. The book includes detailed coverage of minimum-mean-squared-error estimation.
(12905 views)