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 Walt Kester - Newnes
The book explains signal processing hardware. It covers sampled data systems, A-to-D and D-to-A converters for DSP applications, fast Fourier transforms, digital filters, DSP hardware, interfacing to DSP chips, hardware design techniques.
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.
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 Brad Osgood - Stanford University
This text is appropriate for science and engineering students. Topics include: Periodicity and Fourier series; The Fourier transform and its basic properties; Convolution and its applications; Distributions and their Fourier transforms; etc.