Scribd
Upload
219 views10 pages

Convolution Example

The three steps of linear convolution are: 1. Time reversal of one of the signals. 2. Shifting the time-reversed signal by n samples to obtain the convolution. 3. Multiplying corresponding samples of the two signals and taking the summation to obtain the output signal g(n). The length of the output signal is the sum of the lengths of the two input signals minus one. This process can also be applied to 2D signals by performing time reversal, shifting, and multiplying/summing across both dimensions.

Uploaded by

Juan Diego Niño
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
219 views10 pages

Convolution Example

The three steps of linear convolution are: 1. Time reversal of one of the signals. 2. Shifting the time-reversed signal by n samples to obtain the convolution. 3. Multiplying corresponding samples of the two signals and taking the summation to obtain the output signal g(n). The length of the output signal is the sum of the lengths of the two input signals minus one. This process can also be applied to 2D signals by performing time reversal, shifting, and multiplying/summing across both dimensions.

Uploaded by

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

Three-Steps of Linear Convolution

• For any given n, how



to obtain
g ( n)   h( k ) f ( n  k )
k  
– Step 1: time reversal of either signal (e.g., f(k)f(-
k) )
– Step 2: shift f(-k) by n samples to obtain f(n-k)
– Step 3: multiply h(k) and f(n-k) for each k and then
take the summation over k
Note
You need to change variable n to get the whole sequence.

EE465: Introduction to Digital Image 1


Processing
1D Linear Convolution

f(n)=[1 2 3 4] h(n)=[1 –1]

4
3 1
2
1 o
-1
o
origin

EE465: Introduction to Digital Image 2


Processing
Step 1:Time Reversal

h(k)=[1 –1] h(-k)=[–1 1]

1 1

o o
-1 -1

EE465: Introduction to Digital Image 3


Processing
Step 2: Shift

h(-k)
h(1-k)
h(2-k)
1 1 1

o o o
-1 n=0
-1 n=1
n=2
4
3
2 f(k)=[1 2 3 4]
1

o
EE465: Introduction to Digital Image 4
Processing
Step3: Multiply-and-Add

g(0)=1g(2)=1
g(1)=1
1 1 1

o o o
-1
-1n=0 n=2
n=1
4
3
2 f(k)=[1 2 3 4]
1

o
EE465: Introduction to Digital Image 5
Processing
Final Result
f(n)=[1 2 3 4] h(n)=[1 –1]

g(n)=[1 1 1 1 -4]

If the lengths of two input signals are N1 and N2 respectively,


the length of the output signal will be N1+N2-1.

EE465: Introduction to Digital Image 6


Processing
2D Linear Convolution

n n
x(m,n) h(m,n)
1 4 1 1 1
2 5 3 m 1 -1 m

EE465: Introduction to Digital Image 7


Processing
Step 1:Time Reversal
h(m,n) h(m,-n) h(-m,-n)
n

1 1
1 -1 m 1 -1 -1 1
1 1 1 1

EE465: Introduction to Digital Image 8


Processing
Step 2: Shift
l

h(1-k,1-l)
h(1-k,-l)
-1
h(-k,-l) 1
1 4 1
-1 -1
11 1
2 5 3 k
x(k,l)
1 11 1

EE465: Introduction to Digital Image 9


Processing
Step3: Multiply-and-Add
l

y(1,1)=10
y(1,0)=3
-1
y(0,0)=2 1
1 4 1
-1 11
-1 1
2 5 3 k
x(k,l)
1 11 1

EE465: Introduction to Digital Image 10


Processing

You might also like