Академический Документы
Профессиональный Документы
Культура Документы
Tutorial-3
Properties of Convolution
Q. 1:
Consider an LTI system with impulse response h[n] = u[n]. Derive h1 [n], which is inverse
of h[n]. Also vrify the same by deriving h[n] h1 [n].
Sol. 1:
The response of the system h[n] = u[n] to an arbitrary input x[n] is:
y[n] =
=
=
k=
n
X
k=
n1
X
x[k]u[n k]
x[k]
x[k] + x[n]
k=
= y[n 1] + x[n]
x[n] = y[n] y[n 1]
Where x[n] is the response of the inverse system. To derive impulse response (h1 [n]) of the
inverse system, let us consider x[n] = [n]
h1 [n] = [n] [n 1]
To verify that h[n] and h[n] are impulse responses of LTI system that are inverses to each
other,
y[n] =
in
f ty
X
x[m]h[n m]
m=
= x[m][n m k]
= x[n k]
x[n] = y[n k]
(1)
where x[n] is the response of the inverse system. To derive impulse response of the inverse
system, consider y[n] = [n]
Therefore, h1 [n] = [n + k]
h1 [n] is the impulse response of inverse LTI system of h[n].
When k > 0, output of the inverse system depends on future value of input, hence h1 [n] is
impulse response of a non-causal system. Therefore, the statement is false
Q. 1: State whether the following statements are true or not. If true then provide reasonings
and if not show with counter examples.
(a) A continuous-time LTI system is stable if and only if its step response s(t) is absolutely
integrable, i.e.,
R +
s(t)dt <
(b) A discrete-time LTI system is causal if and only if its step response s[n] is zero for n < 0.
Sol. 1: (a) The given statement is not true.
Suppose h(t) = et u(t). Then
R +
t
t
e u(t) dt = (e ) = 1
R +
u(t )e u()d
Rt
e d
0
= (1 et )u(t)
R +
(1 et ) dt
0
= (t + et )
Now,
P
u[n] =
[n k]
k=0
From superposition,
P
s[n] =
h[n k]
k=0
If s[n] , 0, for some n < 0, there exists some value of h[k] , 0 for some k < 0.
Figure 1:
(a) If H and G are both LTI causal systems, prove that the overall system is causal.
(b) If H and G are both stable systems, show that the overall system is stable.
Sol. 2: (a)
The convolution of the two systems is given by,
h(t) g(t) =
=
R +
0
R +
h(t )g() d
h(t )g() d
P
=> y[n] =
x[n k]h[k]
k=
Thus,
P
y[n] =
x[n k]h[k]
k=
)
(
P
=> max y[n] = max
x[n k]h[k]
k=
P
max
|x[n k]| |h[k]|
k=
k=
= max {|x[n]|}
|h[k]|
k=
P
max y[n] max {|x[n]|}
|h[k]|
that
k=
k=
k=
|h[k]|.
k=