240 likes | 329 Vues
Discrete-time Fourier Transform. Prof. Siripong Potisuk. Derivation of the Discrete-time Fourier Transform. DTFT Pair. Conditions for Convergence. Examples. Example 1: 1 st Order System, Decay Power. stable system. Calculate the DT Fourier transform of the signal: Therefore:. a =0.8.
E N D
Discrete-time Fourier Transform Prof. Siripong Potisuk
Example 1: 1st Order System, Decay Power stable system • Calculate the DT Fourier transform of the signal: • Therefore: a=0.8
Example 2: Rectangular Pulse N1=2 • Consider the rectangular pulse • and the Fourier transform is
DTFT of Periodic Signals Recall the following DTFT pair: Represent periodic signal x[n]in terms of DTFS:
The Discrete Cosine Transform • In the same family as the Fourier Transform • Converts data to frequency domain. • Represents data via summation of variable frequency cosine waves. • Since it is a discrete version, conducive to problems formatted for computer analysis. • Captures only real components of the function. • Discrete Sine Transform (DST) captures odd (imaginary) components → not as useful. • Discrete Fourier Transform (DFT) captures both odd and even components → computationally intense.
Significance / Where is this used? • Image Processing • Compression - Ex.) JPEG • Scientific Analysis - Ex.) Radio Telescope Data • Audio Processing • Compression - Ex.) MPEG – Layer 3, aka. MP3 • Scientific Computing / High Performance Computing (HPC) • Partial Differential Equation Solvers
Algorithm Walk Through • Mathematical Basis • 1D Version: • Where: • 2D Version: • Where α(u) and α(v) are defined as shown in the 1D case.