Convolution

A more practical and useful approach is to consider convolution from the point of
view of the output signal

If impulse response is finite, i.e.

Then

1
Convolution

Graphical representation of the

computation of an output sample
value by convolution.

2
Convolution
 Convolution is a fundamental and important building block in digital signal
processing.

 Its implementation is a sum of products.

 Single cycle MAC and Harvard architecture are suited to its efficient computation.

3
Properties of Convolution
Convolution involving the delta sequence is particularly straightforward
x ( n) * d ( n)  x ( n)
x ( n) * d ( n  s )  x ( n  s )
x ( n) * Kd ( n)  Kx( n)
Commutative property
a ( n) * b( n)  b( n) * a ( n)
Associative property
( a ( n) * b( n)) * c ( n)  a ( n) * (b( n) * c ( n))
Distributive property
( a ( n) * b( n)  a ( n) * c ( n)  a ( n) * (b( n)  c ( n))

4
Convolution of two short, finite signals

arrange impulse response* down left hand side of matrix

arrange input signal* along top of matrix
compute products to populate matrix
sum products along diagonals to give output signal

5
*finite sequences
Correlation
 Correlation is concerned with determining the degree of similarity between
two signals

 Computationally it bears a resemblance to convolution


Rxy ( p )   x ( m) y ( m  p )
m  
  p  

6
Correlation
 Sum of products

 At the heart of the discrete Fourier transform (DFT)


Rxy ( p )   x ( m) y ( m  p )
m  
  p  

7
Correlation vs. Convolution
 The similarities between the computations involved in convolution and correlation
are coincidental.

 Convolution describes the relationships between input signal, output signal and
impulse response in a LTI system.

 Correlation is a method of determining the degree of similarity between two signals.