Two Examples On Linear and Circular Convolution of Signals.: Example 1
Two Examples On Linear and Circular Convolution of Signals.: Example 1
Two Examples On Linear and Circular Convolution of Signals.: Example 1
Umeå University
Department of mathematics
and mathematical statistics
PAB
Method 1. (probably the easiest) Use that the z-transform turns a convolution into a product.
+ z −2 · 1 + 7z −1 − 2z −2 = 2 + 14z −1 − 4z −2 − 3z −1 − 21z −2 + 6z −3 + z −2 + 7z −3 − 2z −4 =
= 2 + 11z −1 − 24z −2 + 13z −3 − 2z −4 and from this we can read off the result:
2 n=0
11 n=1
−24 n=2
(x ∗ y)(n) =
13 n=3
−2
n=4
0 otherwise
∞
X
Method 2 Use the definition (x ∗ y)(n) = x(k)y(n − k). The convolution of two finite length
k=−∞
signals with lengths N1 and N2 will have length N = N1 + N2 − 1. So here the convolution will have
length N = 3 + 3 − 1 = 5 as can be seen from the result of method 1 also. Here we have that the
sum is only for k = 0, 1, 2 since otherwise x(k) = 0. So for n = 0, 1, 2, 3, 4 we get
We get the same result as in method 1, (x ∗ y)(n) = [2, 11, −24, 13, −2].
Example 2. (This is a problem from the test 2020-01-17)
The two sequences x and y are given by, x(0) = 1, x(1) = 1, x(2) = 0, x(3) = 3
and y(0) = 2, y(1) = 3, y(2) = 1, y(3) = 1
Solutions
b) The circular convolution z = x ~ y is now calculated using the discrete Fourier transform.
1 1 1 1
1 −j −1 j
We calculate the DFT as X = F4 · x, Y = F4 · y where the matrix F4 = 1 −1
.
1 −1
1 j −1 −j
1 1 1 1 1 5 1 1 1 1 2 7
1 −j −1 j 1 = 1 + 2j Y = 1 −j −1 j 3 = 1 − 2j
We get X = 1 −1 1 −1 0 −3 1 −1 1 −1 1 −1
1 j −1 −j 3 1 − 2j 1 j −1 −j 1 1 + 2j
5·7 35
(1 + 2j) · (1 − 2j) 5
The DFT of x ~ y = z then is Z = (−3) · (−1) = 3 . To get the convolution we
(1 − 2j) · (1 + 2j) 5
1 1 1 1 35 48 12
1 1 1 j −1 −j 1
· = = 8 .
5 32
multiply by the inversee z = F4−1 · Z = F4∗ · Z =
4 4 1 −1
1 −1 3 4 28
7
1 −j −1 j 5 32 8