EE1101 Signals and Systems JAN—MAY 2018
Tutorial 4 Solutions
R∞
1) Let y(t) be the response to the input i(t). Then, y(t) = i(t) ∗ h(t) = y(t) = h(τ )i(t − τ )dτ . Fig. [1] shows
−∞
i(t − τ ) and h(τ ) respectively.
i(t − τ )
h(τ )
t−2 t τ 0 3 τ
Figure 1: Plot showing variation of i(t − τ ) and h(τ ) as a function of τ for some given real value t.
Case 1: For t < 0, there is no overlap between the non-zero regions of i(t − τ ) and h(τ ). Hence, y(t) = 0, ∀t < 0.
Case 2: Suppose t ≥ 0 and t − 2 < 0, i.e., 0 ≤ t < 2.
Then,
Zt
y(t) = (4)(2e−τ )dτ = 8 1 − e−t .
Case 3: For t < 3 and t − 2 ≥ 0, i.e., 2 ≤ t < 3, we have,
Z t
e−τ dτ = 8 e2−t − e−t .
y(t) = 8
t−2
Case 4: When t ≥ 3, but still t − 2 < 3, i.e., 3 ≤ t < 5, we get,
Z 3
e−τ dτ = 8 e2−t − e−3 .
y(t) = 8
t−2
Case 5: Finally, if t − 2 ≥ 3, i.e., t ≥ 5, due to non-overlapping of the non-zero portions of h(τ ) and i(t − τ ), y(t)
becomes zero.
The signal y(t) is,
0, t<0
−t
8(1 − e ), 0 ≤t<2
2−t −t
y(t) = 8(e − e ), 2 ≤ t < 3
− e−3 ), 3 ≤ t < 5
2−t
8(e
0, t ≥ 5.
1
2) (a) Given that f (t) ∗ g(t) = y(t). Hence,
Z∞
y(t) = f (τ )g(t − τ ) dτ.
−∞
Let us consider f (t − T1 ) ∗ g(t − T2 ), and by using the definition of convolution, we have
Z∞ Z∞
f (t − T1 ) ∗ g(t − T2 ) = f (τ − T1 )g(t − τ − T2 )dτ = f (τ − T1 )g(t − T2 − τ )dτ.
−∞ −∞
Denote τ 0 = τ − T1 , note that the limits and derivative does not change.
Z∞ Z∞
f (τ )g t − T2 − (τ + T1 ) dτ 0 =
0 0
f (τ 0 )g t − (T1 + T2 ) − τ 0 dτ 0
f (t − T1 ) ∗ g(t − T2 ) =
−∞ −∞
= y t − (T1 + T2 ) [On comparing with the first equation].
(b) If u(t) ∗ u(t) = r(t), then
u(t + 1) − u(t − 2) ∗ u(t − 3) − u(t − 4)
= u(t + 1) ∗ u(t − 3) − u(t + 1) ∗ u(t − 4) + u(t − 2) ∗ u(t − 4) − u(t − 2) ∗ u(t − 3)
= r(t − 2) − r(t − 3) + r(t − 6) − r(t − 5).
The last equality is a consequence of the result obtained in (a). We now sketch r(t−2)−r(t−3)+r(t−6)−r(t−5)
in Fig. [2].
r(t − 2) − r(t − 3)
0
0 1 2 3 4 5 6 t
0 1 2 3 4 5 6 t
0
-1
r(t − 6) − r(t − 5)
r(t − 2) − r(t − 3) + r(t − 6) − r(t − 5)
0
0 1 2 3 4 5 6 t
Figure 2: Sketch of the signal u(t + 1) − u(t − 2) ∗ u(t − 3) − u(t − 4) using the distributive and shift property of
convolution.
2
One can verify the result by performing convolution of pulses u(t + 1) − u(t − 2) and u(t − 3) − u(t − 4) ,
shown in Fig. [3].
u(t + 1) − u(t − 2) u(t − 3) − u(t − 4)
1
1
0
0
-2 -1 0 1 2 t 0 1 2 3 4 t
Figure 3: Signals x(t) = u(t + 1) − u(t − 2) and y(t) = u(t − 3) − u(t − 4) .
Hence, if x(t) = u(t + 1) − u(t − 2) and y(t) = u(t − 3) − u(t − 4), then x(t) ∗ y(t) is given by,
0 t<2
t − 2 2≤t<3
x(t) ∗ y(t) = 1 3≤t≤5
6 − t 5 ≤ t ≤ 6
0 t>6
3) Given: y(t) = f (t) ∗ g(t). Now, consider the following:
Z ∞ Z ∞
y(t) = f (τ )g(t − τ )dτ =⇒ y(ct) = f (τ )g(ct − τ )dτ
−∞ −∞
At the same time, Z ∞
f (ct) ∗ g(ct) = f (cτ )g(ct − cτ )dτ
−∞
dτ 0
Case 1: Let c > 0. Then, c = |c|. Let τ 0 = cτ = |c|τ =⇒ dτ = |c| . Hence,
∞ ∞
dτ 0
Z Z
1 1
f (ct) ∗ g(ct) = f (τ 0 )g(ct − τ 0 ) = f (τ 0 )g(ct − τ 0 )dτ 0 = y(ct).
−∞ |c| |c| −∞ |c|
Case 2: Suppose c < 0, then c = −|c|. In which case, let τ 0 = cτ = −|c|τ =⇒ dτ 0 = − dτ
|c| .
Z −∞ dτ 0 Z ∞
1 1
f (ct) ∗ g(ct) = f (τ 0 )g(ct − τ 0 ) − = f (τ 0 )g(ct − τ 0 )dτ 0 = y(ct).
∞ |c| |c| −∞ |c|
1
Therefore, if y(t) = f (t) ∗ g(t), then f (ct) ∗ g(ct) = |c| y(ct), for all c 6= 0.
Fig. [4] shows f (t) and g(t).
f (t) g(t)
1
1
−1 2 t 0 1 t
Figure 4: f (t)
R∞
Then, y(t) = f (τ )g(t − τ )dτ and g(t − τ ), as a function of τ , will be non-zero from τ = t − 1 to τ = t, as
−∞
shown in figure [5].
3
g(t − τ )
−τ + t
1
t−1 t τ
Figure 5: g(t − τ )
Case 1: If t < −1. Then, f (τ )g(t − τ ) = 0 in this range. Hence, y(t) = 0, ∀t < −1.
Case 2: If t ≥ −1 but t − 1 < −1, i.e., −1 ≤ t < 0.
Rt 2
Here, y(t) = (−τ + t) dτ = t2 + t + 12 .
−1
Case 3: If t < 2 but t − 1 ≥ −1, i.e., 0 ≤ t < 2.
Rt
Then, y(t) = (−τ + t) dτ = 0.5.
t−1
Case 4: If t ≥ 2 but t − 1 < 2, i.e., 2 ≤ t < 3.
R2 2
Now, y(t) = (−τ + t) dτ = − t2 + 2t − 32 .
t−1
Case 5: If t − 1 ≥ 2, f (τ )g(t − τ ) = 0 =⇒ y(t) = 0, ∀t ≥ 3.
Using the result derived initially, we get,
0, t < −0.5
2
t + t + 0.25, −0.5 ≤ t < 0
f (2t) ∗ g(2t) = 0.25, 0≤t<1
2
−t + 2t − 0.75, 1 ≤ t < 1.5
0, t ≥ 1.5
4) A continuous-time LTI system is stable if and only if, the impulse response is absolutely integrable
Z ∞
|h(τ )|dτ < ∞.
−∞
A continuous-time LTI system is causal if,
h(t) = 0 for t < 0,
A continuous-time LTI system is instantaneous/memoryless if, h(t) = cδ(t), where c is a nonzero scaling factor.
(a) h(t) = e−(t+2) u(t) R∞
This system is stable as impulse response is absolutely integrable i.e, 0 e−(τ +2) dτ = e−2 , causal as
u(t) = 0 for t < 0 and, not instantaneous as h(t) 6= cδ(t).
R∞
(b) h(t) = e−|t| is stable as −∞ e−|τ | dτ = 2. Since the impulse response is two sided i.e, h(t) = et ∀ t < 0
and h(t) = e−t ∀ t ≥ 0, the system is non-causal and, not instantaneous as h(t) 6= cδ(t).
R∞
(c) h(t) = δ(t) + δ(t − 3) is stable as −∞ (δ(t) + δ(t − 3))dτ = 2, causal as h(t) = 0 ∀ t < 0 and not
instantaneous as h(t) 6= cδ(t).
Rt
5) a) The output of S1 is, w(t) = e−4t u(2t). Further, the output of S2 is y(t) = w(t) ∗ h(t) = 0 e−4τ e−(t−τ ) dτ .
Thus, y(t) = 31 e−t (1 − e−3t ), ∀t ≥ 0.
Rt
b) Here, the output p(t) is given by, p(t) = x(t) ∗ h(t) = 0 e−2τ e−(t−τ ) dτ = e−t (1 − e−t ). Thus, p(t) =
e−t (1 − e−t ), ∀t ≥ 0. Now, the final output z(t) will be,
z(t) = e−2t (1 − e−2t ), ∀t ≥ 0.
The final outputs are not same as S1 is not time-invariant system.
4
6) (a) The response is given by,
Z∞
y(t) = x1 (t) ∗ h(t) = 5 e−2(t−τ ) u(t − τ )u(τ )dτ
−∞
Zt
=5 e−2(t−τ ) dτ for 0 ≤ τ ≤ t
0
= 2.5e−2t (e2t − 1) for t ≥ 0.
(
5
− e−2t ), ∀t ≥ 0
2 (1
Hence, y(t) =
0, t < 0
(b) Given: x2 (t) = cos(4πt) = 12 (ej4πt + e−j4πt ). Then, we obtain,
Z∞ Z∞
1
y(t) = x2 (t) ∗ h(t) = h(τ )x2 (t − τ )dτ = ej4πt e−j4πτ −2τ + e−j4πt ej4πτ −2τ dτ
2
−∞ 0
Z∞ Z∞
1
= ej4πt e−(j4π+2)τ dτ + e−j4πt e−(2−j4π)τ dτ
2
0 0
1 ej4πt e−j4πt 2 cos(4πt) + 4π sin(4πt)
= + = .
2 2 + j4π 2 − j4π 4 + 16π 2
7) (a) True. If h(t) periodic and nonzero, then
Z ∞ +∞ Z
X nT
|h(t)|dt = |h(t)|dt.
−∞ n=−∞ (n−1)T
Since each summand is positive, the infinite sum is unbounded. Thus h(t) is unstable.
(b) False. For instance, suppose that the inverse of h[n] = δ[n − n0 ] is g[n]. Then,
⇒ h[n] ∗ g[n] = δ[n]
X∞
⇒ δ[k − n0 ]g[n − k] = g[n − n0 ] = δ[n]
k=−∞
⇒ g[n] = δ[n + n0 ]
which is noncausal.
(c) False. For example h[n] = u[n] implies that
∞
X
|h[n]| = ∞.
−∞
This is an unstable system.
(d) True. Assuming that h[n] is bounded in the range n1 ≤ n ≤ n2 ,
n2
X
|h[k]| < ∞.
k=n1
This implies that the system is stable.
R∞ R∞
(e) False. For example, h(t) = tu(t) is causal. However, −∞
|h(t)|dt = 0
et dt = ∞.
(f) False. For example, the cascade of a causal system with impulse response h1 [n] = δ[n−1] and a non-causal
system with impulse response h2 [n] = δ[n + 1] leads to a system with overall impluse response given by
h[n] = h1 [n] ∗ h2 [n] = δ[n].
5
R∞
(g) False. For example, if h(t) = e−t u(t), then s(t) = e−t u(t) ∗ u(t) = τ =−∞
e−τ u(τ )u(t − τ )dτ
Rt
= τ =0 e−τ u(τ )dτ = (1 − e−t )u(t) and
Z ∞
|1 − e−t |dt = t + e−t |∞
0 = ∞.
0
Although the system is stable, the step response is not absolutely integrable.
(h) True. We may write u[n] = Σ∞
k=0 δ[n − k]. Therefore,
s[n] = Σ∞ ∞
k=−∞ u[k]h[n − k] = Σk=0 h[n − k].
If s[n] = 0 for n < 0, then h[n] = 0 for n < 0 and the system is causal.
8) Given: System A is LTI and system B is inverse of A. Let y1 (t) and y2 (t) be outputs of system A for inputs
x1 (t) and x2 (t) respectively. Combining these informations, we get,
A B
x1 (t) −
→ y1 (t) −
→ x1 (t). (1)
And,
A B
x2 (t) −
→ y2 (t) −
→ x2 (t). (2)
(a) To prove system B is linear. Assume that system B is not linear. From equations (1) and (2), we
observe that an input ax1 (t) + bx2 (t) to system A can generate ay1 (t) + by2 (t), i.e.,
A
ax1 (t) + bx2 (t) −
→ ay1 (t) + by2 (t).
This is due to linearity property of the system A. Our assumption that system B is not linear implies
that the output of B for the input ay1 (t) + by2 (t) is not ax1 (t) + bx2 (t), i.e., in (1) and (2) the outputs of
system B does not add up linearly even if the inputs combine linearly. Therefore, we arrive at a situation
which is as follows:
A B
ax1 (t) + bx2 (t) −
→ ay1 (t) + by2 (t) −
6 → ax1 (t) + bx2 (t).
This contradicts the fact that B is inverse of A. Hence, our assumption is incorrect, and so, system B is
linear.
(b) To prove system B is time-invariant. Assume system B is time variant. By time-invariant property
of system A, we have,
A
x1 (t − τ ) −
→ y1 (t − τ ).
When this output of system A, is fed to system B, we must not expect its response to be x1 (t − τ ) because
of our assumption. So, we land up in a situation where,
A B
x1 (t − τ ) −
→ y1 (t − τ ) −
6 → x1 (t − τ ).
This contradicts the fact that B is the inverse of A. So, the assumption about system B is incorrect.
Therefore, system B is also time-invariant.