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
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.
(27001 views)
The Scientist and Engineer's Guide to Digital Signal Processingby Steven W. Smith - California technical Publishing
Digital Signal Processing is one of the most powerful technologies that will shape science and engineering in the twenty-first century. The book presents the fundamentals of DSP using examples from common science and engineering problems.
(67731 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.
(14660 views)
Structure and Interpretation of Signals and Systemsby E. A. Lee, P. Varaiya - Addison Wesley
An introduction to signals and systems for electrical engineering, computer engineering, and computer science students. The material motivates signals and systems through sound and images, as opposed to circuits. Calculus is the only prerequisite.
(16783 views)