Scribd
Upload
199 views20 pages

Circular Convolution Using Graphical Method: - Sarang Joshi

The document discusses circular convolution and provides an example to calculate the output for different values of m. It defines circular convolution and shows how to represent the input sequences x1(n) and x2(n) in circular form. It then calculates the output y(m) for m = 0, 1, 2, 3 by shifting x2(n) and summing the product of x1(n) and the shifted x2(n). The final outputs are y(m) = {34, 36, 34, 28}.

Uploaded by

sarang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
199 views20 pages

Circular Convolution Using Graphical Method: - Sarang Joshi

The document discusses circular convolution and provides an example to calculate the output for different values of m. It defines circular convolution and shows how to represent the input sequences x1(n) and x2(n) in circular form. It then calculates the output y(m) for m = 0, 1, 2, 3 by shifting x2(n) and summing the product of x1(n) and the shifted x2(n). The final outputs are y(m) = {34, 36, 34, 28}.

Uploaded by

sarang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Circular Convolution using

Graphical method

- SARANG JOSHI
Circular Convolution

[ x1 ( n) N x2 ( n)]  X 1 ( k ) X 2 ( k )

 N −1 
y ( m) =  x1 ( n) x2 ((m − n)) N 
 n =0 
For m=0,1,2………N-1
for m = 0;
 3 
y (0) =  x1 ( n) x2 (( − n)) 4 
 n =0 
Circular representation
x1(n)={0, 1 , 2 , 3 }
x1(1)=1

x1(2)=2 x1(n) x1(0)=0

x1(3)=3
x2(n)={4 , 5 , 6 , 7 }

x2(1)=5

x2(2)=6 x2(n) x2(0)=4

x2(3)=7
x2(-n)=x2(N-n)

x2(-1)=x2(3)
x2(-2)=x2(2)
x2(-3)=7 x2(-3)=x2(1)

x2((-n))
x2(-2)=6 x2(0)=4

x2(-1)=5
for m = 0;
 3 
y (0) =  x1 ( n) x2 (( − n)) 4 
 n =0 

y (0) = x1 (0) x2 ((−0)) N + x1 (1) x2 ((−1)) N +


x1 (2) x2 ((−2)) N + x1 (3) x2 ((−3)) N
for m = 0;
x1(1)=1  3 
y (0) =  x1 ( n) x2 ((− n)) 4 
x1(n)  n =0 
1x7=7

x2(-3)=7

x1(2)=2 2x6=12 x2(-2)=6 x2(0)=4 0x4=0 x1(0)=0

x2(-1)=5

x2((-n)) 3x5=15
y(0)=0+7+12+15
=34
x1(3)=3
for m = 1;
 3 
y (1) =  x1 ( n) x2 ((1 − n)) 4 
 n =0 

y (1) = x1 (0) x2 ((1)) 4 + x1 (1) x2 ((0)) 4 +


x1 (2) x2 ((−1)) 4 + x1 (3) x2 ((−2)) 4
x2(1-n)=x2(-n+1)
i.e. shift x2(-n) by 1 sample anticlockwise

x2(0)=4

x2((-n+1))
x2(3)=7 x2(1)=5

x2(2)=6
for m = 1;
x1(1)=1
 3 
x1(n) y (1) =  x1 ( n) x2 ((1 − n)) 4 
 n =0 
1x4=4

x2(0)=4

x1(2)=2 2x7=14 x2(3)=7 x2(1)=5 0x5=0 x1(0)=0

x2(2)=6

x2((-n+1)) 3x6=18
y(1)=0+4+14+18
=36
x1(3)=3
for m = 2;
 3 
y ( 2) =  x1 ( n) x2 (( 2 − n)) 4 
 n =0 

y (2) = x1 (0) x2 ((2)) 4 + x1 (1) x2 ((1)) 4 +


x1 (2) x2 ((0)) 4 + x1 (3) x2 ((−1)) 4
x2(2-n)=x2(-n+2)
i.e. shift x2(-n) by 2 samples anticlockwise

x2(1)=5

x2((-n+2))
x2(0)=4 x2(2)=6

x2(3)=7
for m = 2;
x1(1)=1
 3 
y ( 2) =  x1 ( n) x2 ((2 − n)) 4 
x1(n)  n =0 
1x5=5

x2(1)=5

x1(2)=2 2x4=8 x2(0)=4 x2(2)=6 0x6=0 x1(0)=0

x2(3)=7

x2((-n+2)) 3x7=21

y(2)=0+5+8+21
x1(3)=3 =34
for m = 3;
 3 
y (3) =  x1 ( n) x2 ((3 − n)) 4 
 n =0 

y (3) = x1 (0) x2 ((3)) 4 + x1 (1) x2 ((2)) 4 +


x1 (2) x2 ((1)) 4 + x1 (3) x2 ((0)) 4
x2(3-n)=x2(-n+3)
i.e. shift x2(-n) by 3 samples anticlockwise

x2(2)=6

x2((-n+3))
x2(1)=5 x2(3)=7

x2(0)=4
for m = 3;
x1(1)=1
 3 
y (3) =  x1 (n) x2 ((3 − n)) 4 
x1(n)  n =0 
1x6=6

x2(2)=6

x1(2)=2 2x5=10 x2(1)=5 x2(3)=7 0x7=0 x1(0)=0

x2(0)=4

x2((-n+3)) 3x4=12
y(3)=0+6+10+12
=28
x1(3)=3
y(m)={34,36,34,28}
RATE, FOLLOW & SHARE
https://unacademy.com/user/jsarang70-7008
THANK YOU !

You might also like