SINYAL DAN SISTEM – TF181501

CONVOLUTION
PURWADI AGUS DARWITO

1
Introduction :
• Convolution is defined as a way to combine two series of numbers to produce
a third series of numbers.
• Mathematically, convolution is an integral that reflects the sum of the scopes
of a function a which is shifted over function b so as to produce a function c.
• Convolution is denoted by an asterisk (*). So, a*b = c means that function a is
convoluted with function b to produce function c.
• Using the strategy of impulse decomposition, systems are described by a
signal called the impulse response. Convolution is important because it relates
the three signals of interest: the input signal, the output signal, and the
impulse response.
• Judging from the type of signal, the type of convolution is divided into the
number of convolutions used in discrete-time systems and integral
convolutions used in continuous-time systems.
2
Introduction :
• Convolution is the central operator of image processing and has been widely
used in various image processing software.
• Convolution is a process where the image is manipulated using external masks /
subwindows to produce a new image.
• Filtering without using an external mask but only using neighboring pixels to get
new pixels.
• Convolution is very widely used in image processing for smoothing (smoothing),
sharpening (crispening), detecting edges (edge detection), and other effects.

3
Properties of Convolution
• Sifting Property:

• Proof :

• Integration :

• Proof :

• Step Response (follows from the integration property):

4
Properties of Convolution (Cont.)
• Commutative Property:

• Proof :

• Distributive Property:

• Proof :

5
Properties of Convolution (Cont.)
• Associative Property:

• Proof :

6
Useful Properties of CT LTI Systems
• Causality: which implies:
This means y(t) only depends on x( < t).
• Stability:
Bounded Input ↔ Bounded Output
Sufficient Condition:

Necessary Condition:

7
Graphical Approach
In addition to the direct method, convolutions may also be performed
graphically. The steps involved in using the graphical approach are as follows:
1. Plot both sequences, x(k) and h(k), as functions of k.
2. Choose one of the sequences, say h(k), and time-reverse it to form the sequence h(-k).
3. Shift the time-reversed sequence by n. [Note: If n > 0, this corresponds to a shift to the right
(delay), whereas if n < 0, this corresponds to a shift to the left (advance).]
4. Multiply the two sequences x(k) and h(n - k) and sum the product for all values of k. The
resulting value will be equal to y(n). This process is repeated for all possible shifts, n.

8
Example :

9
Example :

10
Example :

11
Illustration :

12
Illustration :

13
Illustration :

14
Illustration :

15
Graphical illustration of convolution using paper strips :

16
The computation of convolution in tabular form:

18
Notice :
• A useful fact to remember in performing the convolution of two finite-length
sequences is that if x(n) is of length L1 and h(n) is of length L2, y(n) = x(n) * h(n)
will be of length

• Furthermore, if the nonzero values of x(n) are contained in the interval [ M,, N,]
and the nonzero values of h(n) are contained in the interval [Mh, Nh], the
nonzero values of y(n) will be confined to the interval [Mx + Mh, Nx + Nh].

19
Slide Rule Method :
Another method for performing convolutions, which we call the slide rule method, is
particularly convenient when both x(n) and h(n) are finite in length and short in duration.
The steps involved in the slide rule method are as follows:

20
Example :

21
Example :

22
Example :

26
Example :

27
Example :

28
Example :

29
30
g
• Describe

31
g
• Describe

32