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
Optimum Signal Processingby Sophocles J. Orfanidis
In this edition the emphasis is on real-time adaptive signal processing, eigenvector methods of spectrum estimation, and parallel processor implementations of optimum filtering and prediction algorithms, and including several new developments.
(11791 views)
Hidden Markov Models: Estimation and Controlby 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.
(12502 views)
Digital Filters and Signal Processingby F.P.G. Marquez, N. Zaman (ed.) - InTech
Digital filters, together with signal processing, are being employed in the new technologies and information systems, and implemented in different areas and applications. This book presents advanced developments, covering different cases studies.
(7574 views)
Kalman Filterby Vedran Kordic - InTech
The Kalman filter has been successfully employed in diverse knowledge areas over the last 50 years. The aim of this book is to provide an overview of recent developments in Kalman filter theory and their applications in engineering and science.
(10684 views)