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 Victor M. Moreno, Alberto Pigazo - INTECH
An overview of recent developments in Kalman filter theory and their applications in engineering and scientific fields. The book covers recent advances in Kalman filtering theory and applications in electrical engineering and other areas.
(14419 views)

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

by Javier Prieto Tejedor (ed.) - InTech
This book takes a look at both theoretical foundations and practical implementations of Bayesian inference. It is intended as an introductory guide for the application of Bayesian inference in the fields of life sciences, engineering, and economics.
(5811 views)

by Walt Kester - Newnes
The book explains signal processing hardware. It covers sampled data systems, A-to-D and D-to-A converters for DSP applications, fast Fourier transforms, digital filters, DSP hardware, interfacing to DSP chips, hardware design techniques.
(16163 views)