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
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.
(13655 views)
Signal Processingby Sebastian Miron - InTech
The exponential development of computer power over the last few decades, transformed signal processing in an essential tool for a wide range of domains such as telecommunications. This book provides highlights of the current research in the area.
(10245 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.
(10634 views)
An Introduction to Statistical Signal Processingby R. M. Gray, L. D. Davisson - Cambridge University Press
The book covers basic probability, random objects, expectation, second order moment theory with examples of the random process models and their basic properties, specific applications for communication, estimation, detection, modulation.
(21680 views)