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

by 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.
(11784 views)

by William A. Gardner - Prentice Hall
This book is intended to serve as both a graduate-level textbook and a technical reference. The focus is on fundamental concepts, analytical techniques, and basic empirical methods. The only prerequisite is an introductory course on Fourier analysis.
(10041 views)

by 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.
(11879 views)

by R. J. Elliott, L. Aggoun, J. B. Moore - Springer
The aim of this book is to present graduate students with a thorough survey of reference probability models and their applications to optimal estimation and control. Readers are assumed to have basic grounding in probability and systems theory.
(15087 views)