0% found this document useful (0 votes)
24 views

M8 - Discrete Time Fourier Transform

This document discusses the discrete time Fourier transform (DTFT) and its applications. The DTFT is a variant of the Fourier transform that is used to analyze discrete-time signals. The document provides the formulation of the DTFT and inverse DTFT. It also discusses how the DTFT can be used to analyze signals in the frequency domain by decomposing them into their frequency components. Several examples are provided to demonstrate calculating the DTFT and plotting the magnitude and phase spectrums of signals.

Uploaded by

Syahirah Salim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
24 views

M8 - Discrete Time Fourier Transform

This document discusses the discrete time Fourier transform (DTFT) and its applications. The DTFT is a variant of the Fourier transform that is used to analyze discrete-time signals. The document provides the formulation of the DTFT and inverse DTFT. It also discusses how the DTFT can be used to analyze signals in the frequency domain by decomposing them into their frequency components. Several examples are provided to demonstrate calculating the DTFT and plotting the magnitude and phase spectrums of signals.

Uploaded by

Syahirah Salim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

SEL4223 Digital Signal Processing

Discrete Time Fourier Transform

Musa Mohd Mokji


Introduction
• Subset of -transform
• As -plane is a complex number plane, = = + where
is the real value, is the imaginary value. Thus & are as follows

= +

= tan
Introduction (cont.)

• In Fourier Transform, = 1. Thus, Fourier Transform is actually -


transform evaluated on the unit circle.
• If the formulation of -transform is

= ℎ

• Formulation for Fourier transform is similar to -transform but with


=
Transform Formulation

! " ⟹ = ℎ

1 (
$ % & ⟹ ℎ = '
2 (

• Note that the inverse FT is evaluated on = − to = or with


the range of 2 . This is because value will be repeated after each
2 .
Why DTFT?
• Basically, signal has three information, Amplitude (*), Frequency
( ) and Phase (∅).
Why DTFT? (cont.)
• In signal filtering system, filtering is based on the frequency of the
signal, where the desired frequency component will be preserved
while the unwanted frequency component will be removed from
the signal.

• In this case, FT is used to sort the signal based on its frequency.


When the signal has been sorted based on its frequency, the
process of preserving and removing frequency component in the
signal will be possible.

• In continuous signal, frequency is labeled with and the unit is Hz.


Discrete-time frequency
• In discrete signal, frequency is labeled with - where

-=
.

• → frequency of continuous signal – Hz


• . → Sampling frequency – Hz

• As - is the ratio between and . , it has no unit


Discrete-time frequency (cont.)
• Besides Hertz (Hz), frequency is also normally presented in radian
as given below, where the frequency is multiplied with 2

Continuous signal → Ω = 2 ( & )


Discrete signal → =2 - ( )

• Based on the FT formulation, it can be seen that the FT is sorting


the frequency component of the signal based on
Discrete-time frequency (cont.)
• As the important component of the FT is , sometimes the
formulation is written as ( ) instead of ( ).
• If we want to present the FT in terms of -, the formulation
becomes

(1
- = ℎ
Notation
Time-domain Frequency-domain

x t X Ω , X(F)
Continuous-
Function (signal) – small letter Function (response) – Capital letter
time
Index (time) – small letter Index (frequency) – Capital letter

x[n] X ω , X(f)

Discrete-time Function (signal) – small letter Function (response) – Capital letter

Index (integer) – small letter Index (frequency) – small letter


Magnitude and Phase Spectrum
• Similar to -transform, results of FT is also a complex value where
the real and imaginary value is separated.
• Thus, to obtain the behavior of the signal, magnitude and phase
spectrum are used for analysis

= : + ;( )

Magnitude → = : + ;

=>
Phase → ∠ = tan
=?
Other Spectrum Representation
• In signal analysis, few other spectrums are also used. There are;

• Energy → = ( )
Magnitude dB → 20 log E | |
(To obtain clearer plots as most of | | values are small)

• Obviously, G-axis of all of the spectrums


,∠ , , HI is the frequency component
of signal, and J-axis of the spectrums is the value of the
spectrum.
DTFT Plot
• Normally, the spectrums will be plotted from = − to = .
• As the spectrum value will be repeated every 2 , an alternative
way of plotting the spectrum is from = 0 to = 2 .
Example 1

• Plot ,∠ ,

Solution:
• ℎ =K +1 +K + K[ − 1]
Example 1 (cont.)

= K +1 +K +K −1

• = +1+
• =1+ +
• = 1 + 2 cos
• = 1 + 2cos( )
• : = 1 + 2 cos
• ; =0
Trigonometry Equations

In trigonometry, the relationship between


cosine and sine to exponential is as below

+
2
N!& =


&O =
2

= N!& + &O
Example 1 (cont.)
• = : + ;

• = 1 + 2 cos

=>
• ∠ = tan
=?
E
= tan
P QRS

0 O- ≥0
=T O- <0
− O- − <0

• = 1 + 2 cos
Example 1 (cont.)
3 1

0.5
Hreal (ω)

Himag(ω)
0

0 -0.5

-1 -1
-1 -0.8 -0.67 -0.4 -0.2 0 0.2 0.4 0.67 0.8 1 -1 -0.8 -0.67 -0.4 -0.2 0 0.2 0.4 0.67 0.8 1
ω (π rad) ω (π rad)

3 4
3.142
2.5

2
∠ H(ω)
|H(ω)|

1.5 0

0.5
-3.142
0 -4
-1 -0.8 -0.67 -0.4 -0.2 0 0.2 0.4 0.67 0.8 1 -1 -0.8 -0.67 -0.4 -0.2 0 0.2 0.4 0.67 0.8 1
ω (π rad) ω (π rad)
Example 2
• G = cos(0.1 ) for 0 ≤ ≤ 40
1

0.5
x[n]

-0.5

-1
0 5 10 15 20 25 30 35 40
n

• From the equation above, it is known that - = 0.05 where


= 2 - = 0.1 . The frequency value can also be seen from figure
above where - = = = 0.05. Now, lets plot the signal in the
[\ E
frequency domain using Fourier Transform.
Example 2 (cont.)
• ] =∑ G ℯ

• = ∑`E E cos(0.1 )ℯ

• = ∑`E E ℯ E. (
+ℯ E. (

• = ∑`E E ℯ ( E. ()
+ℯ ( PE. ()

• = ∑`E E ℯ ( E. ()
+ ∑`E E +ℯ ( PE. ()

ℯ abcd eaf.dg ℯ abcd ehf.dg


• = ℯ ab eaf.dg
+ ℯ ab ehf.dg
Example 2 (cont.)
25

20

15
|X(ω)|

10

0
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2
ω (πrad)

Magnitude spectrum where 0 ≤ ω ≤ 2π


Example 2 (cont.)
25

20

15
|X(ω)|

10

0
-1 -0.8 -0.6 -0.4 -0.1 0 0.1 0.4 0.6 0.8 1
ω (πrad)

Magnitude spectrum where −π ≤ ω ≤ π


Example 2 (cont.)

3
∠ X(ω)

-3

0 0.1 0.4 0.8 1 1.2 1.6 1.9 2


ω (πrad)

Phase spectrum where 0 ≤ ω ≤ 2π


Example 3
• G = cos(0.1 − 0.5 ) for 0 < < 40
• Figure below shows G[ ] where it is a 5 samples delay (jℎ & =
− 0.5 ) of signal in Figure 5.18

0.5
x[n]

-0.5

-1
0 5 10 15 20 25 30 35 40
n
Example 3 (cont.)
25

20

15
|X(ω)|

10

0
-1 -0.8 -0.6 -0.4 -0.1 0 0.1 0.4 0.6 0.8 1
ω (π rad)

Magnitude Spectrum
Example 3 (cont.)
1

∠ H(ω) = 0.5π

0.5
∠ H(ω) x π

-0.5

∠ H(ω) = -0.5π

-1
-1 -0.8 -0.4 -0.1 0 0.1 0.4 0.8 1
ω π
( rad)

Phase spectrum. The arrows show the phase value at ω = 0.1π


Example 4
• G = 0.9 l[ ]
• ] = E.mℯ abe

1
x[n]

0
0 ∞
n
Example 4 (cont.)
12

10

8
|H(ω)|

0
-1 -0.8 -0.6 -0.4 -0.2 0 0.2 0.4 0.6 0.8 1
ω (π rad)

Magnitude Spectrum
Example 4 (cont.)
1.5

0.5
|H(ω)|

-0.5

-1

-1.5
-1 -0.8 -0.6 -0.4 -0.2 0 0.2 0.4 0.6 0.8 1
ω (π rad)

Phase Spectrum
References
1) John G. Proakis, Dimitris K Manolakis, “Digital Signal Processing:
Principle, Algorithm and Applications”, Prentice-Hall, 4th edition
(2006).
2) Sanjit K. Mitra, “Digital Signal Processing-A Computer Based
Approach”, McGraw-Hill Companies, 3rd edition (2005).
3) Alan V. Oppenheim, Ronald W. Schafer, “Discrete-Time Signal
Processing”, Prentice-Hall, 3rd edition (2009).

You might also like