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
Digital Signal Processing and Analysisby Jeff Fessler - University of Michigan
Course objectives: 1. to teach students the concepts of discrete-time signals, including mathematical representations; 2. to teach students the concepts of linear time-invariant discrete-time systems; 3. to introduce the concepts of filter design.
(15720 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.
(14478 views)
Statistical Spectral Analysis: A Non-Probabilistic Theoryby William A. Gardner - Prentice Hall
This book is intended to serve as both a graduate-level textbook and a technical reference. The focus is on fundamental concepts, analytical techniques, and basic empirical methods. The only prerequisite is an introductory course on Fourier analysis.
(6877 views)
Kalman Filter Recent Advances and Applicationsby Victor M. Moreno, Alberto Pigazo - INTECH
An overview of recent developments in Kalman filter theory and their applications in engineering and scientific fields. The book covers recent advances in Kalman filtering theory and applications in electrical engineering and other areas.
(12174 views)