Frequency Analysis of DT Signals and

Properties of Fourier Transform

Presented by

M. TAYYAB YAQUB
21107004-003
KHALID MAHMOOD Presented to

21107004-004 Sir Dr. Arsalan

MS Electrical Engineering Masood

UNIVERSITY OF SIALKOT
 Discrete Time Signal Basics
• Sampling is the transformation of a
continuous signal into a discrete signal.
x(t)
• Signals represented as sequence of
numbers, called samples t
• Sample value of a typical signal or Continuous time Signal
sequence denoted as x[n] with n being an
integer in the range – ∞ ≤ n ≤ ∞.
• x[n] defined only for integer value of n and x(t) T is the sampling
period
undefined for non-integer values of n. X[n]
• Discrete time signal represented by {x[n]}. t = nT
Sampling of CT signal
to obtain DT Signal
 Purpose of Frequency Domain Analysis

• In engineering, frequency domain is a term used to describe the analysis of

mathematical functions or signals with respect to frequency, rather than
time.

• The most common purpose for analysis of signals in the frequency domain
is the analysis of signal properties.

• We study the spectrum to determine which frequencies are present in the

input signal and which are missing.
 Frequency Analysis of DT Signal

• Frequency analysis of a discrete time signal (aperiodic) involves

the Fourier transform of the time domain signal.

What is Fourier Transform

• The discrete time Fourier transform is a mathematical tool which
is used to convert a discrete time sequence into the frequency
domain. Therefore, the Fourier transform of a discrete time signal
or sequence is called the Discrete Time Fourier Transform (DTFT).
 Discrete Time Fourier Transformer (DTFT)

• Can we apply DTFT on;

 x
x[n] or x[t]
DT CT

• DTFT can not be applied on continuous time signal

 Discrete Time Fourier Transformer (DTFT)

• If we have a DT signal in time domain and apply DTFT then We

will get the following signal in frequency domain
DTFT
x[n] X[w] or X(ejw)
Time Domain Frequency Domain

Inverse Discrete Time Fourier Transformer (IDTFT)

IDTFT
X[w] or X(e ) jw
x[n]
Frequency Domain Time Domain
 Discrete Time Fourier Transformer (DTFT)

• Mathematically, if x(n) is a discrete time sequence, then the

discrete time Fourier transform of the sequence is defined as;

The discrete-time Fourier transform X(ω) of a discrete-time sequence x(n)

represents the frequency content of the sequence x(n).
Therefore, by taking the Fourier transform of the discrete-time sequence,
the sequence is decomposed into its frequency components. For this reason,
the DTFT X(ω) is also called the signal spectrum.
 Condition for Existence of DTFT

• The Fourier transform of a discrete-time sequence x(n) exists if

and only if the sequence x(n) is absolutely summable, i.e.,

The discrete-time Fourier transform (DTFT) of the exponentially

growing sequences do not exist, because they are not absolutely summable.
 Discrete Time Fourier Transform (DTFT)
• In discrete time system (DTS) the frequency range is unique over
interval of –p to p or 0 to 2p.
• x(w) is periodic when we have value 2p.
If we have;

In DTS, the Fourier transform of the signal involves a

summation of terms instead of an integral.
 Discrete Time Fourier Transform (DTFT)

• If we give as input to a linear time invariant (LTI) system, then the

output will be;

[ ]
∞
𝑦 ( 𝑛) = ∑ h( 𝑘 ) 𝑒
− 𝑗 𝜔𝑘
𝑒
𝑗𝜔𝑛

𝑘=− ∞

∑ h (𝑘) 𝑒
− 𝑗 𝜔𝑘
terms is called as and this is called DTFT of
𝑘=− ∞

∞
𝐻 (𝑒
So, ¿¿ 𝑗 𝜔)= ∑ h (𝑘) 𝑒
− 𝑗 𝜔𝑘
¿
𝑘=− ∞
 Inverse Discrete Time Fourier Transform (IDTFT)

• If we have , then we can find

• is samples from the original sequence which can be
Now we will find from

∞
= ∑ h ( 𝑘) 𝑒
𝑗𝜔 𝑛 − 𝑗 𝜔𝑘 𝑗 𝜔𝑛
𝐻 (𝑒¿¿ 𝑗 𝜔). 𝑒 .𝑒 ¿
𝑘=− ∞
∞
¿ ∑ h (𝑘) 𝑒
𝑗 𝜔 (𝑛 −𝑘)

Integrate on both sides 𝑘=− ∞

 Inverse Discrete Time Fourier Transform (IDTFT)
𝜋 ∞ 𝜋

∫ 𝐻 (𝑒 ¿ ¿ 𝑗 𝜔 ) . 𝑒
𝑗𝜔𝑛
𝑑 𝜔= ∑ h (𝑘) ∫ 𝑒
𝑗 𝜔 ( 𝑛 − 𝑘)
𝑑 𝜔¿
−𝜋 𝑘=− ∞ −𝜋
𝜋 ∞ 𝜋
h ( 𝑛) ∫ 𝑑 𝜔 + ∑ h (𝑘 ) ∫ 𝑒
𝑗 𝜔 (𝑛 −𝑘)
𝑑𝜔
−𝜋 𝑘=− ∞ −𝜋

We can call (n-k) = m, the term will become

and it can be written as

|
𝜋
𝑒
𝑗 𝜔𝑚
𝜋 𝑒 𝑗 𝜔 𝜋 − 𝑒− 𝑗 𝜔𝜋
2 𝑗𝑠𝑖𝑛 𝜋 𝑚
∫𝑒 𝑗 𝜔𝑚
𝑑 𝜔=
𝑗𝑚
=0
−𝜋 −𝜋 𝑗𝑚 𝑗𝑚

This is called inverse Discrete Time Fourier Transform

 Frequency Response of DT System
• Frequency response of a system is a complex
function with is plotted with respect to various
values of w.
• We have a graph whose x-axis is w in radian and
Y-axis is a complex quantity as H(ejw).
• w can take values from 0 to 2p or from –p to p.
• Complex quantity can be represented by polar
form which have its magnitude and phase.
• When magnitude is plotted w.r.t. w is called as
magnitude response and when phase is plotted
w.r.t. w then it is called phase response.
• Frequency response of DT signal have two
responses (i) Magnitude and (ii) Phase response.
 Frequency Response of DT System

If h(n)  real

Let h(n) = { -1, 0, 1, 2, 4, …..}

then Magnitude response;

Even Symmetricity
is symmetrical (even)

and Phase response;

is symmetrical (odd)
Odd Symmetricity