www.EasyEngineering.

net

5
Discrete-time Fourier Transform
ww
w .Ea
5.1 INTRODUCTION syE
ngi
A continuous-time signal can be represented in the frequency domain using Laplace
transform or continuous-time Fourier transform (CTFT). Similarly, a discrete-time signal can

nee
be represented in the frequency domain using Z-transform or discrete-time Fourier transform.
The Fourier transform of a discrete-time signal is called discrete-time Fourier transform
(DTFT). DTFT is very popular for digital signal processing because of the fact that using

rin
this the complicated operation of convolution of two sequences in the time domain can be
converted into a much simpler multiplicative operation in the frequency domain. In this

g.n
chapter, we discuss about DTFT, its properties and its use in the analysis of signals.

5.2 DISCRETE-TIME FOURIER TRANSFORM (DTFT)

e
The Fourier transform of discrete-time signals is called the discrete-time Fourier transform
(DTFT). t
If x(n) is the given discrete-time sequence, then X(w) or X(e jw ) is the discrete-time
Fourier transform of x(n).
The DTFT of x(n) is defined as:
‡
F[x (n)] X (X ) Ç x (n) e  jX n
n ‡

The inverse DTFT of X(w) is defined as:

Q
1
F 1[X (X )] x ( n) Ô X (X ) e
jX n
dX
2Q Q
358

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 359

We also refer to x(n) and X(w) as a Fourier transform pair and this relation is expressed
as:
 X (X )
FT
x (n) Ž  

5.3 EXISTENCE OF DTFT

The Fourier transform exists for a discrete-time sequence x(n) if and only if the sequence is
absolutely summable, i.e. the sequence has to satisfy the condition:
‡
Ç x(n)  ‡
ww n ‡

The DTFT does not exist for the sequences that are growing exponentially (ex. an u(n),
a > 1) since they are not absolutely summable. Therefore, DTFT method of analyzing a

w
system can be applied for a limited class of signals. Moreover this method can be applied

.Ea
only to asymptotically stable systems and it cannot be applied for unstable systems. That is,
DTFT can be used only for the systems whose system function H(z) has poles inside the unit
circle.

syE
The Fourier transform X(w) of a signal x(n) represents the frequency content of x(n).
We can say that, by taking Fourier transform, the signal x(n) is decomposed into its
frequency components. Hence X(w) is called signal spectrum.

ngi
The difference between the Fourier transforms of a discrete-time signal and analog
signal are as follows:

nee
1. The Fourier transform of analog signals consists of a spectrum with a frequency
range – ¥ to ¥. But the Fourier transform of discrete-time signals is unique in the
frequency range –p to p (or equivalently 0 to 2p ). Also Fourier transforms of

rin
discrete-time signals are periodic with period 2p. Hence the frequency range for
any discrete-time signal is limited to –p to p (or 0 to 2p ) and any frequency

g.n
outside this interval has an equivalent frequency within this interval.
2. Since the analog signals are continuous, the Fourier transform of analog signals

summation because the signals are discrete.

e
involves integration, but the Fourier transform of discrete-time signals involves

t
5.4 RELATION BETWEEN Z-TRANSFORM AND FOURIER TRANSFORM
The Z-transform of a discrete sequence x(n) is defined as:
‡
X ( z ) Ç x ( n) z  n
n ‡
where z is a complex variable.
The Fourier transform of a discrete-time sequence x(n) is defined as:
‡
X (X ) Ç x (n) e  jX n
n ‡

www.EasyEngineering.net
 www.EasyEngineering.net

360 | Digital Signal Processing

The X(z) can be viewed as a unique representation of the sequence x(n) in the complex
z-plane.
Let z = re jw
‡
\ X ( z ) Ç x (n) (re jX )  n
n ‡
‡
Ç [x (n) r  n ] e  jX n
n ‡

The RHS is the Fourier transform of x(n) r–n, i.e. the Z-transform of x(n) is the Fourier
transform of x(n) r–n.

ww When r = 1,
‡
X ( z ) Ç x (n) e  jX n X (X )

w .Ea
n ‡

The RHS is the Fourier transform of x(n). So we can conclude that the Fourier transform of
x(n) is same as the Z-transform of x(n) evaluated along the unit circle centred at the origin of
the z-plane.

\
syE
X (X ) = X ( z ) z e jX Ç
‡

n ‡
x ( n) z n
z e jX
‡
Ç x(n) e jX n
n ‡

ngi
For X(w ) to exist, the ROC must include the unit circle. Since ROC cannot contain any poles
of X(z) all the poles must lie inside the unit circle. Therefore, we can conclude that Fourier

nee
transform can be obtained for any sequence x(n), from its Z-transform X(z) if the poles of
X(z) are inside the unit circle.

EXAMPLE 5.1 Find the DTFT of the following sequences:

(a) d (n) (b) u(n)
rin
(c) d (n – m)
(e) anu(n)
(d) u(n – m)
(f) –anu(–n – 1) g.n
(g) d (n + 3) – d (n – 3)
Solution:
(a) Given
(h) u(n + 3) – u(n – 3)

x(n) = d (n)
e t
ÎÑ1 for n 0
E (n) Ï
ÑÐ0 for n › 0
‡
X (X ) F{E ( n)} Ç E (n) e  jX n n 0 1
n ‡

\ F{E ( n)} 1

FT
E (n) Ž  
1

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 361

(b) Given x(n) = u(n)

ÎÑ1 for n • 0
u(n) Ï
for n  0
ÑÐ0
‡
X (X ) F{u(n)} Ç u(n) e  jX n
n ‡
‡
Ç (1) e  jX n 1  e  jX
1
n 0
1
\ F{u( n)}
1  e  jX
ww u(n) Ž  

FT 1
1  e  jX
w
(c) Given
.Ea x(n) =
ÎÑ1
d (n – m)
for n m

syE E ( n  m)

‡
Ï
ÑÐ0 for n › m

X (X ) F{E (n  m)}
n
Ç
‡
ngi
E (n  m) e  jX n e  jX n n m e  jX m

\
nee
F{E ( n  m )} e  jX m

 e  jX m
E (n  m) Ž  
FT

(d) Given x(n) = u(n – m)

rin
u(n  m)
ÎÑ1
Ï
ÑÐ0
for n • m
for n  m g.n
X (X ) F{u(n  m)}

 
Ç
n ‡
jX ( m  1)
‡
u(n  m) e  jX n
‡
Ç (1) e jX n
n m
e t
e jX m
e  e  jX ( m  2)  "
e  jX m (1  e  jX  e  j 2X  ")
e  jX m
1  e  jX
e  jX m
\ F{u(n  m)}
1  e  jX

FT e  jX m
u(n  m) Ž  

1  e  jX

www.EasyEngineering.net
 www.EasyEngineering.net

362 | Digital Signal Processing

(e) Given x(n) = anu(n)

‡
X (X ) F{a n u(n)} Ç a n u( n) e  jX n
n ‡
‡
Ç (ae jX )n
1
n 0 1  ae  jX
1
\ F{a n u(n)}
1  ae  jX

FT 1
a n u(n) Ž  


ww (f) Given x(n) = –anu(–n – 1)

1  ae  jX

w .Ea
X (X ) F{ a n u(  n  1)}
‡
Ç  anu( n  1) e jX n
n ‡

syE 1 ‡
Ç  an e jX n  Ç a n e jX n  Ç (a1e jX )n
n ‡ n 1
‡

n 1

ngi
 ËÍ a 1e jX  ( a 1e jX )2  (a 1e jX )3  "ÛÝ

 a 1e jX ËÍ1  ( a 1e jX )1  (a 1e jX )2  "ÛÝ

 a 1e jX
1  a 1e jX
nee
1 rin
\
1  ae  jX
F{ a n u(  n  1)}
1 g.n
 a n u(  n  1) Ž  

FT
1  ae  jX
1
1  ae  jX
e t
(g) Given x(n) = d (n + 3) – d (n – 3)
X (X ) F{E ( n  3)  E ( n  3)}
‡
Ç {E (n  3)  E (n  3)} e jX n
n ‡

e jX n  jX n
n 3  e n 3

e j 3X  e  j 3X 2 j sin 3X

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 363

(h) Given x(n) = u(n + 3) – u(n – 3)

X (X ) F{u(n  3)  u(n  3)}
‡ ‡ ‡
 jX n =  jX n 
Ç {u( n  3)  u ( n  3)} e Ç (1) e Ç (1) e jX n
n ‡ n 3 n 3

e j 3X
e j 2X jX
 e 1 e  jX
e  j 2X
"  e  j 3X
 e  j 4X  "
e j 3X  e j 2X  e jX  1  e  jX  e  j 2X

EXAMPLE 5.2 Find the DTFT of:

(a) x(n) = {1, –2, 2, 3} (b) x(n) = 3nu(n)

ww (c) x(n) = (0.5)n u(n) + 2n u(–n – 1)

È 1Ø
n
(d) x (n) = É Ù u(n  1)
Ê 4Ú

w(e) x ( n)

(g) x(n) = a |n|

ÎÑ n,

.Ea
Ï
ÑÐ0,
4 … n … 4
otherwise
(f) x (n)
ÑÎ1,
Ï
ÑÐ0,
0…n…3
otherwise

Solution:
(a) Given syE x(n) = {1, –2, 2, 3}
‡
ngi
X (X ) F{x (n)} Ç x ( n) e  jX n
n ‡

nee
x (0)  x (1) e  jX  x (2) e  j 2X  x (3) e  j 3X
1  2e  jX  2e  j 2X  3e  j 3X
(b) Given x(n) = 3nu(n). The given sequence is not absolutely summable. Therefore, its
rin
g.n
DTFT does not exist.
(c) Given x(n) = (0.5)nu(n) + 2n u(–n – 1)
‡
X (X ) F{x (n)} Ç {(0.5) n u(n)  2 n u(  n  1)} e  jX n

‡
Ç
n ‡

{(0.5) n
u ( n )} e  jX n 
‡
Ç {2n u( n  1)} e  jX n
e t
n ‡ n ‡
‡ 1
Ç (0.5)n e jX n  Ç 2n e jX n
n 0 n ‡
‡ ‡
Ç (0.5e  jX )n  Ç (21 e jX )n
n 0 n 1

1 2 1 e jX

1  0.5e  jX 1  2 1 e jX
1 1
 
1  0.5e jX
1  2e  jX

www.EasyEngineering.net
 www.EasyEngineering.net

364 | Digital Signal Processing

n
È 1Ø
(d) Given x (n) = É Ù u( n  1)
Ê 4Ú

ÎÑÈ 1 Ø n ÞÑ ‡ È 1Øn
X (X ) F ÏÉ Ù u(n  1) ß Ç É Ù u( n  1) e  jX n
ÑÐÊ 4 Ú Ñà n ‡ Ê 4 Ú
‡ È 1Øn ‡ È1 n
 jX n - jX Ø
Ç ÉÊ ÙÚ e Ç ÉÊ e ÙÚ
n 1 4 n 1 4
1
È 1  jX Ø Ë ‡ 1  jX Û jX Ë 1 Û
ÉÊ e ÙÚ Ì Ç e Ü 4e Ì  jX Ü
4 ÍÌ n 0 4 ÝÜ Í 1  (1/4) e Ý

ww 4e jX

1  (1/4) e  jX

w(e) Given
.Ea 4
x ( n)
ÎÑ n,
Ï
ÑÐ0,
4 … n … 4
otherwise

X (X )
syE
F{x (n)}

 4e j 4X
Ç
n 4

 3ej 3X
ne  jX n

 2e j 2X  e jX  e  jX  2e  j 2X  3e  j 3X  4e  4 jX

ngi
 2 j {4 sin 4X  3 sin 3X  2 sin 2X  sin X}
ÎÑ1, 0…n…3
(f) Given x (n) Ï
nee
ÑÐ0, otherwise

rin
By definition of Fourier transform,
‡ 3
X (X ) Ç x ( n) e  jX n Ç (1) e  jX n
n ‡

1e  j 4X
n 0

1  e  j 2X e  j 2X
1  e  jX 1  e(  jX /2) e(  jX /2)
g.n
e
e  j 2X {e j 2X  e  j 2X }
= (  jX /2) ( jX /2)
{e e (  jX /2) Ì
} Í 2 j sin(X /2) Ý
e
Ë 2 j sin 2X Û  j 2X  jX /2
Üe t
sin 2X - j (3/2) X
= e
sin(X /2)
(g) Given x(n) = a |n|
‡
X (X ) F{a } Ç a e  jX n
n n

n ‡
1 ‡ ‡ ‡
Ç a  n e jX n  Ç an e jX n Ç (ae jX )n  Ç (ae jX )n
n ‡ n 0 n 1 n 0
jX
ae 1 1 a 2

jX
  jX
1  ae 1  ae 1  2 a cos X  a2

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 365

EXAMPLE 5.3 Find the DTFT of the following sequences:

È nQ Ø È nQ Ø
(a) sin É Ù u(n) (b) cos É Ù u(n)
Ê 2 Ú Ê 3 Ú
n n2
È 1Ø È nQ Ø È 1Ø
(c) ÉÊ 2 ÙÚ sin ÉÊ 4 ÙÚ u( n) (d) É Ù u(n  2)
Ê 2Ú
(e) cos (w0n) u(n) (f) sin(w0 n) u(n)
Solution:
È nQ Ø
(a) Given x(n) = sin É Ù u(n)
Ê 2 Ú

ww X (X )
Î È nQ Ø Þ
F Ïsin É Ù u(n) ß
Ê Ú
‡ Î È nQ Ø
Ç Ï ÉÊ 2 ÙÚ ß
sin u ( n )
Þ  jX n
e =
‡ È nQ Ø
Ç sin ÉÊ 2 ÙÚ e jX n
w .Ea
n
Ç
Ð
‡

0
2 à

2j
n ‡ Ð

e j ( nQ /2)  e  j ( nQ /2)  jX n
e
à

ÌÇ e
2 j ÍÌ n 0
n 0

1 Ë ‡ j[(Q /2)  X ]n ‡

n 0
Û
 Ç e  j[(Q /2)  X ]n Ü
ÝÜ

syE
1 Ë
Ì
2 j Í1  e j [(
1
Q /2)  X ]

1e  j
1
[( Q /2)  X ]
Û
Ü
Ý

Ì
ngi
1 Ë 1  e  j (Q /2) e  jX  1  e j (Q /2) e  jX Û
Ü
2 j ÌÍ 1  e  j 2X  e  jX [ e j (Q /2)  e  j (Q /2) ] ÜÝ

e  jX sin (Q /2)
1  e  j 2X
e  jX
1  e  j 2X nee
(b) Given
È nQ Ø
x(n) = cos É Ù u(n) rin
Î È nQ Ø Þ ‡ Î
Ê 3 Ú

È nQ Ø Þ
Ç Ïcos ÉÊ 3 ÙÚ u(n)ß e jX n
g.n
X (X ) F Ïcos É Ù u(n) ß

Ç
Ð

Ì
Ê 3 Ú à n ‡ Ð

‡ Ë e j ( nQ /3)  e  j ( nQ /3) Û
u(n) Ü e  jX n
à

1 Ë ‡ j[(Q /3)  X ]n
ÌÇ e
‡e Û
 Ç e  j[(Q /3)  X ]n Ü
t
n ‡ Ì
Í 2 ÜÝ 2 ÌÍ n 0 n 0 ÜÝ
1Ë 1 1 Û
Ì j[(Q /3)  X ]
 – j[(Q /3)  X ] Ü
2 Í1  e 1e Ý
1 Ë1 e  j ( Q /3)
e  jX
1 e j ( Q /3) 
e jX Û
Ì Ü
2 ÍÌ 1  e  j 2X  e  jX [ e j (Q /3)  e  j (Q /3) ] ÝÜ

1Ë 2  e  jX Û
Ì Ü
2 ÍÌ 1  e  jX  e  j 2X ÝÜ

www.EasyEngineering.net
 www.EasyEngineering.net

366 | Digital Signal Processing

n
È 1Ø È nQ Ø
(c) Given x(n) = É Ù sin É Ù u( n)
Ê 2Ú Ê 4 Ú

ÑÎÈ 1 Ø ÑÞ
n
È nQ Ø
X (X ) F ÏÉ Ù sin É Ù u(n) ß
Ê Ú Ê 4 Ú
ÐÑ 2 àÑ
‡ ÎÑÈ 1 Ø n È nQ Ø ÞÑ  jX n ‡ È 1Øn È nQ Ø
Ç ÏÉ Ù sin É Ù u(n) ß e Ç É Ù sin É Ù e  jX n
Ê Ú Ê 4 Ú Ê Ú Ê 4 Ú
Ð 2
n ‡ Ñ àÑ n 0 2

‡ È 1 Ø n ÎÑ e j ( nQ / 4)  e  j ( nQ /4) ÞÑ
 jX n
Ç ÉÊ 2 ÙÚ Ï ße

ww n 0

1 Ë ‡
ÌÇ
ÐÑ
n
2j

È 1 Ø j[(Q /4)  X ]n
 Ç
‡
àÑ
È 1 Ø  j[(Q /4)  X ]n Û
n
Ü

w ÉÊ 2 ÙÚ e ÉÊ 2 ÙÚ e
2 j ÍÌ n 0 n 0 ÝÜ

.Ea 1 Ë ‡
ÌÇ
2 j ÍÌ n 0
È 1 j[(Q /4)  X ] Ø
ÉÊ
2
e ÙÚ 
n

Ç
‡ È 1  j[(Q /4)  X ] Ø Û
ÉÊ
2
e
n

ÙÚ Ü
ÝÜ

syE 1 Ë
Ì
1

n 0

1 Û
Ü
2 j Í 1  (1/2) e j[(Q / 4)  X ] 1  (1/2) e  j[(Q /4)  X ] Ý

ngi
(1/2) e  jX sin(Q /4)
1  (1/4) e  j 2X  e  jX cos(Q /4)
(1/2 2 ) e  jX nee
1  (1/ 2) e  jX  (1/4)e  j 2X
rin
g.n
n –2
È 1Ø
(d) Given x(n) = É Ù u( n  2)
Ê 2Ú

X (X ) F{x (n)}

‡ È 1Øn2
n
‡
Ç
ËÈ 1 Ø n  2
ÌÉ Ù
‡ ÌÍ Ê 2 Ú
Û
u(n  2) Ü e  jX n
ÜÝ e t
Ç ÉÊ 2 ÙÚ e jX n
n 2
2
1  j 3X È 1 Ø  j 4X
e  j 2X  e É Ù e "
2 Ê 2Ú
Ë È 1Ø
2 Û
e  j 2X Ì1  e  jX  É Ù e  j 2X  "Ü
1
ÌÍ 2 Ê 2Ú ÜÝ
e  j 2X

1  (1/2) e  jX

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 367

(e) Given x(n) = cos(w0 n) u(n)

‡
X (X ) F{x (n)} Ç {cos(X 0 n) u( n)} e  jX n
n ‡

‡ Ë e jX 0 n  e  jX0 n Û
 jX n
ÇÌ Üe
n 0 Í Ì 2 Ü
Ý
1 ÎÑ ‡ j (X0 –X ) n ‡ ÞÑ
Ï Ç [e ]  Ç [e  j (X 0 X ) ]n ß
2 ÑÐ n 0 n 0 Ñà

ww 1
2
Ë
Ì
ÌÍ 1  e
1
j (X 0 X )

1e 
1 Û
j (X 0 X ) Ü

1 Ë 1  e  j (X 0 X )  1  e j (X 0 X ) Û
ÜÝ

w .Ea
Ì
2 ÍÌ 1  e  j 2X  e  jX (e jX 0  e  jX0 ) ÝÜ

1  e  jX cos X 0
Ü

(f) Given syE 1  2e  jX cos X 0  e  j 2X

x(n) = sin(w0n) u(n)

X (X )
‡
ngi
F{x (n)} Ç {sin (X 0 n) u(n)} e  jX n
n ‡

‡ ÎÑ e jX 0 n  e  jX0 n ÞÑ
ÇÏ
n 0 ÐÑ 2j
ß
àÑ
e nee
 jX n
‡ ÎÑ e j (X 0 X ) n  e  j (X 0 X ) n ÞÑ
ÇÏ
Ñ
n 0 Ð 2j
ß
àÑ
1 Ë
Ì
1

1 Û
Ü rin
2 j ÍÌ 1  e j (X 0 X ) 1  e  j (X 0 X ) ÝÜ

1 Ë 1  e  j (X 0 X )  1  e j (X 0 X ) Û g.n
Ì Ü
2 j ÍÌ 1  e  j 2X  e  jX (e jX 0  e  jX 0 ) ÜÝ

e  jX sin X 0
e t
1  2e  jX cos X 0  e  j 2X

EXAMPLE 5.4 Find the DTFT of the rectangular pulse sequence:

ÑÎ A, n …N
x (n) Ï
ÑÐ0, n !N

ÑÎ A, n …N
Solution: Given x (n) Ï
ÑÐ0, n !N

www.EasyEngineering.net
 www.EasyEngineering.net

368 | Digital Signal Processing

N 1 N
X (X ) Ç Ae  jX n Ç Ae  jX n  Ç Ae jX n
n N n N n 0
N N N 1 N
Ç Ae jX n  Ç Ae  jX n Ae jX Ç e jX n  A Ç e  jX n
n 1 n 0 n 0 n 0

Ë1  ejX N Û Ë1  e  jX ( N  1) Û
Ae jX Ì jX Ü
 AÌ  jX Ü
ÍÌ 1  e ÝÜ ÍÌ 1  e ÝÜ
Ëe  ejX jX ( N 1) Û Ë1  e  jX ( N  1) Û
AÌ jX Ü  AÌ  jX Ü
ÌÍ 1  e ÜÝ ÌÍ 1  e ÜÝ

ww AÌ
Ë e jX  1  e jX ( N 1)  e jX N  1  e jX  e  jX ( N 1)  e  jX N Û
ÍÌ 1  1  e jX  e  jX
Ü
ÝÜ

w .Ea AÌ
Ë (e
ÍÌ
jX N
e  jX N
)  (e
jX
2  (e  e )
Ë 2 cos X N  2 cos X ( N  1) Û
j X ( N  1)

– jX
e  jX ( N 1)
)Û
Ü
ÝÜ

syE = AÌ
Í 2  2 cos X Ü
Ý
Ë 2 sin X [ N  (1/2)] sin(X /2) Û A sin X [ N  (1/2)]

ngi
AÌ Ü
Í 2 sin 2 (X /2) Ý sin(X /2)

5.5 INVERSE DISCRETE-TIME FOURIER TRANSFORM

nee
The process of finding the discrete-time sequence x(n) from its frequency response X(w ) is
called the inverse discrete-time Fourier transform.
Q rin
x (n)
1
2Q Ô
Q
X (X ) e jX n dX
g.n
The integral solution of the above equation for x(n), i.e, for the inverse Fourier transform is
useful for analytic purpose, but it is usually very difficult to evaluate for typical functional
forms of X(w). An alternate and more useful method of determining the values of x(n)
follows directly from the definition of the Fourier transform.
e t
‡
X (X ) Ç x (n) e  jX n "  x ( 2) e j 2X  x ( 1) e jX  x (0)  x (1) e  jX  x (2) e  j 2X  "
n ‡

From the defining equation of X(w ) we can say that, if X(w ) can be expressed as a series of
complex exponentials as shown in the above equation for X(w ), then x(n) is simply the
coefficient of e–jw n. Inverse Fourier transform can be obtained by using the partial fraction
method or by using the convolution theorem.

EXAMPLE 5.5 Determine the signal x(n) for the given Fourier transforms:
(a) X(w) = e–jw for –p £ w £ p (b) X(w) = e–jw (1 + cos w)

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 369

Solution:
(a) Given X(w) = e–jw
Q
1
x ( n) F 1{X (X )} Ôe
 jX
e jX n dX
2Q Q

Q Q
1 1 Ë e jX ( n 1) Û
Ôe
jX ( n 1)
dX Ì j ( n 1) Ü
2Q Q
2Q ÌÍ ÜÝ Q

1 Ë e jQ ( n 1)  e  jQ ( n 1) Û 1 Ë e jQ ( n 1)  e  jQ ( n 1) Û

Ì Ü Ì Ü
2Q Q (n  1)
ww ÌÍ
sin Q (n  1)
Q (n  1)
j(n  1) ÜÝ ÌÍ 2j ÜÝ

w(b) Given
.Ea X (X ) e  jX (1  cos X )
È e jX  e  jX Ø
= e  jX É1 
syE Ê 2

e  jX  0.5  0.5e  j 2X
Ù
Ú

ngi
x (0)  x (1) e  jX  x (2)e  j 2X
Therefore, x(0) = 0.5, x(1) = 1, x(2) = 0.5
x(n) = 0, otherwise nee
i.e. x(n) = {0.5, 1, 0.5}
rin
EXAMPLE 5.6 Obtain the impulse response of the system described by

H (X )
ÑÎ1,
Ï
for X … X0 g.n
Solution: Given H (X )
ÑÐ0,
ÎÑ1,
Ï
for X 0 … X … Q

for X … X0
for X 0 … X … Q
e t
ÑÐ0,
The impulse response h(n) is given by
Q
1
Ô H (X ) e dX
jX n
h( n)
2Q Q
X0 X
1 È e jX n Ø
0
1 jX n
2Q Ô (1) e dX
2Q ÉÊ jn ÙÚ
X 0 X 0

1 È e jX 0 n  e  jX 0 n Ø sin(X 0 n)
2Q ÉÊ jn Ù
Ú Qn

www.EasyEngineering.net
 www.EasyEngineering.net

370 | Digital Signal Processing

EXAMPLE 5.7 Find the inverse Fourier transform of the following:

Î Q 2Q
ÑÑ1, …X …
X (X ) 3 3
Ï
Ñ0, 2Q
… X …Q
ÑÐ 3
Solution: The Fourier transform X(w ) is given. Then, the inverse Fourier transform of X(w )
is given by
Q
1
Ô X (X ) e dX
jX n
x ( n)
2Q Q

ww 1
2Q
Ë Q /3
ÌÍ 2Q /3
2Q /3 Û
Ì Ô 1 e jX n dX  Ô 1 e jX n dX Ü
ÜÝ
1
2Q
Ë È e jX n Ø Q /3 È e jX n Ø 2Q /3 Û
Ì
Ì ÉÊ jn ÙÚ
 É jn Ù
Ê Ú
Ü
Ü

w 1
nQ .Ea
Ì
ÍÌ
Q /3

Ë e  jn(Q /3)  e  jn(2Q /3)  e jn(2Q /3)

2j
Í
 e jn(Q /3) Û
Ü
ÝÜ
2Q /3 Q /3 Ý

1
nQ
Ì
ÍÌ syE
Ë e jn(2Q /3)  e  jn(2Q /3) e jn(Q /3)  e  jn(Q /3) Û
2j

2j
Ü
ÝÜ
1
nQ
Ë
Í
2Q QÛ
Ìsin n 3  sin n 3 Ü
Ý

EXAMPLE 5.8 Find the inverse Fourier transform of

ngi
X (X ) 2  e  jX  3e  j 3X  4e  j 4X

Solution: Given X (X ) nee

2  e  jX  3e  j 3X  4e  j 4X

We know that X (X )
‡
Ç
‡
x (n) e  jX n
rin
n

g.n
= " + x ( 2) e j 2X + x ( 1) e jX + x (0)  x (1) e  jX  x (2) e  j 2X
 x (3) e  j 3X  x (4) e  j 4X  "
Comparing the above two values of X(w), we get
i.e. x (0) 2, x (1) 1, x (2) 0, x (3) 3, x (4) 4
e t
x (n) {2, 1, 0, 3, 4}

5.6 PROPERTIES OF DISCRETE-TIME FOURIER TRANSFORM

5.6.1 Linearity Property

The linearity property of DTFT states that
If F[x1(n)] = X1(w) and F[x2(n)] = X2(w)
Then F[ax1(n) + bx2(n)] = aX1(w) + bX2(w)

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 371

‡
Proof: F{ax1 (n)  bx2 (n)} Ç [ ax1 ( n)  bx2 ( n)] e  jX n
n ‡
‡ ‡
Ç ax1 (n) e  jX n  Ç bx2 (n) e  jX n aX1 (X )  bX2 (X )
n ‡ n ‡

5.6.2 Periodicity Property

The periodicity property of DTFT states that the DTFT X(w) is periodic in w with period 2p,
i.e.
X (X  2 nQ ) X (X )

ww
Implication: We need only one period of X(w) {i.e.,
and not the whole range –¥ < w < ¥.
X ° (0, 2Q ) or ( Q , Q )} for analysis

w
5.6.3 Time Shifting Property

.Ea
The time shifting property of DTFT states that
F [x(n)] = X(w)
If
Then F [x(n – m)] = e syE–jw m
X(w) where m is an integer.
‡
F{x (n  m)} Ç x (n  m) e jX n
Proof:

Let n – m = p
n ‡
ngi
\
\
n=p+m
‡
nee
F{x (n  m)} Ç x ( p) e  jX ( p  m)
p ‡

e  jX m
‡
x ( p) e  jX p
Ç rin
e  jX m X (X )
‡ p

This result shows that the time shifting of a signal by m units does not change its amplitude
spectrum but the phase spectrum is changed by –w m.
g.n
5.6.4 Frequency Shifting Property e t
The frequency shifting property of DTFT states that
If F{x ( n)} X (X )
Then F{x (n) e jX0 n } = X (X  X 0 )
‡
Proof: F{x ( n) e jX 0 n } = Ç {x (n) e jX 0 n } e  jX n
n ‡
‡
Ç x (n) e j (X X0 ) n X (X  X 0 )
n ‡

This property is the dual of the time shifting property.

www.EasyEngineering.net
 www.EasyEngineering.net

372 | Digital Signal Processing

5.6.5 Time Reversal Property

The time reversal property of DTFT states that
If F{x(n)} = X(w)
Then F{x(–n)} = X(ÿ-w)
‡
Proof: F{x (  n)} Ç x (  n) e  jX n
n ‡
‡
Ç x (n) e jX n

ww n –‡

n –‡
‡
Ç x (n) e  j ( X ) n

w .Ea
X ( X )

That is, folding in the time domain corresponds to the folding in the frequency domain.

syE
5.6.6 Differentiation in the Frequency Domain Property

If F{x(n)} = X(w) ngi

The differentiation in the frequency domain property of DTFT states that

Then F{n x (n)} j

d
dX
[ X (X )]
nee
Proof:
‡
F{x (n)} X (X ) Ç x (n) e  jX n
n ‡ rin
Differentiating both sides w.r.t. w, we get
d ÑÎ ‡  jX n ÑÞ
g.n
d
dX
{X (X )} Ï Ç x ( n) e
dX ÐÑ n – ‡
‡
Ç x(n) dX e jX n
d
ß
àÑ e t
n ‡
‡
Ç x(n) ( jn) e jXn
n ‡
ÎÑ ‡ ÞÑ
 j Ï Ç n x (n) e jX n ß
ÐÑ n ‡ àÑ
‡
nx (n) e  jX n
d
\ Ç F{n x (n)} j [ X (X )]
n ‡ dX

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 373

5.6.7 Time Convolution Property

The time convolution property of DTFT states that
If F{x1(n)} = X1(w) and F{x2(n)} = X2(w)
Then F{x1(n) * x2(n)} = X1(w) X2(w)
‡
Proof: x1 (n) x2 (n) Ç x1 (k ) x2 (n  k )
k ‡
‡
\ F{x1 (n) x2 (n)} Ç [ x1 (n) x2 (n)] e  jX n
n ‡

ww ‡ ÎÑ ‡ ÞÑ
Ç Ï Ç [ x1 (k ) x2 (n  k )]ß e jX n
n ‡ Ð Ñ k ‡ àÑ

w .Ea
Interchanging the order of summations, we get
‡ ‡
F{x1 (n) x2 (n)} Ç x1 ( k ) Ç x2 (n  k ) e  jX n

syE
Put n – k = p in the second summation.
\
k ‡

n =p+k
n ‡

‡
ngi‡
F{x1 (n) x2 ( n)} Ç x1 ( k ) Ç x2 ( p) e  jX ( p  k )
k ‡
‡

k ‡
nee
p ‡
‡
Ç x1 (k ) e  jX k Ç x2 ( p) e  jX p
p ‡
X1 (X ) X2 (X )
rin
That is, the convolution of the signals in the time domain is equal to multiplying their
spectra in the frequency domain.
g.n
5.6.8 Frequency Convolution Property
The frequency convolution property of DTFT states that
e t
If F{x1(n)} = X1(w) and F{x2(n)} = X2(w)
Q
1
Then F{x1 (n) x2 ( n)} X1 (X ) X 2 (X ) Ô X1 (R ) X2 (X  R ) dR
2Q Q
‡
Proof: F[x1 (n) x2 (n)] Ç x1 (n) x2 (n) e  jX n
n ‡
‡ Ë 1 Q Û
Ç Ì 2Q Ô X1(R ) e jR n dR Ü e jX n x2 (n)
n ‡ ÌÍ Q ÜÝ

www.EasyEngineering.net
 www.EasyEngineering.net

374 | Digital Signal Processing

Interchanging the order of summation and integration, we get

Q Ë ‡ Û
Ì Ç x 2 ( n ) e  j ( X  R ) n Ü dR
1
F{x1 (n) x2 (n)} Ô
2Q Q
X1 (R )
ÍÌ n ‡ ÝÜ
Q
1
2Q ÔQ
X1 (R ) X 2 (X  R ) dR

This operation is known as periodic convolution because it is the convolution of two periodic
functions X1(w) and X2(w).

ww
5.6.9 The Correlation Theorem
The correlation theorem of DTFT states that
If
w
Then
.Ea
F{x1(n)} = X1(w) and F{x2(n)} = X2(w)
F{Rx1 x2 (l)} X1 (X ) X 2 (  X ) = * x1 x2 (X )

The function * x1 x2 (X ) is called the cross energy spectrum of the signals x1(n) x2(n).
syE
5.6.10 The Modulation Theorem
If F{x(n)} = X(w)ngi
Then F{x ( n) cos X 0 n}
1
2 nee
{X (X  X 0 )  X (X  X 0 )}

Proof: F{x (n) cos X 0 n}

‡
Ç x ( n)
e jX 0 n  e  jX0 n  jX n
e rin
n ‡
1 ÎÑ ‡
Ï Ç
2

 j (X  X 0 ) n 
Ç
‡ g.n ÞÑ
x (n) e  j (X  X 0 ) n ß
2 ÐÑ n ‡
1
2
x ( n) e

{X (X  X 0 )  X (X  X 0 )}
n ‡
e àÑ
t
5.6.11 Parseval’s Theorem
If F{x(n)} = X(w)
‡
Ç x ( n)
2
Then E
n ‡
Q
1
Ô X (X ) dX
2
2Q Q

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 375

‡ ‡
Ç Ç
2
Proof: E x (n) = x (n) x *(n)
n ‡ n ‡
‡ ÎÑ 1 Q ÞÑ
*

Ç x ( n) Ï Ô X (X ) e jX n dX ß
n ‡ ÐÑ 2Q Q àÑ
‡ ÎÑ 1 Q ÞÑ
Ç x(n) Ï 2Q Ô X * (X ) e jXn dX ß
n ‡ ÐÑ Q àÑ
Interchanging the order of summation and integration, we get
Q ÎÑ ‡

ww E
1
Ô
2Q Q
X *
(X
Q
) Ï Ç x ( n) e
ÐÑ n ‡
 jX n ÞÑ dX
ß
àÑ

w .Ea
1
2Q ÔQ
1
Q
X * (X ) X (X ) dX

Ô
2
X (X ) dX

syE 2Q Q

5.6.12 Symmetry Properties

The DTFT X(w) is a complex function of ngi
w and can be expressed as:
X (X ) X R (X )  jX I (X )
nee
where XR(w) is real part and XI (w) is imaginary part of X(w) respectively. We have

X (X )
‡
Ç x (n) e  jX n rin
n

‡
‡
‡ g.n
=
n

X R (X )  jX I (X )
Ç
‡
x (n) cos X n  j

‡
x (n) cos X n  j
n
Ç
‡
x (n) sin X n

‡
x (n) sin X n
e t
i.e. Ç Ç
n ‡ n ‡

Comparing LHS and RHS, we have

‡
X R (X ) Ç x (n) cos X n
n ‡
‡
X I (X )  Ç x (n) sin X n
n ‡

www.EasyEngineering.net
 www.EasyEngineering.net

376 | Digital Signal Processing

Since cos(–w) n = cosw n, and sin(–w) n = – sinw n

‡ ‡
X R ( X ) Ç x ( n) cos( X ) n Ç x (n) cos X n X R (X )
n ‡ n ‡

i.e. X R ( X ) X R (X ) (Even symmetry)

‡ ‡
X I ( X )  Ç x (n) sin ( X ) n Ç x (n) sin X n  X I (X )
n ‡ n ‡

i.e. X I ( X )  X I (X ) (Odd symmetry)

Therefore, XR(w) is an even function of w and XI(w) is an odd function of w.
We can write XR(w) in the polar form as:

ww
where |X(w)| is the magnitude and
X (X ) X (X ) e jR (X )
q (w) is the phase of X(w).
w
Expanding
i.e. .Ea X (X ) X (X ) {cos R (X )  j sin R (X )}
X R (X )  jX I (X ) X (X ) cos R (X )  j X (X ) sin R (X )

syE
Comparing LHS and RHS, we get
X R (X ) X (X ) cos R (X )
X I (X )
X (X )
2 ngi
X (X ) sin R (X )
{X R (X )}2  {X I (X )}2

i.e. X (X ) nee
{X R (X )}2  {X I (X )}2

and tan R (X )
X I (X )
X R (X ) rin
or R (X ) = tan 1
X I (X )
X R (X ) g.n
Similarly, X ( X ) {X R ( X )}2  {X I ( X )}2

X R (X )  X I (X )
2 2
e t
X (X )
Therefore, X(w) is an even function of w,
X I ( X )
R ( X ) tan 1
X R ( X )
 X I (X )
= tan 1
X R (X )
X I (X )
 tan 1 R (X )
X R (X )

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 377

\ R ( X )  R (X )
That is X ( X )  X (X )

Therefore X (X ) is an odd function of w.

TABLE 5.1 Properties of DTFT

Property Sequence DTFT

x(n) X(w)
x1(n) X1(w)

ww
Linearity
x2(n)
ax1(n) + bx2(n)
X2(w)
aX1(w) + bX2(w)
e–jw m X(w)

w
Time shifting
Time reversal
Frequency shifting
.Ea
x(n – m)
x(–n)
x(n)e jw 0n
X(–w0)
X(w – w)

syE
d
Differentiation in frequency domain nx(n) j [ X (X )]
dX
Convolution x1(n) * x2(n) X1(w) X2(w)
X1(w) * X2(w)
Multiplication
Correlation ngi
x1(n) x2(n)
Rx1x2 (l) X1(w) X2(–w)

Modulation theorem x(n) cos


nee w0n 1
2
{X (X  X 0 )  X (X  X 0 )}
Q
Parseval’s theorem 
n  
x ( n)
2 1
2Q 
Q rin
X (X ) dX
2

Symmetry property x*(n)

x*(–n)
X(–w)
X*(w) g.n
xR(n)
jxI (n)
xe(n)
Xe(w)
X0(w)
XR(w)
e t
x0(n) jXI (w)

EXAMPLE 5.9 Using properties of DTFT, find the DTFT of the following:
n 2 n 3
È 1Ø È 1Ø
(a) ÉÊ 4 ÙÚ (b) É Ù u (n  3)
Ê 3Ú
(c) E (n  2)  E ( n  2) (d) u(n  1)  u(n  2)
(e) n2 n u(n) (f) u(  n)
n
(g) n3 u(  n) (h) e3n u( n)

www.EasyEngineering.net
 www.EasyEngineering.net

378 | Digital Signal Processing

Solution:
(a) Using the time shifting property, we have
ÎÑÈ 1 Ø n 2 ÞÑ ÎÑÈ 1 Ø n ÞÑ
F ÏÉ Ù ß e  j 2X F ÏÉ Ù ß
Ê 4Ú Ê 4Ú Ñ
ÐÑ àÑ ÐÑ à
ÎÑÈ 1 Ø n ÞÑ ‡ È 1Ø n
F ÏÉ Ù ß Ç ÉÊ 4 ÙÚ e jX n
ÑÐÊ 4 Ú Ñà n ‡

1 È 1 Ø  n ‡ È 1Øn
 jX n   jX n
Ç Ç
ww n ‡
ÉÊ ÙÚ e
4
‡ È 1Øn
n 0

‡ È 1Øn
ÉÊ ÙÚ e
4

e jX n  Ç É Ù e  jX n
w .Ea
Ç ÉÊ 4 ÙÚ
n 1

1 jX
e
1

Ê Ú
n 0 4

1 15 /16
X 1  (1/4) e  jX (17/16)  (1/2) cos X

syE 1  (1/4) e
4 j

ÎÑÈ 1 Ø n  2 ÞÑ
e  j 2X
15 /16
\ F ÏÉ Ù ß
(17 /16)  (1 / 2) cos X
ÐÑ
Ê 4Ú
àÑ
(b) Using the time shifting property, we have ngi
ÎÑÈ 1 Ø n 3
F ÏÉ Ù
Ê 3Ú
ÞÑ
u( n  3) ß nee
ÎÑÈ 1 Ø n
Ê Ú
ÞÑ
e  j 3X F ÏÉ Ù u(n) ß
ÎÑ
e  j 3X Ï
1
ÑÐ1  (1/3) e
ÞÑ
 jX ß
ÐÑ àÑ
(c) Using the time shifting property, we have
ÐÑ 3 àÑ
rin Ñà

F{E (n  2)  E (n  2)} = F{E (n  2)}  F{E (n  2)}

= e  j 2X F{E (n)}  e j 2X F{E (n)}

g.n
(d) Using the time shifting property, we have
e  j 2X  e j 2X  2 j sin 2X e t
F{u(n  1)  u(n  2)} = F{u( n  1)}  F{u( n  2)}
= e jX F{u(n)}  e j 2X F{u( n)}
e jX e j 2X
= 
1  e  jX 1  e  jX
(e) Using differentiation in the frequency domain property, we have
ÎÑ È 1 Ø n ÞÑ d Ë ÎÑÈ 1 Ø ÞÑÛ
n
F Ï n É Ù u( n) ß j Ì F ÏÉ Ù u(n) ßÜ
ÑÐ Ê 2 Ú Ñà dX Ì ÑÐÊ 2 Ú ÑàÜÝ
Í

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 379

d Ë 1 Û
j Ì  jX Ü
dX Í 1  (1/2) e Ý
 jX
{ [  (1 / 2) e (  j )]} (1 / 2) e  jX
j
{1  (1 / 2) e  jX }2 {1  (1/ 2) e  jX }2
(f) Using the time reversal property, we have
ÑÎ 1 ÑÞ 1
F{u(  n)} = F{u(n)} X X = Ï  jX ß jX
ÑÐ1  e ÑàX X 1  e
(g) Using differentiation in frequency domain and time reversal properties, we have

ww F{n3– n u(  n)} = j
d
dX
[F{3 n u(  n)}]

w .Ea
j
d
dX

d
[F{3n u( n)}]X

Ë 1 Û
X j

jX
d
dX
Ë
Ì
1
Í 1  3e
 [  3e ( j )] 3e jX
Û
 jX Ü
ÝX X

syE j
dX
Ì jX Ü
Í 1  3e Ý
(h) Using the frequency shifting property, we have
j
[1  3e jX ]2 {1  3e jX }2

F{e3n u(n)} F{u(n)} X X  3

ngi
ÑÎ 1 ÑÞ
Ï
ÑÐ1  enee
 jX ß
ÑàX X  3 1 e
1
 j (X  3)

EXAMPLE 5.10 Find the inverse Fourier transform for the first order recursive filter
H(w) = (1 – ae–jw )–1
rin
Solution: Given H (X ) (1  ae  jX ) 1
1 g.n
1  ae  jX
1  ae  jX  a2 e  j 2X  a3e  j 3X  "
Let h(n) be the inverse Fourier transform of H(w).
e t
‡
\ H (X ) Ç h(n) e  jX n "  h( 2) e j 2X  h( 1) e jX  h(0)  h(1) e  jX + h(2) e  j 2X  "
n ‡

On comparing the two expressions for H(w), we can say that the samples of h(n) are the
coefficients of e–jw n.
\ h(n) {1, a, a2 , !, ak , !}

ÎÑ a n , n•0
i.e. h ( n) Ï or h(n) a n u( n)
ÑÐ0, n0

www.EasyEngineering.net
 www.EasyEngineering.net

380 | Digital Signal Processing

EXAMPLE 5.11 Determine the output sequence from the output spectrum:
1 e j 2X  1  e  j 2X
Y (X )
4 1  ae  jX
1 e j 2X  1  e  j 2X
Solution: Given Y (X )
4 1  ae  jX
The output sequence y(n) is the inverse Fourier transform of Y(w).

ÎÑ 1 e j 2X  1  e  j 2X ÞÑ
\ y ( n) F 1 Ï ß
ÐÑ 4 1  ae  jX àÑ

ww 1 Ë 1 ÎÑ e j 2X ÞÑ
ÌF Ï  jX ß  F 1 Î
Ñ
Ï
1
 jX
ÞÑ
ß  F
Î e  j 2X ÑÞÛ
1 Ñ
Ï  jX ßÜ

w .Ea
4 ÌÍ ÑÐ 1  ae

Using the time shifting property, we have

ÎÑ e j 2X ÞÑ Î
1 Ñ 1
Ñà

ÑÞ
ÐÑ1  ae àÑ ÑÐ1  ae ÑàÜÝ

F 1 Ï a n  2 u(n  2)

Also, we know that

syE
ÐÑ1  ae
 jX ß
àÑ
= F Ï
ÐÑ1  ae
 jX ß
àÑ n n 2
= a n u( n)
n n 2

ÎÑ
F 1 Ï
1
ÐÑ1  ae
ngi
ÞÑ
 jX ß
àÑ
a n u( n)

Using the time shifting property, we have nee

ÑÎ e  j 2X ÑÞ
F 1 Ï
ÑÐ1  ae
 jX ß
Ñà
ÑÎ
F 1 Ï
1
ÑÐ1  ae
ÑÞ
 jX ß
Ñà n rin
a n  2 u(n  2)

\ y ( n)
1 n2
n 2

{a u(n  2)  a n u(n)  a n  2 u(n  2)} g.n

4
EXAMPLE 5.12 The impulse response of a LTI system is h(n) = {1, 2, 1, –2}. Find the
response of the system for the input x(n) = {1, 3, 2, 1}.
e t
Solution: The response of the system y(n) for an input x(n) and impulse response h(n) is
given by
y(n) = x(n) * h(n)
Using the convolution property of Fourier transform, we get
Y (X ) X (X ) H (X )
\ y ( n) F 1{X (X ) H (X )}
Given x(n) = {1, 3, 2, 1}

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 381

\ X (X ) 1  3e  jX  2e  j 2X  e  j 3X
Given h(n) = {1, 2, 1, –2}

\ H (X ) 1  2e  jX  e  j 2X  2e  j 3X

Y(w) = X (X ) H (X ) (1  3e  jX  2e  j 2X  e  j 3X )(1  2e  jX  e  j 2X  2e  j 3X )
1  5e  jX  9e  j 2X  6e  j 3X  2e  j 4X  3e  j 5X  2e  j 6X
Taking inverse Fourier transform on both sides, we get
y(n) 1  5E (n  1)  9E ( n  2)  6E (n  3)  2E (n  4)  3E (n  5)  2E (n  6)

ww
or y(n) {1, 5, 9, 6,  2,  3,  2}

w
EXAMPLE 5.13 Find the convolution of the signals given below using Fourier transform:

.Ea
n
È 1Ø
x1 (n) ÉÊ 2 ÙÚ u(n)

syE x 2 ( n)
È 1Ø
n

ÉÊ 3 ÙÚ u(n)

Solution: Given x1 (n)

ngi
È 1Ø
n

ÉÊ 2 ÙÚ u(n)

\ X1 (X ) nee 1
1  (1 / 2) e  jX

È 1Ø
n
rin
x 2 ( n) ÉÊ 3 ÙÚ u(n)
g.n
e
1
\ X2 (X )
1  (1/ 3) e jX
Using the convolution property of Fourier transform, we get
F[ x1 (n) x2 (n)] X1 (X ) X 2 (X )
t
Ë 1 ÛË 1 Û
Ì  jX Ü Ì  jX Ü
Í 1  (1/ 2) e Ý Í 1  (1/ 3) e Ý
ÎÑ Ë 1 ÛË 1 Û ÞÑ
\ x1 ( n) x2 (n) F 1 Ï Ì  jX Ü Ì  jX Üß
ÐÑ Í 1  (1 / 2)e Ý Í 1  (1 / 3)e Ý àÑ

È 1 ØÈ 1 Ø Ë e jX ÛË e jX Û
Let X (X ) É Ù Ì jX Ü Ì jX Ü
Ê 1  (1 / 2)e  jX Ú Ê 1  (1/ 3)e  jX ÙÚ
É
ÍÌ e  (1 / 2) ÝÜ ÍÌ e  (1/ 3) ÝÜ

www.EasyEngineering.net
 www.EasyEngineering.net

382 | Digital Signal Processing

X (X ) e jX
\
e jX [e jX  (1 / 2)] [ e jX  (1/ 3)]
A B 3 2
jX
 jX jX
 jX
e  (1 / 2) e  (1/ 3) e  (1/ 2) e  (1 / 3)

3e jX 2e jX
\ X (X ) 
e jX  (1/ 2) e jX  (1/ 3)
1 1
3  jX
2
1  (1 / 2)e 1  (1 / 3)e  jX

ww
Taking inverse Fourier transform on both sides, we have

È 1Ø
n
È 1Ø
n

w
EXAMPLE 5.14 .Ea
x ( n)

Consider
x1 (n) x2 (n)

a
3 É Ù u(n)  2 É Ù u( n)

discrete-time
Ê 2Ú Ê 3Ú

LTI system with impulse response

h ( n)
È 1Ø
n

ÉÊ 2 ÙÚ u(n). syE
Use Fourier transform to determine the response to the signal

x (n)
È 3Ø
n

ÉÊ 4 ÙÚ u(n).
ngi
nee
Solution: Given the impulse response h(n) and the input x(n) to the system, the response
y(n) is given by
y ( n) x ( n) h ( n)
Using the convolution property of Fourier transform, we have rin
y( n) x ( n) h ( n) F [ X (X ) H (X )]
1

where X(w) and H(w) are the Fourier transforms of x(n) and h(n), respectively.
g.n
x ( n)
È 3Ø
n

ÉÊ 4 ÙÚ u(n)
e t
1
\ X (X )
1  (3 / 4) e  jX
n
È 1Ø
h ( n) ÉÊ 2 ÙÚ u( n)

1
\ H (X )
1  (1 / 2) e  jX

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 383

Ë 1 ÛË 1 Û
\ Y(w) = X (X ) H (X ) Ì  jX Ü Ì  jX Ü
Í 1  (3 / 4) e Ý Í 1  (1/ 2) e Ý
Ë e jX ÛË e jX Û
Ì jX Ü Ì jX Ü
ÍÌ e  (3 / 4) ÝÜ ÍÌ e  (1 / 2) ÝÜ

Y (X ) e jX
\
e jX [ e jX  (3 / 4)] [ e jX  (1/ 2)]
A B 3 2
jX
 jX jX
 jX
e  (3 / 4) e  (1/ 2) e  (3 / 4) e  (1/ 2)

ww
\ Y (X ) jX
3e jX
 jX
2e jX 3
 jX

2
1  (1/ 2) e  jX
w .Ea
e  (3 / 4) e  (1/ 2)

Taking inverse Fourier transform on both sides, we get the response

n
1  (3 / 4) e

n
È 3Ø È 1Ø

syE y ( n) 3 É Ù u( n)  2 É Ù u( n)
Ê 4Ú Ê 2Ú

5.7 TRANSFER FUNCTION

ngi
If X(w) is the Fourier transform of the input signal x(n), and Y(w) is the Fourier transform of

H (X )
nee
the output signal y(n), then H(w), the transfer function of the system is given by
Y (X )
X (X )
rin
i.e. the transfer function of an LTI system is defined as the ratio of the Fourier transform of
the output to the Fourier transform of the input. It is also defined as the Fourier transform of
g.n
e
the impulse response h(n) of the system. It can be obtained as follows:
If the input to the system is of the form e jw n, then the output y(n) is given by
‡
y(n) h(n) x (n) Ç h( k ) e jX ( n  k ) e jX n H (X )
k ‡
t
i.e. y(n) = x(n) H(w)
Q
X (X ) e jX n dX
1
2Q ÔQ
We have x ( n)

Q Q
X (X ) e jX n dX H (X ) X (X ) H (X ) e jX n dX
1 1
2Q ÔQ 2Q ÔQ
y ( n)

www.EasyEngineering.net
 www.EasyEngineering.net

384 | Digital Signal Processing

y(n) in terms of Y(w) is given by

Q
Y (X ) e jX n dX
1
2Q ÔQ
y ( n)

Comparing the above two expressions for y(n), we get

Y(w) = X(w) H(w)

Y (X )
\ H (X )
X (X )
where H(w) is known as the transfer function of the system.

ww
5.8 FREQUENCY RESPONSE OF DISCRETE-TIME SYSTEMS

w .Ea
The frequency response of a linear time-invariant discrete-time system can be obtained by
applying a spectrum of input sinusoids to the system. The frequency response gives the gain
and phase response of the system to the input sinusoids at all frequencies.

syE
Let h(n) be the impulse response of an LTI discrete system, and let the input x(n) to the
system be a complex exponential e jw n.
The output of the system y(n) can be obtained by using convolution sum.
‡
ngi
y(n) h(n) x ( n) Ç h(k ) x (n  k )

For x(n) = e jw n,
‡
k ‡

nee
h(k ) e jX ( n  k )
Ç
rin
y ( n)
k ‡
‡
e jX n h(k ) e  jX k

jX n
k
Ç
‡
(X )
g.n
eN
Input
H
N
Frequency response
e
That is, if we force the system with a complex exponential e jw n, then the output is of the
form H(w)e jw n. Therefore, the output of the system is identical to the input modified in
t
amplitude and phase by H(w). The quantity H(w) is the frequency response of the system.
It is same as the transfer function H(w) in the frequency domain. The frequency
response H(w) is complex and can be expressed in the polar form as:

H (X ) H (X ) e j ²H (X )
where the magnitude of H(w), i.e. |H(w)| is called the magnitude response and phase angle of
H(w), i.e. ÐH(w) is called the phase response. The plot of |H(w)| versus w is called the
magnitude response plot and the plot of ÐH(w) versus w is called the phase response plot.

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 385

Properties of frequency response

Frequency response is a complex function that describes the magnitude and phase shift of a
filter over a range of frequencies. If h(n) is a real sequence, the frequency response H(w) has
the following properties:
1. H(w) takes on values for all w, i.e. on a continuum of w.
2. H(w) is periodic in w, with period of 2p.
3. The magnitude response |H(w)| is an even function of w and symmetrical about p.
4. The phase response ÐH(w) is an odd function of w and antisymmetrical about p.

EXAMPLE 5.15 Write a difference equation that characterizes a system whose frequency

ww
response is:

H (X )
1  e  jX  3e  j 2X
1  (1/ 3) e  jX  (1/ 6) e  j 2X

w
Solution:
.Ea
Given H (X )
Y (X )
X (X )
1  e  jX  3e  j 2X
1  (1/ 3) e  jX  (1/ 6) e  j 2X

1
3
syE
On cross multiplication, we get

Y (X )  e  jX Y (X )  e  j 2X Y (X ) X (X )  e  jX X (X )  3e  j 2X X (X )
1
6

1 1 ngi
Taking inverse Fourier transform on both sides, we get the difference equation:

3 6
nee
y(n)  y(n  1)  y(n  2) x (n)  x (n  1)  3x (n  2)

EXAMPLE 5.16

(a)
Find the frequency response of the following causal systems:

y(n)  y(n  1) 
3 1
y(n  2) x (n)  x (n  1) rin
(b)
1
16
3
2
y(n)  y( n  1)  y(n  2) x ( n)  x (n  1) g.n
e
4 8
Solution: The frequency response of a system is given by H(w) = [Y(w)/X(w)], where Y(w)
and X(w) are the Fourier transforms of output and input signals respectively.

(a) Given y(n)  y(n  1) 

3 1
y(n  2) x (n)  x (n  1)
t
16 2
Taking Fourier transform on both sides, we have

Y (X )  e  jX Y (X ) 
3  j 2X
Y (X ) X (X )  e  jX X (X )
1
e
16 2
È Ø È Ø
Y (X ) É 1  e  jX  e  j 2X Ù X (X ) É 1  e  jX Ù
3 1
i.e.
Ê 16 Ú Ê 2 Ú
Y (X ) 1  (1/ 2) e  jX e jX [e jX  (1 / 2)]
\ H (X )
X (X ) 1  e  jX  (3 /16) e  j 2X e j 2X  e jX  (3 /16)

www.EasyEngineering.net
 www.EasyEngineering.net

386 | Digital Signal Processing

1 3
(b) Given y ( n) y( n  1)  y(n  2) x ( n)  x (n  1)
4 8
Taking Fourier transform on both sides, we have

Y (X )  e  jX Y (X )  e  j 2X Y (X ) X (X )  e  jX X (X )
1 3
4 8
È Ø
Y (X ) É1  e  jX  e  j 2X Ù X (X ) (1  e  jX )
1 3
i.e.
Ê 4 8 Ú
Y (X ) 1  e  jX e jX (e jX  1)
\ H (X )
X (X ) 1  (1/ 4) e  jX  (3 / 8) e  j 2X e j 2X  (1 / 4) e jX  (3 / 8)

ww
EXAMPLE 5.17 A discrete system is given by the following difference equation:

w .Ea
y(n)  5 y(n  1) x (n)  4 x (n  1)
where x(n) is the input and y(n) is the output. Determine its magnitude and phase response.
Solution: Given y(n)  5 y(n  1) x (n)  4 x (n  1)

syE
Taking Fourier transform on both sides, we have
Y (X )  5e  jX Y (X ) X (X )  4e  jX X (X )
i.e.
ngi
Y (X ) {1  5e  jX } X (X ) {1  4e  jX }

Y (X )
X (X )
H (X )
1  5e  jX
nee
The transfer function of the system, i.e. the frequency response of the system is:
1  4 e  jX e jX  4
e jX  5
cos X  j sin X  4 rin
cos X  j sin X  5
The magnitude response of the system is: g.n
H (X )
(4  cos X )2  (sin X )2
(cos X  5)2  (sin X )2
17  8 co s X
26  10 cos X
e t
The phase response of the system is:
Î sin X Þ 1 Î sin X Þ
H (X ) tan 1 Ï ß  tan Ï ß
Ð 4  cos X à Ð cos X  5 à

EXAMPLE 5.18 The output y(n) for a linear shift-invariant system, with input x(n) is
given by
y ( n) x (n)  2 x (n  1)  x (n  2)
Determine the magnitude and phase response of the system.

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 387

Solution: Given y ( n) x (n)  2 x (n  1)  x (n  2)

Taking Fourier transform on both sides, we have
Y (X ) X (X )  2e  jX X (X )  e  j 2X X (X )
The transfer function of the system, i.e. the frequency response of the system is:
Y (X )
H (X ) 1  2e  jX  e  j 2X
X (X )
1  2[cos X  j sin X ]  cos 2X  j sin 2X
[1  2 cos X  cos 2X ]  j[2sin X  sin 2X ]

ww
The magnitude response of the system is:

H (X ) [1  2 cos X  cos 2X ]2  [2 sin X  sin 2X ]2

w .Ea
The phase response of the system is given as:

H (X )
Î 2 sin X  sin 2X Þ
tan 1 Ï ß

EXAMPLE 5.19
syE Ð1  2 cos X  cos 2X à

The impulse response of a system is:

h(n)
ÎÑ1
Ï
ÑÐ0
ngi
for 0 … n … N  1

nee
otherwise
Find the transfer function, frequency response, magnitude response and phase response.
Solution: The transfer function H(w) is obtained by taking the Fourier transform of h(n).
‡ N 1
H (X ) Ç h(n) e  jX n Ç (1) e  jX n
rin
\
n ‡
 jX N
n 0
g.n
1e
1  e  jX
The frequency response of the system is same as the transfer function, i.e.
e t
1  e  jX N
H (X )
1  e  jX
The magnitude function is given as:
H (X ) {H (X ) H * (X )}1/2

ÎÑË 1  e  jX N Û Ë 1  e jX N
1/2
Û ÞÑ
ÏÌ  jX Ü Ì jX Üß
ÐÑÌÍ 1  e ÜÝ ÌÍ 1  e ÜÝ àÑ

www.EasyEngineering.net
 www.EasyEngineering.net

388 | Digital Signal Processing

jX N
 e  jX N ÑÞ
1/2
ÑÎ1  1  e
Ï jX  jX ß
ÑÐ 1  1  e  e Ñà

ÎÑ 2  (e jX N  e  jX N ) ÞÑ Î1  cos X N Þ
1/2 1/2

Ï ß Ï ß
Ð 1  cos X à
jX  jX
ÑÐ 2  (e  e ) Ñà

In order to determine the phase function, the real and imaginary parts of H(w) have to be
separated.
1  e  jX N 1  e jX 1  e jX  e  jX N  e  jX ( N  1)
\ H (X ) –
1  e  jX 1  e jX 2  (e jX  e  jX )
ww 1  (cos X  j sin X )  (cos X N  j sin X N )  [cos X ( N  1)  j sin X ( N  1)]
2  2 cos X

w
Now,
.Ea H R (X )
1  cos X  cos X N  cos X ( N  1)
2  2 cos X
 sin X  sin X N  sin X ( N  1)

syE H I (X )

H (X )
2  2 cos X
H I (X )
\ tan 1
ngi
H R (X )
Î  sin X  sin X N  sin X ( N  1) Þ
tan 1 Ï
nee ß
Ð1  cos X  cos X N  cos X ( N  1) à

EXAMPLE 5.20 The impulse response of a LTI system is given by h(n). Find the
frequency response, magnitude and phase response. rin
Solution: Given h(n) = 0.6 u(n)n
g.n
The frequency response of the system is:

H (X ) = F{0.6 n u(n)}
1
1  0.6e  jX
e t
Here H(w) is a complex function of frequency. To separate the real and imaginary parts of
H(w), multiply the numerator and denominator by the complex conjugate of the denominator.
Thus,
1 1  0.6e jX 1  0.6e jX
H (X ) –
1  0.6e  jX 1  0.6e jX 1  0.6e jX  0.6e  jX  0.36
1  0.6 cos X 0.6 sin X
j
1.36  1.2 cos X 1.36  1.2 cos X
1  0.6 cos X 0.6 sin X
\ H R (X ) and H I (X )
1.36  1.2 cos X 1.36  1.2 cos X

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 389

The magnitude function of H(w ) is:

H (X ) {H R (X )2  H I (X )2 }1/2
1/2
ÎÑ Ë 1  0.6 cos X Û2 Ë 0.6 sin X Û 2 ÞÑ
ÏÌ Ü Ì Ü ß
1.36  1.2 cos X Ý Í 1.36  1.2 cos X Ý Ñ
ÐÑ Í à
1
(1.36  1.2 cos X )1/2
The phase function of H(w ) is:
H I (X ) Î  0.6 sin X Þ

ww H (X ) tan 1
H R (X )
The magnitude function |H(w )| can be obtained as follows:
tan 1 Ï ß
Ð1  0.6 cos X à

w H (X ) {H (X ) H * (X )}1/2 {H (X ) H ( X )}1/2

.Ea
È 1 1 Ø
1/2
Ë 1 Û
1/2

–
É

syE
Ê 1  0.6e  jX

1
jX Ù
1  0.6e Ú

(1.36  1.2 cos X )1/2

Ì jX  jX Ü
Í 1  0.36  0.6 (e  e ) Ý

ngi
nee
EXAMPLE 5.21 A causal LTI system is described by the difference equation:
y(n)  ay (n  1) bx (n)  x ( n  1)
where a is real and less than 1 in magnitude. Find a value of b(b ¹ a) such that the
frequency response of the system satisfies |H(w)| = 1 for all w (an all pass system, the
magnitude of the frequency response is constant independent of frequency). rin
Solution: Given y(n)  ay (n  1) bx (n)  x ( n  1)
g.n
Taking Fourier transform on both sides, we have
Y (X ) [1  ae  jX ] X (X ) [b  e  jX ]

Y (X ) b  e  jX b  cos X  j sin X
e t
\ H (X )
X (X ) 1  ae  jX 1  a cos X  ja sin X

(b  cos X )2  sin 2 X 1  b2  2b cos X

H (X )
2

(1  a cos X )2  a 2 sin 2 X 1  a2  2 a cos X

For magnitude to be independent of frequency,
d
H (X ) 2
0
dX

www.EasyEngineering.net
 www.EasyEngineering.net

390 | Digital Signal Processing

d È 1  b2  2b cos X Ø
i.e. 0
dX ÉÊ 1  a2  2a cos X ÙÚ
Simplifying, we get b = 1/a.

EXAMPLE 5.22 A causal and stable LTI system has the property that
n n
È 4Ø È 4Ø
ÉÊ 5 ÙÚ u(n)   
 n É Ù u( n)
Ê 5Ú
(a) Determine the frequency response H(w) for the system.
(b) Determine a difference equation relating any input x(n) and the corresponding

ww output y(n).
È 4Ø
n

\
w
Solution: Given

.Ea
x ( n)

X (X )
ÉÊ 5 ÙÚ u(n)
1
1  (4 / 5) e  jX

syE y ( n)
È 4Ø
n
n É Ù u( n)
Ê 5Ú
(4 / 5) e  jX
\ Y (X ) j
d
dX
[ X (X )]
ngi [1  (4 / 5) e  jX ]2

\ Y (X )
(4 / 5) e  jX
1
nee
[1  (4 / 5) e  jX ] [1  (4 / 5) e  jX ]
(4 / 5) e  jX
[1  (4 / 5) e  jX ]
X (X )

Therefore, the frequency response is:

Y (X ) (4 / 5) e  jX rin
H (X )
X (X ) [1  (4 / 5) e  jX ]
g.n
Cross multiplying, we get

Y (X ) 
4  jX
5
e Y (X )
4  jX
5
e X (X ) e t
Taking inverse Fourier transform, we get the difference equation:
4 4
y(n)  y(n  1) x (n  1)
5 5

EXAMPLE 5.23 Determine the impulse response of all the four types of ideal filters
shown in Figure 5.1.
Solution:
(a) For an ideal low-pass filter shown in Figure 5.1(a),
ÎÑ1, for 0 … X … Xc
H (X ) Ï
ÑÐ0, otherwise

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 391

ww
w
Figure 5.1
.Ea
Frequency response of ideal filters, (a) low-pass filter, (b) high-pass filter, (c) band pass
filter, and (d) band stop filter.

syE 1
Q

2Q ÔQ
H (X ) e jX n dX
We have h( n)

X
1 c jX n
ngi e jX c n  e  jX c n sin X c n

sin X c n
2Q XÔ
c
e d X
nee Q n(2 j) Qn

i.e. h( n)
Qn
‡ … n … ‡
rin
(b) For an ideal high-pass filter shown in Figure 5.1(b),
ÎÑ0, for 0 … X … Xc g.n
H (X )

1
Q
Ï
ÑÐ1, for X c … X … Q

H (X ) e jX n dX
e t
2Q ÔQ
We have h( n)

X Q
1 Ë c jX n Û
Ì Ô e dX  Ô e jX n dX Ü
2Q Ì Q Xc Ü
Í Ý
[ e  jX c n  e  jQ n  e jQ n  e jX c n ]
1
2Q jn

1 Ë È e jQ n  e  jQ n Ø È e jX c n  e  jX c n Ø Û
Ì
Q n ÌÍ ÉÊ Ù É ÙÜ
2j Ú Ê 2j Ú ÜÝ

www.EasyEngineering.net
 www.EasyEngineering.net

392 | Digital Signal Processing

1
[sin Q n  sin X c n]
Qn
sin X c n

Qn
sin X c n
i.e. h(n)  ‡ … n … ‡
Qn
(c) For an ideal band pass filter shown in Figure 5.1(c),

ÎÑ1, for X c1 … X … X c2
H (X )

ww Q
Ï
ÑÐ0, otherwise

w We have h( n)

.Ea
1
2Q

1
Ô H (X ) e
Q

È Xc1
jX n

Xc 2
dX

Ø
É Ô e dX  Ô e dX Ù
jX n jX n

syE 2Q

1
ÉÊ X
c2 X c1 ÚÙ

2Q jn
ngi
[e  jX c1n  e  jX c 2 n  e jX c 2 n  e jX c1n ]

1
Qn
ÌÉ
ÌÍ Ê 2j
nee
Ë È e jXc 2 n  e  jX c 2 n Ø È e jXc1n  e  jX c1n Ø Û
Ù É
Ú Ê 2j ÙÜ
Ú ÜÝ
1
Qn
[sin X c 2 n  sin X c1n]
rin
i.e. h(n)
sin X c2 n  sin X c1n
‡ … n … ‡ g.n
Qn
(d) For an ideal band stop filter shown in Figure 5.1(d),

ÑÎ1, for X … X c1 and X c 2 … X … Q

e t
H (X ) Ï
ÑÐ0, for X c1 … X … X c 2

Q
H (X ) e jX n dX
1
2Q ÔQ
We have h(n)

È X c 2 X c1 Q Ø
É Ô e jX n dX  Ô e jX n dX  Ô e jX n dX Ù
1
2Q ÉÊ Q X c1 Xc2 ÙÚ

www.EasyEngineering.net
 www.EasyEngineering.net

Discrete-time Fourier Transform | 393

[e  jX c 2 n  e  jQ n  e jX c1n  e  jX c1n  e jQ n  e jX c 2 n ]
1
2Q jn
1 Ë È e jX c 2 n  e  jX c 2 n Ø È e jX c1n  e  jX c1n Ø È e jQ n  e  jQ n Ø Û
Ì É Ù É Ù É ÙÜ
Qn ÌÍ Ê 2j Ú Ê 2j Ú Ê 2j Ú ÜÝ
1
[sin X c1n  sin X c 2 n]
Qn
sin X c1n  sin X c 2 n
i.e. h( n) ‡ … n … ‡
Qn

ww
SHORT QUESTIONS WITH ANSWERS

w
1. Define Fourier transform of a discrete-time signal.

.Ea
Ans. The Fourier transform of a discrete-time signal x(n) is defined as:
‡
F{x (n)} X (X ) Ç x (n) e  jX n

syE n ‡
‡
The Fourier transform exists only if Ç x (n)  ‡, i.e. only if the sequence is

absolutely summable.
n ‡

ngi
2. Define inverse discrete-time Fourier transform.

nee
Ans. The inverse discrete-time Fourier transform of X(w) is defined as:
Q
F 1{X (X )}
1
2Q ÔQ
X (X ) e jX n dX
x ( n)
rin
3. Why the Fourier transform of a discrete-time signal is called signal spectrum?
Ans. By taking Fourier transform of a discrete-time signal x(n) it is decomposed g.n
into its frequency components. Hence the Fourier transform is called signal spectrum.
4. List the differences between Fourier transform of discrete-time signal and analog signal.
Ans.
e t
1. The Fourier transform of analog signal consists of a spectrum with frequency
range – ¥ to ¥, but the Fourier transform of a discrete-time signal is unique in
the range – p to p (or 0 to 2p), and also it is periodic with periodicity of 2p.
2. The Fourier transform of analog signal involves integration, but Fourier
transform of discrete-time signal involves summation.
5. Give some applications of discrete-time Fourier transform.
Ans. Some applications of discrete-time Fourier transform are:
1. The frequency response of LTI system is given by the Fourier transform of the
impulse response of the system.

www.EasyEngineering.net