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 B.D.O. Anderson, J.B. Moore - Prentice-Hall
This graduate-level text augments and extends studies of signal processing, particularly in regard to communication systems and digital filtering theory. Topics include filtering, linear systems, and estimation; the discrete-time Kalman filter; etc.
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.
by Sophocles J. Orfanidis - Prentice Hall
An applications-oriented introduction to digital signal processing. The author covers all the basic DSP concepts, such as sampling, DFT/FFT algorithms, etc. The book emphasizes the algorithmic, computational, and programming aspects of DSP.
- Agilent Technologies
This text is a primer for those who are unfamiliar with the advantages of analysis in the frequency and modal domains and Dynamic Signal Analyzers. The authors avoid the use of rigorous mathematics and instead depend on heuristic arguments.