Signals & Systems

6
6.1. Introduction
DTFT

Important Table:
Time domain Frequency domain
Continuous Non Periodic
Discrete Periodic
Periodic Discrete
Non Periodic Continuous

Transform Time domain Frequency domain

C.T.F.S C+P Discrete + Np

C.T.F.T C + Np C + Np
DTFS D+p D+p
DTFT D + Np C+p

X (e j ) =  x(n)e− jn well defined DTFT, calculates from B.Z.T at unity circle
n −

• For well defined DTFT to converge x( n) must be absolutely summable.

For well defined DTFT

(a) Includes all energy signal .
(b) Formula of DTFT applicable
(c) Properties of DTFT applicable .

(d) X (e j ) will be defined for each and every value of .

Limitedly defined DTFT

(a) Includes all power signal
(b) Formula not applicable .
(c) properties applicable.

(d) X (e j ) will be ⎯⎯
→ for any one value of .

GATE WALLAH ELECTRONICS & COMMUNICATION HANDBOOK 3.61

 Signals & Systems

Note: X (e j ) is periodic with −     ,


1
 X (e )e jn d
j
x(n) =
2 −

1
a nu (n) ⎯
→ When a  1
1 − ae− j

1
X (e j ) ⎯
→ periodic with 2
1 − ae− j

DTFT of signals

sin c n DTFT
➢ x(n) = ⎯⎯→
n

Only valid when c  

 sin c n 
2

➢ x(n) =  
 n 


c 
2
Properties of DTFT :
(1) → Ax1 (e j ) + BX 2 (e j )
Linearity - Ax1 (n) + Bx2 (n) ⎯

(2) Time shifting → e− jno X (e j )

x(n − n0 ) ⎯

→ e jno X (e j )
x(n + n0 ) ⎯

GATE WALLAH ELECTRONICS & COMMUNICATION HANDBOOK 3.62

 Signals & Systems

(3) Frequency shifting

e jo n x(n) ⎯
→ X (e j ( −o ) )

e− jo n x(n) ⎯
→ X (e j ( +o ) )

cos o n ⎯
→ [ ( − o ) +  ( + o )] −     


sin o n ⎯
→
j
 ( − o ) −  ( + o ) −     

(−1)n x(n) = e j n x(n) ⎯

→ x(e j ( − ) ) ⎯
→ X (−e j )

(4) → x(e− j ) = X (e j )*
Time Reversal - x(−n) ⎯ ( )
(5) ( )
→ X * (e j ) * = X * (e− j )
Complex conjugate - x *(n) ⎯

x(n) X(ej)
E E
O O
NENO NENO

x(n) X(ej)
R+E R+E
R+O I+O
I+E I+E
I+O R+O

x(n) X(ej)
Real C.S
I C.A.S
C.S Real
C.A.S I
n
→ X (e jK )
(1) Time Expansion - x   ⎯
K 
1st difference or successive difference –

→(1 − e− j ) X (e j )
x(n) − x(n − 1) ⎯

1
u(n) ⎯⎯
DTFT
→ () + −    
(1 − e− j )

or

1
  ( − 2 K ) + (1 − e
K =−
− j
)

GATE WALLAH ELECTRONICS & COMMUNICATION HANDBOOK 3.63

 Signals & Systems

d
Multiplication with n - nx(n) ⎯
→+ j X (e j )
d

→ y(e j ) = X (e j ) H (e j )
Convolution - y(n) = x(n)  h(n) ⎯

6.1.1. Parseval Energy Theorem

 
1
(1)  x(n)h(n) = 2  X (e  )H (e
n =−
j − j
)d 
 −

 
1
(2)  x(n)h (n) = 2  X (e  )H
n =−
* j *
(e j )d
 −

 
1
(3)  x(n) x(n) = 2  X (e  ) X (e
n =−
j − j
)d 
 −

 
1
 x(n) x (n) = 2  X (e  )
2
(4) * j
d
n =−  −



GATE WALLAH ELECTRONICS & COMMUNICATION HANDBOOK 3.64