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
R. R. Bahadur's Lectures on the Theory of Estimationby Raghu Raj Bahadur, at al. - IMS
In this volume the author covered what should be standard topics in a course of parametric estimation: Bayes estimates, unbiased estimation, Fisher information, Cramer-Rao bounds, and the theory of maximum likelihood estimation.
(12058 views)
Elements of Signal Detection and Estimationby Carl W. Helstrom - Prentice Hall
This is an introduction to signal-detection theory, a subject fundamental to the design of detectors of weak signals in the presence of random noise, and to the design of optimal receivers of communication, radar, sonar and optical signals.
(15122 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.
(15576 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.
(14211 views)