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 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.
by G. Larry Bretthorst - Springer
This work is a research document on the application of probability theory to the parameter estimation problem. The people who will be interested in this material are physicists, economists, and engineers who have to deal with data on a daily basis.
by Salih Mohammed Salih (ed.) - InTech
The book covers fast hybrid recursive FT based on Jacket matrix, acquisition algorithm for global navigation system, determining the sensitivity of output parameters based on FFT, convergence of integrals based on Riemann-Lebesgue Lemma function, ...
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.