๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

The Discrete Fourier Transform: Theory, Algorithms and Applications

โœ Scribed by D. Sundararajan


Publisher
World Scientific Publishing Company
Year
2001
Tongue
English
Leaves
392
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


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-Hadamard transforms. The large numbers of visual aids such as figures, flow graphs and flow charts makes the mathematical topic easy to understand. In addition, the numerous examples and the set of C-language programs (a supplement to the book) help greatly in understanding the theory and algorithms. Discrete Fourier analysis is covered first, followed by the continuous case, as the discrete case is easier to grasp and is very important in practice. This book should be useful as a text for regular or professional courses on Fourier analysis, and also as a supplementary text for courses on discrete signal processing, image processing, communications engineering and vibration analysis.


๐Ÿ“œ SIMILAR VOLUMES


The Discrete Fourier Transform: Theory,
โœ D. Sundararajan ๐Ÿ“‚ Library ๐Ÿ“… 2001 ๐ŸŒ English

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

DISCRETE AND CONTINUOUS FOURIER TRANSFOR
โœ Eleanor Chu ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Chapman and Hall/CRC ๐ŸŒ English

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