Scribd
Upload
95 views

Chapter2 Lect8

This document discusses the discrete Fourier transform (DFT) and how it relates to the continuous Fourier transform (CFT). It defines the DFT and inverse DFT, and explains how the DFT can be used to approximate the CFT by windowing, sampling, and generating periodic samples. It also discusses how the fast Fourier transform (FFT) provides a fast algorithm for evaluating the DFT, and how the DFT can be used to compute Fourier series coefficients. Examples are provided to demonstrate computing the spectrum of a sinusoid using the DFT.

Uploaded by

Md.Arifur Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
95 views

Chapter2 Lect8

This document discusses the discrete Fourier transform (DFT) and how it relates to the continuous Fourier transform (CFT). It defines the DFT and inverse DFT, and explains how the DFT can be used to approximate the CFT by windowing, sampling, and generating periodic samples. It also discusses how the fast Fourier transform (FFT) provides a fast algorithm for evaluating the DFT, and how the DFT can be used to compute Fourier series coefficients. Examples are provided to demonstrate computing the spectrum of a sinusoid using the DFT.

Uploaded by

Md.Arifur Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 12

Chapter 2

Discrete Fourier Transform (DFT)

Topics:
Discrete Fourier Transform.

Using the DFT to Compute the Continuous Fourier


Transform.
Comparing DFT and CFT
Using the DFT to Compute the Fourier Series

Huseyin Bilgekul
Eeng360 Communication Systems I
Department of Electrical and Electronic Engineering
Eastern Mediterranean University

Discrete Fourier Transform (DFT)


Definition: The Discrete Fourier Transform (DFT) is defined by:
Where n = 0, 1, 2, ., N-1

The Inverse Discrete Fourier Transform (IDFT) is defined by:


where k = 0, 1, 2, ., N-1.
The Fast Fourier Transform (FFT) is a fast algorithm for evaluating
the DFT.

Using the DFT to Compute the Continuous Fourier Transform

Suppose the CFT of a waveform w(t) is to be evaluated using DFT.


1.

The time waveform is first windowed (truncated) over the interval (0, T) so
that only a finite number of samples, N, are needed. The windowed waveform
ww(t) is

2.

The Fourier transform of the windowed waveform is

3.

Now we approximate the CFT by using a finite series to represent the integral,
t = kt, f = n/T, dt = t, and t = T/N

Computing CFT Using DFT

We obtain the relation between the CFT and DFT; that is,
f = n/T and t = T/N
The sample values used in the DFT computation are x(k) = w(kt),
If the spectrum is desired for negative frequencies
the computer returns X(n) for the positive n values of 0,1, , N-1
It must be modified to give spectral values over the entire
fundamental range of -fs/2 < f <fs/2.
For positive frequencies we use
For Negative Frequencies

Comparison of DFT and


the Continuous Fourier
Transform (CFT)
Relationship between the DFT
and the CFT involves three
concepts:
Windowing,
Sampling,
Periodic sample generation

Comparison of DFT and


the Continuous Fourier
Transform (CFT)
Relationship between the DFT
and the CFT involves three
concepts:
Windowing,
Sampling,
Periodic sample generation

Fast Fourier Transform


The Fast Fourier Transform (FFT) is a fast algorithm for evaluating DFT.

Block diagrams depicting the


decomposition of an inverse DTFS
as a combination of lower order
inverse DTFSs.
(a) Eight-point inverse DTFS
represented in terms of two fourpoint inverse DTFSs.
(b) four-point inverse DTFS
represented in terms of two-point
inverse DTFSs.
(c) Two-point inverse DTFS.

Using the DFT to Compute the Fourier Series


The Discrete Fourier Transform (DFT) may also be used to compute the
complex Fourier series.
Fourier series coefficients are related to DFT by,

1
cn X (n)
N
1
cn X (n),
N
1
cn X ( N n),
N

N
0n
2
N
- n0
2

Block diagram depicting the sequence of operations involved in approximating the FT


with the DTFS.

Ex. 2.17 Use DFT to compute the spectrum of a Sinusoid

Ex. 2.17 Use DFT to compute the spectrum of a Sinusoid

Spectrum of a sinusoid obtained by using the

Using the DFT to


Compute the
Fourier Series

The DTFT and length-N DTFS of a


32-point cosine.
The dashed line denotes the CFT.
While the stems represent N|X[k]|.
(a) N = 32
(b) N = 60
(c) N = 120.

Using the DFT


to Compute the
Fourier Series

The DTFS approximation to the FT of x(t) = cos(2(0.4)t) + cos(2(0.45)t). The stems


denote |Y[k]|, while the solid lines denote CFT. (a) M = 40. (b) M = 2000. (c) Behavior in the
vicinity of the sinusoidal frequencies for M = 2000. (d) Behavior in the vicinity of the
sinusoidal frequencies for M = 2010

You might also like