DIGITAL SIGNAL PROCESSING
WEEK 11
DISCRETE FOURIER
TRANSFORM
(DFT)
Contents
• Introduction
1
• DFT and IDFT
2
• Properties of DFT
3
• Computational Complexity of DFT
4
2
Overview
Continuous-time Signals Discrete-time Signals
3
The Discrete Fourier Transform (DFT)
The DTFT yields a continuous and periodic spectra of a
aperiodic signal. So here the problem arises, when we want
to process, estimate, plot or compute this continuous signal.
DFT also provides an efficient solution to this issue as well.
A finite duration sequence x(n) of length L has a Fourier
transform
………..
(1)
4
The Discrete Fourier Transform (DFT)
When x(𝜔) is sampled at equally spaced frequencies
The resultant samples are
………..
(2)
It transforms a sequence x(n) of length into a
sequence of frequency samples X(k) of length N. This
relation is called Discrete Fourier Transform of x(n).
5
The Discrete Fourier Transform (DFT)
The relation which allows to recover the sequence x(n) from
the frequency samples is called the Inverse DFT.
………..
(3)
DFT is Sampling in Frequency Domain
DFT and IDFT expresses a finite-length signal as one period
of a periodic sequence.
DFT assumes aperiodic signal x(n) to be periodic for the
purpose of computation.
The two equations differs by the sealing factor 1/N and a
sign change in exponent. This leads to almost a same 6
algorithm for the calculation of both equations.
The Discrete Fourier Transform (DFT)
Moreover, these are almost identical to analysis and
synthesis equations of Discrete-time Fourier Series except
that 1/N is embedded in Synthesis equation
Here the two equations can be treated as DTFS and DFT as
well. If the signal x(n) is periodic, the equation (2) exhibits as
Discrete-time Fourier series, but if x(n) is aperiodic, the
equation forms as DFT. This is based on the fact that, a
periodic Signal of period N and aperiodic signal of length N,
both are expressed by ‘N’ values.
7
The Discrete Fourier Transform (DFT)
The DFT could be applied to real as well as complex signals.
If the given sequence x(n), is real and has N sample values,
then it gives N degrees of freedom in the time-domain.
In other words, it has N spectral co-efficient. However, half
the co-efficient are sufficient to define the spectral whereas
the other half values are ‘mirror-image’ or reversed-time
values
When signal has complex samples values, then it has 2N
degree of freedom in the time-domain. The N values of its
spectrum are real and N are complex.
Here we note that, whether signal is real or complex, the
DFT gives the same number of degree of freedom in the two
domains
8
The Discrete Fourier Transform (DFT)
9
Discrete Fourier Transform
Example:
Find the 4-point DFT of the sequence x(n)=cos(nπ/4)
Solution
Since N=4; n = { 0 , 1 , 2 , 3 }; x(n) = {1 , 0.707 , 0 , -
0.707}
For k=0 ; X(0)=1
k=1; X(1)=1-1.414j
k=2; X(2)=1
k=3; X(3)=1+1.414j
X(k) = { 1 , 1-1.414j , 1 , 1+1.414j }
Inverse Discrete Fourier Transform
Example:
Find the IDFT of the sequence X(k)={ 3 , 2+j , 1 , 2-j }
Solution
Since N=4; k= { 0 , 1 , 2 , 3 }
For n=0 ; x(0)=2
n=1; x(1)=0
n=2; x(2)=0
n=3; x(3)=1
x(n) = { 2 , 0 , 0 , 1 }
The Discrete Fourier Transform
Using Euler’s Identity
Where the real and imaginary parts are given by:
The magnitude and phase is evaluated as:
The Discrete Fourier Transform (DFT)
Example
A finite duration sequence of length L is given by
Determine the N-point DFT of this sequence for
Solution:
The Fourier transform of this sequence is
13
The Discrete Fourier Transform (DFT)
Example (Continue)
Magnitude and phase characteristics of the Fourier Transform of signal for L=10
The Discrete Fourier Transform (DFT)
Example (Continue)
The N-point DFT of x(n) is simply X(𝜔) evaluated at the set of
N equally spaced frequencies , k=0,1, … , N-
1.
Hence
If N is selected such that N=L, then the DFT becomes
The Discrete Fourier Transform (DFT)
Example (Continue)
Magnitude and phase of N-point DFT L=10 N=50
The Discrete Fourier Transform (DFT)
Example (Continue)
Magnitude and phase of N-point DFT L=10 N=100
