Fast Fourier Transforms
by C. Sidney Burrus, at al.
Publisher: Connexions 2008
Number of pages: 254
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.
Home page url
Download or read it online for free here:
by G. Nikolic, M. Cakic, D. Cvetkovic (eds) - InTech
The book provides a review on recent advances in Fourier transforms as the most powerful analytical tool for applications in electronic and computer engineering, as well as spectral techniques with a wide range of nanotechnological applications.
by Michele Basseville, Igor V. Nikiforov - Prentice-Hall
This book presents mathematical tools and techniques for solving change detection problems in wide domains like signal processing, controlled systems and monitoring. The book is intended for engineers and researchers involved in signal processing.
by Steven W. Smith - California technical Publishing
Digital Signal Processing is one of the most powerful technologies that will shape science and engineering in the twenty-first century. The book presents the fundamentals of DSP using examples from common science and engineering problems.
by 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.