1

ECT 303 DIGITAL SIGNAL

PROCESSING

MODULE 1-PART II

Ms. Neethu Radha Gopan, Asst. Professor, Dept. of ECE, RSET

 Circular Symmetries of a Sequence
2

Circular shift of a N point sequence is equivalent to a linear shift of its periodic

extension and vice versa.
3
𝑥( 𝑛 − 2 )4 = {3,4,1,2}
 Q. Let x(n) ={1,2,3,4}. Find a) 𝑥((𝑛 − 1))4 b) 𝑥((𝑛 − 6))4
c) 𝑥((𝑛 + 3))4 d) 𝑥((𝑛 + 7))4
4
2 1
𝑥((𝑛 − 6))4 =𝑥((𝑛 − 2))4
4
3 x(n) 1 2 𝑥((𝑛 − 1))4 4

1 3
4 3
𝑥((𝑛 − 1))4 ={4,1,2,3}
1
2
𝑥((𝑛 − 6))4 ={3,4,1,2}
2 𝑥((𝑛 + 3))4 4

3 𝑥((𝑛 + 3))4 ={4,1,2,3}=𝑥((𝑛 + 7))4

 ➢ The Time Reversal of an N point sequence is attained by reversing its
samples about the point zero on the circle. Thus the sequence x((−n)) N is
given as:
x((− n)) N = x( N − n) 0  n  N − 1

➢ Time Reversal is equivalent to plotting x(n) in the clockwise direction

on a circle.
Eg: x(n)= {2,4,3,1}. Find 𝑥( −𝑛 )4 .
N=4. From Equation, From figure
Time reversed signal is
x(-0) = x(0)=2 𝑥( −𝑛 )4 = {2, 1, 3, 4}
x(-1) = x(4-1) = x(3)=1
x(-2) = x(4-2) = x(2)=3
x(-3) = x(4-3) = x(1)=4
𝑥( −𝑛 )4 ={2,1,3,4}
5
 ➢ An N-point sequence is called circularly even if it is symmetric about the
point zero on the circle.

i.e. , x ( N − n) = x ( n ) 1  n  N − 1
➢ An N-point sequence is called circularly odd if it is anti-symmetric about the
point zero on the circle.

i.e. , x ( N − n) = − x ( n) 1  n  N − 1

Eg: for circularly even x(n)={3,0,5,4,1,4,5,0}

N=8 , n=1, x(8-1) = x(7) = x(1)
n=2, x(8-2) = x(6) = x(2)
n=3, x(8-3) = x(5) = x(3)

6
7 Properties of Discrete Fourier Transform (DFT)

1) Periodicity 6) Circular Convolution

2) Linearity 7) Circular Correlation
3) Time Reversal 8) Multiplication of two sequences
4) Circular Time Shifting 9) Complex Conjugate Property
5) Circular Frequency Shifting 10) Parseval’s Theorem and Identity
 Properties of DFT
8

1. Periodicity Property
Let X(k) be the N-point DFT of a finite duration sequence x(n),ie, DFT{x(n)}=X(k)
then, x ( n + N ) = x ( n) for all n
Proof: X (k + N ) = X (k ) for all k
N −1 2k
−j n
X (k ) =  x( n)e N
n =0
N −1 2 2k 2N
− j (k + N ) n N −1 −j n −j n
X (k + N ) = x( n) e N = 
x( n) e N .e N
n =0 n =0
N −1 2k N −1 2k
−j n −j n
=  x( n) e N (cos 2n − j sin 2n) =
 x( n) e N = X (k )
n =0 n =0
 2. Linearity Property
9

Let 𝑋1 (𝑘) and 𝑋2 (𝑘) be the N point DFT’s of 𝑥1 (𝑛) and 𝑥2 (𝑛) respectively, then
a x1 (n) + bx2 (n) ⎯⎯→ a X 1 (k ) + b X 2 (k )
DFT

where a and b are real/complex valued constants.

Proof:
N −1 2k
−j n
DFT {x(n)} = X (k ) =  x( n)e N
n =0 𝑁−1
2𝜋𝑘
−𝑗 𝑁 𝑛
𝐷𝐹𝑇 𝑥1 𝑛 = 𝑋1 𝑘 = ෍ 𝑥1 𝑛 𝑒
𝑛=0
𝑁−1
2𝜋𝑘
−𝑗 𝑁 𝑛
𝐷𝐹𝑇 𝑥2 𝑛 = 𝑋2 𝑘 = ෍ 𝑥2 𝑛 𝑒
𝑛=0
10

N −1 2k 2k 2k

−j n N −1 −j n −j n
DFT {ax1 (n) + bx2 (n)} =  (ax1 (n) + bx2 (n))e N =
 (ax1 (n) e N + bx2 (n) e N )
n =0 n =0

N −1 2k N −1 2k
−j n −j n
= a  x1 (n) e N +b

x 2 ( n) e N
n =0 n =0

= a X 1 (k ) + b X 2 (k ) = RHS
 3. Time Reversal Property
11

Time Reversal of an N point sequence is x(n) is attained by wrapping the sequence x(n)
around the circle in clockwise direction. It is denoted as x((-n))N
x ((- n ))N = x( N − n) 0  n  N −1
If DFT{ x(n) }= X(k) then, Let N-n=m
Lower limit ,n =0, m=N
Upper Limit, n= N-1, m=1
DFT{x((-n)) N } = DFT {x( N − n)} = X ((− k )N ) = X ( N − k ) n= N-m

Proof:
N −1 2k
−j n
DFT x((−n)) N  = DFT x( N − n) =  x( N − n) e N
n =0
12

2k
1 −j ( N − m) Note:
DFT {x( N − n)} =  x(m)e N
N −1 −j
2k
n
m =N
2k 2 ( − k )
X (k ) =  x( n) e N
N −j N −j m n =0
=  x(m)e N .e N
m =1
N −1 (−k )m
− j 2
=  x(m) e N = X ((−k )) N
m =0
N −1 ( N −k )m
N −1 ( − k ) m N − j 2
− j 2 − j 2 m
=  x(m) e N .e N = x(m ) e N
m =0
m =0

= X (N − k)
 4. Circular Time Shifting Property
13

DFT
If x(n) ⎯⎯→ X (k ) Let m=n-l
2k
Lower limit, n=0, m=-1
−j l
x((n − l ))N ⎯⎯→ X (k )e
DFT N Upper limit , n=N-1, m=N-l-1
Then, n=m+1
N −1 2k
Proof −j n
DFT {x(n)} =  x ( n) e N
n =0
N −1 2k
−j n
DFT {x((n − l )) N } =  x((n − l )) N e N
n =0
N −l −1 2k
−j ( m +l )
=  x(m).e N
m = −l
14

N −1 2k 2k
−j m −j l
DFT {x((n − l )) N } =  x ( m) e N .e N
m =0
2k N −1 2k
−j l −j m
=e N .
 x ( m) e N
m =0

𝑗2𝜋𝑘
− 𝑁 𝑙
= 𝑒 𝑋(𝑘)
 5. Frequency-Shifting/ Circular frequency shift Property
15
2l
n j
If DFT { x(n)} = X(k) , then DFT {x(n)e N } = X ((k − l )) N
Proof
Given
N −1 2k
−j n
DFT {x(n)} = X (k ) =  x( n) e N
n =0
2l N −1 2l 2k 2 ( k −l )
j n j n −j n N −1 −j n
DFT {x(n)e N } = 
x( n)e N e N = 
x( n) e N
n =0 n =0

= X ((k − l )) N
 6. Complex Conjugate Property
16

If DFT {x(n)} = X (k ) then:

a) DFT {x* (n)} = X * ( N − k )
b) DFT {x* ( N − n)} = X * (k )
2k  *
N −1 2k − 
−j n N 1
 j n
x* ( n) e N =   x( n) e
N
Proof a) DFT ( x* (n)) = 

n =0  
n =0 
 −  *
N −1  −j
2 ( k )
n −j
2 N  N −1  2 
*
 n
 − j ( N − k ) n 
= x( n) e N .e N
 =  x( n) e N 
n =0  
 n =0  

= X *(N − k)
17

b) Proof for DFT ( x* ( N − n)) = X * (k ) Note:

𝐼𝐷𝐹𝑇 𝑋 𝑘 =𝑥 𝑛
𝑁−1
Starting from the RHS, 1 2𝜋𝑘
𝑗 𝑁 𝑛
* = ෍ 𝑋(𝑘) 𝑒
2k  2k  𝑁
1 N −1 * j n 1 N −1
 −j n 𝑘=0
*
IDFT { X (k )} =  X ( k )e N =  
N k =0 
X ( k )e N

N k =0 
 
2k 2k *
−  −   2k
( N − n ) 
*
1 N −1
N 1
1  j n j N  j
=  
N k =0 
X ( k )e N .e N
 =   X ( k )e N 
 N k =0  
   

= x * ( N − n)
 7. Circular Convolution
18

If x1 (n) and x2 (n) are finite duration sequences both of length N with DFT’s X 1 (k )
and X 2 (k ) then,
DFT{ } = X 1 (k ) X 2 (k )
where N −1
=  x1 (m) x2 ((n − m)) N
m =0
Proof N −1 2k N −1 2k
−j m −j l
Starting from the RHS, X 1 (k ) X 2 ( k ) =  x1 (m)e N .
 x2 (l )e N
m =0 l =0
𝑁−1
1 𝑗2𝜋𝑘
IDFT { X(k) }= x(n) = ෍ 𝑋 𝑘 𝑒 𝑁 𝑛
𝑁
𝑘=0
19

−  N −1 2k N −1 2k  2k

1 N 1
 −j m −j l j n
IDFT { X 1 (k ) X 2 (k )} =  

N k =0  m =0
x1 (m)e N .  x2 (l )e N e N
= 
 l 0 
− − − ( n − m − l )
1 N 1 N 1 N 1 j 2k
=
N m =0
 x1 ( m){  x2 (l ){  e N }}
l =0 k =0
If l = n-m, the summation over k equals N . For l ≠ n-m, the sum is equal to zero.

1 N −1
= 
N m =0
x1 ( m) x2 ((n − m)) N .( N )

N −1
=  x1 (m) x2 ((n − m)) N =
m =0
 8. Circular Correlation
20

For complex valued sequences x(n) and y(n) with DFT’s X(k) and Y(k) if
DFT
x(n) ⎯⎯→ X (k )
DFT
y (n) ⎯⎯→ Y (k )
~r (l ) DFT ~
then xy ⎯⎯→ R xy (k )
N −1
where ~
rxy (l ) =  x(n) y * ((n − l )) N
n =0
~
and R xy ( k ) = X ( k )Y * ( k )
21

Proof:
*
We can write ~ rxy (l ) as the circular convolution of x (l ) with y (−l )
N −1 N −1
rxy (l ) =  x(n) y ((n − l )) N =  x(n) y * (−(l − n)) N = 𝑥 𝑙
~ *
𝑦 ∗ (−𝑙)
n =0 n =0
From the complex conjugate property,
DFT
x* ((− n)) N = x* ( N − n) ⎯⎯→ X * (k )
DFT
 y * ((−l )) N ⎯⎯→ Y * (k ) − − − (1)
From the circular convolution property,
DFT { } = X 1 ( k ) X 2 ( k ) − − − ( 2)
22

Combining (1) and (2)

DFT
𝑋(𝑘)𝑌 ∗ (𝑘)

~ DFT ~
rxy (l ) ⎯⎯→ R xy (k )
 9. Multiplication of two sequences
23

If x1 (n) ⎯⎯→ X 1 (k )
DFT

x2 (n) ⎯⎯→ X 2 (k )
DFT

DFT 1
then, x1 (n) x2 (n) ⎯⎯→ { X 1 (k ) X 2 (k )}
N
Proof
𝑁−1

X 1 (k ) X 2 (k ) = ෍ 𝑋1 𝑙 . 𝑋2 (𝑘 − 𝑙)
𝑙=0
N −1 2k
−j n
DFT {x(n)} =  x( n) e N
n =0
24
𝑁−1
𝑗2𝜋𝑘
− 𝑛
𝐷𝐹𝑇 𝑥1 𝑛 . 𝑥2 𝑛 = ෍ 𝑥1 𝑛 . 𝑥2 (𝑛) 𝑒 𝑁 −−− −(1)
𝑛=0
𝑁−1
1 𝑗2𝜋𝑙
IDFT equation for 𝑥1 𝑛 𝑖𝑠 ෍ 𝑋1 (𝑙) 𝑒 𝑁 𝑛
𝑁
𝑙=0
Substituting for 𝑥1 𝑛 in (1), we get
𝑁−1 𝑁−1
1 𝑗2𝜋𝑙 𝑗2𝜋𝑘
𝐷𝐹𝑇 𝑥1 𝑛 . 𝑥2 𝑛 = ෍ ෍ 𝑋1 (𝑙) 𝑒 𝑁 . 𝑥2 (𝑛) 𝑒 𝑁 𝑛
𝑛 −
𝑁
𝑛=0 𝑙=0
𝑁−1 𝑁−1
1 𝑗2𝜋𝑙 𝑗2𝜋𝑘
= ෍ 𝑋1 (𝑙) ෍ 𝑥2 𝑛 . 𝑒 𝑁 𝑒 𝑁 𝑛
𝑛 −
𝑁
𝑙=0 𝑛=0
25

𝑁−1 𝑁−1
1 −
𝑗2𝜋(𝑘−𝑙)
𝑛
𝐷𝐹𝑇 𝑥1 𝑛 . 𝑥2 𝑛 = ෍ 𝑋1 (𝑙) ෍ 𝑥2 𝑛 . 𝑒 𝑁
𝑁
𝑙=0 𝑛=0

𝑁−1
1
= ෍ 𝑋1 𝑙 . 𝑋2 (𝑘 − 𝑙)
𝑁
𝑙=0

1
= { X 1 (k ) X 2 (k )}
N
 10. Parseval’s Theorem
26

For complex valued sequences x(n) and y(n) with DFT’s X(k) and Y(k) if
x(n) ⎯⎯→ X (k )
DFT

y (n) ⎯⎯→ Y (k )
DFT

N −1 N −1
1
Then, 
n =0
x ( n) y ( n) =
*

N
 X
k =0
( k )Y *
(k )
Proof

This property can be easily proved from the Circular correlation property.
27

Starting from the LHS, Note :

N −1
N −1
 x ( n) y ( n) = ~
* rxy (0) ~
rxy (l ) =  x(n) y * ((n − l )) N
n =0 n =0
Using IDFT formula, ~
2k R xy ( k ) = X ( k )Y * ( k )
1 N −1~ j
l
~
rxy (l ) = 
N k =0
R xy (k )e N

N −1 2 N −1
1 ~ jk .0 1 ~
~
rxy (0) = 
N k =0
R xy (k )e N = 
N k =0
R xy (k )

1 N −1
= 
N k =0
X ( k )Y *
(k ) → Pr oved
28

➢ Special Case: x(n)=y(n)

Note : According to Parseval's Theorem
N −1 1 N −1 N −1 1 N −1
 x ( n ) x *
( n ) = 
N k =0
X ( k ) X *
(k )
 x ( n )*
y ( n ) =  X ( k )Y *
(k )
n =0 n =0 N k =0

N −1 2 2
1 N −1
 x ( n) = 
N k =0
X (k )
n =0

➢ Relates the energy in the finite duration sequence x(n) in terms of its frequency
components in X(k).
➢ Law of conservation of Energy.
 Property Time Domain Frequency Domain
Periodicity 𝑥 𝑛 = 𝑥(𝑛 + 𝑁) X 𝑘 = 𝑋(𝑘 + 𝑁)
Linearity 𝑎𝑥1 𝑛 + 𝑏𝑥2 (𝑛) 𝑎𝑋1 𝑘 + 𝑏𝑋2 (𝑘)
Time Reversal 𝑥(𝑁 − 𝑛) 𝑋(𝑁 − 𝑘)
Circular Time Shift 𝑥( 𝑛 − 𝑙 )𝑁 2𝜋𝑘
−𝑗 𝑁 𝑙
𝑋 𝑘 𝑒
2𝜋𝑛
Circular Frequency Shift 𝑗 𝑁 𝑙 𝑋( 𝑘 − 𝑙 )𝑁
𝑥 𝑛 𝑒
Circular Convolution 𝑋1 (𝑘)𝑋2 (𝑘)
Circular Correlation 𝑥(𝑛) 𝑦 ∗ (−𝑛) 𝑋(𝑘)𝑌 ∗ (𝑘)
Multiplication of 2 𝑥1 (𝑛)𝑥2 (𝑛) 1
{𝑋1 𝑘 𝑋2 (𝑘)}
sequences 𝑁
Complex Conjugate 𝑥 ∗ (𝑛) 𝑋 ∗ (𝑁 − 𝑘)
𝑥 ∗ (𝑁 − 𝑛) 𝑋 ∗ (𝑘)
Parseval’s Theorem 𝑁−1 1 𝑁−1
෍ 𝑥(𝑛)𝑦 ∗ (𝑛) ෍ 𝑋(𝑘)𝑌 ∗ (𝑘)
𝑛=0 𝑁 𝑘=0
29
 Q. If DFT of the sequence x(n) = {1,2,1,1,2,-1} is X(k), What is the sequence
whose DFT is 𝒀 𝒌 = 𝒆−𝒋𝝅𝒌 𝑿(𝒌)
30

Soln:
DFT 𝑗2𝜋𝑘
Time shifting property : 𝑥( 𝑛 − 𝑙 )𝑁 𝑒 − 𝑁 𝑙 𝑋(𝑘)
𝑗2𝜋𝑘 𝑗2𝜋𝑘
− 𝑙 − 𝑙 x(n)
N=6 , DFT = 𝑒 −𝑗𝜋𝑘 𝑋(𝑘) =𝑒 𝑁 𝑋 𝑘 = 𝑒 6 𝑋(𝑘)

∴l=3, the time domain sequence is 𝑥( 𝑛 − 𝑙 )𝑁 = 𝑥( 𝑛 − 3 )6

𝑥( 𝑛 − 3 )6 = {1,2, −1,1,2,1}
𝑥( 𝑛 − 3 )6
 Q. If x(n) is a real valued sequence of length N, and X(k) is its DFT, Show
that 𝐗 𝒌 = 𝑿∗ 𝑵 − 𝒌 .
31

Soln: Since x(n) is a real valued sequence x n = 𝑥 ∗ 𝑛

𝑁−1
2π𝑘
−𝑗 𝑁 𝑛
𝐷𝐹𝑇 𝑥 𝑛 = 𝐷𝐹𝑇 𝑥∗ 𝑛 =X k = ෍ 𝑥∗ 𝑛 𝑒
𝑛=0
∗ ∗
𝑁−1 𝑁−1
2π𝑘 2π𝑘 2π𝑁
𝑗 𝑛 𝑗 𝑁 𝑛 −𝑗 𝑁 𝑛
X k = ෍ 𝑥(𝑛)𝑒 𝑁 = ෍ 𝑥(𝑛)𝑒 .𝑒
𝑛=0 𝑛=0
∗
𝑁−1
2π(𝑁−𝑘)
−𝑗 𝑛
= ෍ 𝑥(𝑛)𝑒 𝑁 = 𝑋 ∗ (𝑁 − 𝑘)
𝑛=0

𝑋𝑅 𝑘 = 𝑋𝑅 𝑁 − 𝑘 & 𝑋𝐼 𝑘 = −𝑋𝐼 𝑁 − 𝑘
 Q. Let X(k) be a 14 point DFT of a real sequence x(n). The first 8 samples of
X(k) are given by X(0)=12, X(1)=-1+j3, X(2)=3+j4, X(3)=1-j5, X(4)=-2+j2,
X(5)= 6+j3, X(6)=-2-j3, X(7)=10. Find the remaining samples of X(k).
32

Soln: For a real sequence x(n), X k = 𝑋 ∗ 𝑁 − 𝑘 .

Here N=14.
We need to find X(8) to X(13)
X 8 = 𝑋 ∗ 14 − 8 = 𝑋 ∗ 6 = −2 + 𝑗3
X 9 = 𝑋 ∗ 14 − 9 = 𝑋 ∗ 5 = 6 − 𝑗3
X 10 = 𝑋 ∗ 14 − 10 = 𝑋 ∗ 4 = −2 − 𝑗2
X 11 = 𝑋 ∗ 14 − 11 = 𝑋 ∗ 3 = 1 + 𝑗5
X 12 = 𝑋 ∗ 14 − 12 = 𝑋 ∗ 2 = 3 − 𝑗4
X 13 = 𝑋 ∗ 14 − 13 = 𝑋 ∗ 1 = −1 − 𝑗3
 Q. The 4 point DFT of a sequence x(n)={a,b,c,d} is X(k). Find the IDFT of
X(k-2).
33

Soln:
2𝜋𝑛 DFT
Circular Frequency shifting property : 𝑥 𝑛 𝑒𝑗 𝑁 𝑙 𝑋( 𝑘 − 𝑙 )𝑁
N=4, Given DFT is X(k-2)
2𝜋𝑛 2𝜋𝑛
𝑗 𝑙 𝑗 2 = 𝑥 𝑛 𝑒 𝑗𝜋𝑛
∴ l=2, the time domain sequence is 𝑥 𝑛 𝑒 𝑁 = 𝑥 𝑛 𝑒 4

𝑥 𝑛 𝑒 𝑗𝜋𝑛 = 𝑥 𝑛 −1 𝑛

n=0, 𝑥 0 −1 0 = 𝑎
Note:
n=1, 𝑥 1 −1 1 = −𝑏 𝑒 𝑗𝜋𝑛 = cos( 𝜋𝑛) + j sin (𝜋𝑛)
n=2, 𝑥 2 −1 2 = 𝑐 =(−1)𝑛
n=3, 𝑥 3 −1 3 = −𝑑
IDFT of X(k-2)={a,-b, c,-d}
 Q. Consider x(n) ={1,2,-3,0,1,-1,4,2} with an 8 point DFT X(k). Evaluate
𝒋𝟑𝝅𝒌
a) X(0) b) X(4) c)σ𝟕𝒌=𝟎 𝑿(𝒌) d) σ𝟕𝒌=𝟎 𝒆− 𝟒 𝑿(𝒌) e) σ𝟕𝒌=𝟎 |𝑿(𝒌)|𝟐
without finding DFT.
34

𝑁−1 7
2π𝑘 2π𝑘
−𝑗 𝑁 𝑛 −𝑗 8 𝑛
Soln: 𝑋 𝑘 = ෍ 𝑥(𝑛) 𝑒 =෍ 𝑥(𝑛) 𝑒
𝑛=0 𝑛=0
a) X(k)=X(0) when k=0 ,
7 7
2π.0
−𝑗 8 𝑛
𝑋 0 =෍ 𝑥(𝑛) 𝑒 = ෍ 𝑥(𝑛) = 1 + 2 − 3 + 0 + 1 − 1 + 4 + 2 = 6
𝑛=0 𝑛=0

b) X(k)=X(4) when k=4 ,

7 7 7
2π.4
𝑋 4 =෍ 𝑥(𝑛) 𝑒 8 𝑛
−𝑗 = ෍ 𝑥(𝑛)𝑒 −𝑗𝜋𝑛 = ෍ 𝑥(𝑛)(−1)𝑛 = 1 − 2 − 3 − 0 +
𝑛=0 𝑛=0 𝑛=0 +1 + 1 + 4 − 2
=0
 c) σ7𝑘=0 𝑋(𝑘)
𝑁−1 7
1 2π𝑘 1 2π𝑘
𝑥 𝑛 = ෍ 𝑋(𝑘) 𝑒 𝑁 = ෍ 𝑋(𝑘) 𝑒 8 𝑛
𝑗 𝑛 𝑗
𝑁 8
𝑘=0 𝑘=0
7 7
Here n should be -3
1 2π𝑘 1
𝑥 0 = ෍ 𝑋(𝑘) 𝑒 𝑗 8 .0 = ෍ 𝑋(𝑘) 7 7
8 8 𝑗
2π𝑘
.(−3) −𝑗
3π𝑘
7 𝑘=0 𝑘=0 ෍ 𝑋(𝑘) 𝑒 8 = ෍ 𝑋(𝑘) 𝑒 4
෍ 𝑋(𝑘) = 8. 𝑥 0 = 8 𝑘=0 𝑘=0

𝑘=0 = 8. 𝑥 −3
𝑗3𝜋𝑘
− 4
d) σ7𝑘=0 𝑒 𝑋 𝑘 Time reversal, x(-n) = x(N-n)
7
1 2π𝑘
𝑗 8 𝑛 x(-3)= x(8-3) = x(5)
𝑥 𝑛 = ෍ 𝑋(𝑘) 𝑒 7
8 3π𝑘
𝑘=0 −𝑗 4
7
2π𝑘
෍ 𝑋(𝑘) 𝑒
𝑗 8 𝑛
෍ 𝑋(𝑘) 𝑒 = 8. 𝑥 𝑛 𝑘=0
𝑘=0 = 8. 𝑥 −3 = 8. 𝑥 5 = −8
35
 e) σ7𝑘=0 |𝑋(𝑘)|2
36

According to (Parseval’s Theorem), energy of a signal is given by

N −1 2 2
1 N −1
2
1 7
 x ( n) = 
N k =0
X (k ) =  X (k )
n =0 8k =0

7 2 7 2
 X (k ) = 8.  x(n) = 8. (12 + 22 + 32 + 0 + 12 + 12 + 42 + 22 )
k =0 n =0

= 288
 Q. Using DFT, find the energy of the signal 𝑥 𝑛 = 0.1 𝑛 𝑢 𝑛 , 𝑛 < 4
37

Soln:
x(n)= {1, 0.1, 0.01, 0.001}
1 1 1 1 1 1.111
X(k)= 𝑊𝑁 . 𝑥 𝑛 = 𝑊4 . 𝑥 𝑛 = 1 −𝑗 −1 𝑗 0.99 − 0.099𝑗
. 0.1 =
1 −1 1 −1 0.01 0.909
1 𝑗 −1 −𝑗 0.001 0.99 + 0.099𝑗
According to (Parseval’s Theorem), energy of a signal is given by
2
1 N −1
2 1
1 3

N k =0
X (k ) =
4
 X (k ) = [ 𝑋 0 2 + 𝑋 1 2 + 𝑋 2 2 + 𝑋 3 2]
4
k =0 1
1
= [1.234 + 0.9899 + 0.8263 + 0.9899] = [4.04]
4 4
= 1.01
38

HWQ1. Given the eight point DFT X(k) of a sequence x(n) as X(k)={1, 2+j,
1, -1+j, 2+2j, -1-j, 1 ,2-j}. Determine the following without directly
computing the IDFT. a) σ𝟕𝒌=𝟎 |𝒙(𝒏)|𝟐 b) x(4)

HWQ2. Given, the DFT of a real valued sequence is X(k)={j, 1+j, A, 1-j, -1,
B,-1-j, C}. Find the energy of the signal.
 REFERENCES
39

1. Proakis J. G. and Manolakis D. G., Digital Signal Processing, 4/e, Pearson

Education, 2007.
2. P. Ramesh Babu, Digital Signal Processing, Scitech Publications (India) Pvt Ltd.
End of Part II

THANK YOU!