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 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.
by John Treichler - Connexions
This book examines how to convert a typical filter specification into a reasonably accurate estimate of the length of the impulse response. The text covers filter sizing, performance comparisons with other FIR design methods, etc.
by Jeff Fessler - University of Michigan
Course objectives: 1. to teach students the concepts of discrete-time signals, including mathematical representations; 2. to teach students the concepts of linear time-invariant discrete-time systems; 3. to introduce the concepts of filter design.
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.