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
Digital Filtersby Fausto Pedro García Marquez - InTech
Digital filters are the most versatile, practical and effective methods for extracting the information necessary from the signal. This book presents the most advanced digital filters including different case studies and the most relevant literature.
(13773 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.
(19688 views)
Introduction To Random Processesby William A. Gardner - McGraw-Hill
A first course on random processes for graduate engineering and science students, particularly those with an interest in the analysis and design of signals and systems. The book includes detailed coverage of minimum-mean-squared-error estimation.
(14769 views)
Signal Processingby Sebastian Miron - InTech
The exponential development of computer power over the last few decades, transformed signal processing in an essential tool for a wide range of domains such as telecommunications. This book provides highlights of the current research in the area.
(15171 views)