1st Edition

Discrete and Continuous Fourier Transforms Analysis, Applications and Fast Algorithms

By Eleanor Chu Copyright 2008
422 Pages
by Chapman & Hall

422 Pages
by Chapman & Hall

424 Pages
by Chapman & Hall

Long employed in electrical engineering, the discrete Fourier transform (DFT) is now applied in a range of fields through the use of digital computers and fast Fourier transform (FFT) algorithms. But to correctly interpret DFT results, it is essential to understand the core and tools of Fourier analysis. Discrete and Continuous Fourier Transforms: Analysis, Applications and Fast Algorithms... Read more
Preface. Analytical and Graphical Representation of Function Contents. Sampling and Reconstruction of Functions—Part I. The Fourier Series. DFT and Sampled Signals. Sampling and Reconstruction of Functions—Part II. Sampling and Reconstruction of Functions—Part III. The Fourier Transform of a Sequence. The Discrete Fourier Transform of a Windowed Sequence. Discrete Convolution and the DFT. Applications of the DFT in Digital Filtering and Filters. Index Mapping and Mixed-Radix FFTs. Kronecker Product Factorization and FFTs. The Family of Prime Factor FFT Algorithms. On Computing the DFT of Large Prime Length. Bibliography. Index.

Biography

Eleanor Chu