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
Modern Signal Processingby Daniel N. Rockmore, Jr, Dennis M. Healy - Cambridge University Press
The book about the mathematical basis of signal processing and its many areas of application for graduate students. The text emphasizes current challenges, new techniques adapted to new technologies, and recent advances in algorithms and theory.
(14454 views)
Principles of Computerized Tomographic Imagingby Avinash C. Kak, Malcolm Slaney - IEEE Press
A comprehensive, tutorial-style introduction to the algorithms for reconstructing cross-sectional images from projection data and contains a complete overview of the engineering and signal processing algorithms necessary for tomographic imaging.
(20060 views)
Digital Filtersby Fausto Pedro García Marquez - InTech
Digital filters are the most versatile, practical and effective methods for extracting the information necessary from the signal. This book presents the most advanced digital filters including different case studies and the most relevant literature.
(9669 views)
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.
(9152 views)