Program : B.

Tech
Subject Name: Signals and Systems
Subject Code: EC-402
Semester: 4th
Downloaded from be.rgpvnotes.in

Unit-4 Fourier analysis of discrete time signals: Introduction, Properties and application of discrete time
Fourier series, Representation of Aperiodic signals, Fourier transform and its properties, Convergence of
discrete time Fourier transform, Fourier Transform for periodic signals, Applications of DTFT.

The Fourier transform of a discrete sequence x(n) is defined as

The DTFT of x(n) is defined as,
∞

F[x n ] = X ω = ∑ x n e− ω
=−∞
The inverse DTFT of X(ω) is defined as,
π
− [X ω ] = x n = ∫ X ω e− ω dω
F
π
−π

Examples: Find the DTFT of the following sequences.

(a) δ(n) (b) u(n) (c) anu(n)

Solution:
(a) Given, x(n) = δ(n) (b) Given, x(n) = u(n)
for n = for n ≥
δ n = { u n = {
for n ≠ for n <
∞ ∞
−ω
F[ δ n ] = X ω = ∑ δ n e | = = F[u n ] = X ω = ∑ u n e− ω
=−∞ =−∞

∞
∴ F[ δ n ] =
=∑ e− ω =
− e− ω
=

(c) Given, x(n) =anu(n)

a for n ≥
x n = {
for n <
∞ ∞

F[x n ] = X ω = ∑ x n e− ω = ∑ a u n e− ω
=−∞ =−∞
∞

= ∑ ae− ω =
− ae− ω
=

Convergence of discrete time Fourier transform:

The Fourier transform of a sequence x(n) exists if and only if the summation is finite value.
∞

�. �., ∑ |x n | < ∞
=−∞
The DTFT of the sequence does not exist if the sequence is growing exponentially. The DTFT can be used only
for the systems whose system function H(z) has poles inside the unit circle. The Fourier transform represents
the frequency components of the sequence x(n). It is unique in the frequency range –π to π .

Page no: 1 Follow us on facebook to get real-time updates from RGPV

Downloaded from be.rgpvnotes.in

Properties of DTFT:
(i) Linearity Property (ii) Time Shifting Property
It states that, the DTFT of a weighted sum of two It states that,
DTFT
sequences is equal to the weighted sum of individual DTFT. x n ↔ X ω ,
If
DTFT
If x n ↔ X ω , DTFT
DTFT then x n−m ↔ e− ω X ω ,
and x n ↔ X ω ,
where m is an integer.
DTFT
then ax n + bx n ↔ aX ω + bX ω Proof: By definition
∞
Proof: By definition F[x n ] = X ω = ∑ x n e− ω
∞
=−∞
F[x n ] = X ω = ∑ x n e− ω ∞
=−∞
F[x n − m ] = ∑ x n − m e− ω
∞
=−∞
F[ax n + bx n ] = ∑ [ax n + bx n ]e− ω Put p=n-m in the summation, then n=m+p.
=−∞ ∞
∞ ∞ F[x p ] = ∑ x p e− ω +p

= ∑ ax n e− ω + ∑ bx n e− ω p=−∞
∞
=−∞ =−∞
−ω
∞ ∞ F[x p ] = e ∑ x p e− ωp
p=−∞
= a ∑ x n e− ω + b ∑ x n e− ω
=−∞ =−∞ F[ x p ] = e − ω X ω
= aX ω + bX ω DTFT
∴ x n−m ↔ e− ω X ω ,
DTFT
∴ ax n + bx n ↔ aX ω + bX ω
(iii) Frequency Shifting Property (iv) Time Reversal Property
It states that, It states that,
DTFT DTFT
If x n ↔ X ω , If x n ↔ X ω ,

DTFT DTFT
then x n e ω0 ↔ X ω−ω then x −n ↔ X −ω
Proof: By definition Proof: By definition
∞ ∞
−ω
F[x n ] = X ω = ∑ x n e F[x n ] = X ω = ∑ x n e− ω
=−∞ =−∞
∞ ∞

F[x n e ω0 ] = ∑ {x n e ω0 } e− ω F[x −n ] = ∑ x −n e− ω
=−∞ =−∞
∞ ∞ ∞
ω0
F[x n e ] = ∑ x n e− ω−ω0 = X ω−ω F[x −n ] = ∑ x n e ω
= ∑ x n e− −ω

=−∞ =−∞ =−∞

F[x −n ] = X −ω
DTFT
∴ x n e ω0 ↔ X ω−ω DTFT
∴ x −n ↔ X −ω
This property is dual of time shifting property.

Page no: 2 Follow us on facebook to get real-time updates from RGPV

Downloaded from be.rgpvnotes.in

(v) Differentiation in Frequency Domain Property (vi) Time Convolution Property

It states that, It states that,
DTFT DTFT
If x n ↔ X ω , If x n ↔ X ω ,
DTFT
and x n ↔ X ω ,
DTFT dX ω
then n. x n ↔ j dω DTFT
then x n ∗ x n ↔ X ω .X ω
Proof: By definition
∞

F[x n ] = X ω = ∑ x n e− ω Proof: By definition

∞
=−∞

Differentiating on both sides w.r.t ω we get, x n ∗x n = ∑ x k x n−k

∞ =−∞
d d ∞
X ω = ∑ x n e− ω
dω dω F[x n ∗ x n ] = ∑ x n ∗ x n e− ω
=−∞
∞ =−∞
d −ω ∞
∞
= ∑x n e
dω = ∑ { ∑ x k x n − k }} e− ω
=−∞
∞ =−∞
∞ =−∞
= ∑ x n −jn e− ω = −j ∑ n x n e− ω ∞ ∞

=−∞
=−∞ = ∑ x k ∑ x n − k e− ω
d =−∞ =−∞
X ω = F nx n
j
dω Put n-k=p and n=p+k
DTFT dX ω
∴ n. x n ↔ j ∞ ∞
dω
= ∑ x k ∑ x p e− ω p+

=−∞ p=−∞
∞ ∞
−ω
= ∑ x k e ∑ x p e− ωp
=−∞ p=−∞

∴ F[x n ∗ x n ] = X ω . X ω
DTFT
x n ∗x n ↔ X ω .X ω
(vii) The Modulation Theorem
It states that, ∞ ∞
DTFT
If x n ↔ X ω , = ∑ x n e− ω−ω0
+ ∑ x n e− ω+ω0

=−∞ =−∞
DTFT
then x n cosω n ↔ {X ω + ω +X ω+ω } = {X ω + ω +X ω+ω }
Proof: By definition DTFT
∞ ∴ x n cosω n ↔ {X ω + ω +X ω+ω }
−ω
F[x n cosω n] = ∑ x n cosω ne
=−∞
∞
e ω0 + e − ω 0
= ∑x n e− ω
=−∞

Page no: 3 Follow us on facebook to get real-time updates from RGPV

Downloaded from be.rgpvnotes.in

Examples: Using properties of DTFT, find the DTFT of the following (i) n(1/2) nu(n) (ii) u(n+1)-u(n+2)
(iii) ej3n u(n)

Solution: (i) Using Differentiation in frequency domain property, we have

d
F {n ( ) u n } = j [F {( ) u n }]
dω
d
=j [ ]
dω − e− ω
{−[− e− ω −j ]}
= j[ ]
{ − e− ω }
e− ω
=[ ]
{ − e− ω }
(ii) Using time shifting property
F{u n + −u n+ } = F{u n + } − {u n + }

= e ω F{u n } − e ω {u n }
eω e ω
= −
− e− ω − e− ω
(iii) Using Frequency shifting property
F{e u n } = F{u n }|ω=ω−
={ } ={ }
− e− ω ω=ω− − e− ω−

Page no: 4 Follow us on facebook to get real-time updates from RGPV

 We hope you find these notes useful.
You can get previous year question papers at
https://qp.rgpvnotes.in .

If you have any queries or you want to submit your

study notes please write us at
[email protected]