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.
(13613 views)
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.
(20163 views)
Think DSP: Digital Signal Processing in Pythonby Allen B. Downey - Green Tea Press
'Think DSP: Digital Signal Processing in Python' is an introduction to signal processing and system analysis using a computational approach. The premise of this book is that if you know how to program, you can use that skill to learn other things.
(15373 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.
(27697 views)