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 anal
Discrete and continuous Fourier transforms: analysis, applications and fast algorithms
โ Scribed by Chu, Eleanor Chin-hwa
- Publisher
- Chapman & Hall;CRC
- Year
- 2019
- Tongue
- English
- Leaves
- 423
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Table of Contents
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.
โฆ Subjects
Fourier analysis;Fourier transformations
๐ SIMILAR VOLUMES
<p><P><EM>Fast Fourier Transform - Algorithms and Applications</EM> presents an introduction to the principles of the fast Fourier transform (FFT). It covers FFTs, frequency domain filtering, and applications to video and audio signal processing.</P><P>As fields like communications, speech and image
<p><P><EM>Fast Fourier Transform - Algorithms and Applications</EM> presents an introduction to the principles of the fast Fourier transform (FFT). It covers FFTs, frequency domain filtering, and applications to video and audio signal processing.</P><P>As fields like communications, speech and image
This book provides comprehensive coverage of practical Fourier analysis. It develops the concepts right from the basics and gradually guides the reader to the advanced topics. It presents the latest and practically efficient DFT algorithms, as well as the computation of discrete cosine and Walsh-Had