The discrete fourier transform

Theory, algorithms and applications

D Sundararajan

374 pages, parution le 06/12/2001

Ajouter à une liste

Indisponible

Résumé

This authoritative 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 number 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 will 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.

Contents

The Discrete Sinusoid
The Discrete Fourier Transform
Properties of the DFT
Fundamentals of the PM DFT Algorithms
The u X 1 PM DFT Algorithms
The 2 X 2 PM DFT Algorithms
DFT Algorithms for Real Data — I
DFT Algorithms for Real Data — II
Two-Dimensional Discrete Fourier Transform
Aliasing and Other Effects
The Continuous-Time Fourier Series
The Continuous-Time Fourier Transform
Convolution and Correlation
Discrete Cosine Transform
Discrete Walsh–Hadamard Transform

Caractéristiques techniques

	PAPIER
Éditeur(s)	World Scientific
Auteur(s)	D Sundararajan
Parution	06/12/2001
Nb. de pages	374
Format	15,7 x 22,3
Couverture	Relié
Poids	653g
Intérieur	Noir et Blanc
EAN13	9789810245214