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.
(27711 views)
Statistical Spectral Analysis: A Non-Probabilistic Theoryby 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.
(11925 views)
An Exploration of Random Processes for Engineersby Bruce Hajek - University of Illinois at Urbana-Champaign
These notes were written for a graduate course on random processes. Students are assumed to have had a previous course in probability, some familiarity with real analysis and linear algebra, and some familiarity with complex analysis.
(18330 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.
(17057 views)