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 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 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.
by 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.
by M. Stiber, B.Z. Stiber, E.C. Larson - University of Washington Bothell
The specific topics we will cover include: physical properties of the source information, devices for information capture, digitization, compression, digital signal representation, digital signal processing and network communication.