Properties of LTI Systems - GATE Study

Material in PDF
In the previous article, we discussed the basic structure of an LTI System. In these free
GATE Notes, we will discuss convolution of the input and impulse system response in
this article entitled Properties of LTI Systems.
These study material covers everything useful you will need for GATE EC and GATE EE
as well as other exams like ISRO, IES, BARC, BSNL, DRDO etc. These notes can also be
downloaded in PDF so that your exam preparation is made easy and you ace your exam.
You should probably go through the basics covered in previous articles, before starting
off with this module.

Recommended Reading
Laplace Transforms
Limits, Continuity & Differentiability
Mean Value Theorems
Differentiation
Partial Differentiation
Maxima and Minima
Methods of Integration & Standard Integrals
Vector Calculus
Vector Integration
Time Signals & Signal Transformation
Standard Time Signals
Signal Classification
1|Page

Types of Time Systems

Introduction to Linear Time Invariant Systems

Commutative Property
According to this property, output of a LTI system having system response h(t)and
input x(t) is same as that of the system having system response x(t) and input h(t).
y(t) = x(t) * h(t)

= x() h(t )d

y(t) = h(t) x(t) = x() h(t )d

And according to this property

x()h(t )d = h() x(t )d

Similarly, for Discrete systems, x[n] * h[n] = h[n] * x[n]

Distributive Property
According to this property, if the same input is two systems in parallel then the input
can convolve with the combination as well as each system individually. The result of
both operations will be equal.
x(t) * (h1(t) + h2(t)) = x(t) * h1(t) + x(t ) * h2(t)
x[n] * (h1[n] + h2[n]) = x[n] * h1[n] + x[n] * h2[n]

Associative Property
According to this property, the convolution of input with more than one system follows
the same rule as multiplication.
x(t) * (h1(t) * h2(t)) = (x(t) * h1(t)) * h2(t)
x[n] * (h1[n] * h2[n]) = (x[n] * h1[n]) * h2[n]

Cascaded Connection
2|Page

If a system is given as

The equivalent of the above system can be drawn as

Where h(t) = h1(t) * h2(t) * h3(t) ---- * hn(t)

Thus, for a cascaded combination of systems, it can be convolved into a single system.

Parallel Connection
If a system is given as

It can also be represented as follows

Where h(t) = h1(t) + h2(t) + ----- + hn(t)

Thus, for a parallel connection of individual systems, the combined system will be the
sum of these individual systems.

Area
For LTI systems, area of the convolved signal is equal to the product of the areas of the
signals to be convolved.
i.e. if y(t) = x(t) * h(t)
then area of y(t)
3|Page

y(t)dt = x(t)dt . h(t)dt

Width
For continuous time LTI systems, width of the convolved signal is equal to the sum of
the width of the signals to be convolved.
For continuous time signals, if width of x(t)=L and width of h(t)=M
Then width of y(t)=L+M
Also, upper and lower limits of y(t) can also be found for limited time signals
If the range of x(t) is from L1 to L2 and the range of h(t) is from M1 to M2, then the range
of y(t) (L1 + M1) to (L2 + M2)
For discrete time LTI systems,
x[n] length is L1 and h[n] length is L2
Then length of the convolved signal, y[n] = x[n] * h[n] will be L1 + L2 1.

Scaling Property
According to this property
1

If x(t) h(t) = y(t) then x(at) h(at) = |a| y(at)

Limits of the Convolution Integral

For LTI systems, limits of the convolved signal depends on the causality of the signals to
be convolved
i) For general x(t) and h(t)

y(t) = x() h(t )d

ii) For causal x(t) and general h(t)

y(t) = 0 x() h(t )d

iii) For general x(t) and causal h(t)
t

y(t) = x() h(t )d

4|Page

iv) For causal x(t) and causal h(t)

t

y(t) = 0 x()h(t )d

Stability
A continuous time LTI system is said to be stable if the system response / impulse
response is absolutely integral otherwise it is unstable.
Similarly, for a discrete time LTI system, system is stable if its impulse response is
absolutely summable.
y[n] = x[n] * h[n]
=
k= x[k]h [n k]
To achieve the stability, output must be bounded for bounded input.
|y[n]| <
|
k= x[k] h [n k]| <

k=|x[k]||h [n k]| <

Since x[n] is bounded, let |x[n]| is bounded by Mx then,

k= Mx |h [n k]| <

k=|h [n k]| <

Or

n=|h [n]| <

Similarly, for continuous time systems

|h(t)|dt <

Some Important Convolution Results for Standard

Signals
The convolution results for some standard signals are being given as follows
(i) x(t) * (t T) = x(t T)

5|Page

The response/output of the system, when the input is impulse signal, is known as
impulse response. Convolution of any signal with the impulse signal or delta signal is
the same signal.
(ii) u(t) * u(t) = tu(t) = r(t)
Also, u(t T1) * u(t T2) = (t T1 T2) u(t T1 T2) = r(t T1 T2)
() r(t) r(t) = t u(t) t u(t) =

t3
6

u(t)

In general, we can also say that

t m u(t) t n u(t) =

t m+n+1
(m+n+1)!

() u(t T1 ) r( t T2 ) =

. u(t)
(tT1 T2 )2
2

u(t T1 T2 )

() x(t T1 ) h(t T2 ) = y (t T1 T2 )

Convolution of Finite Discrete Time Signals

Suppose we have two discrete signals given as
x[n] = {a1, a2, a3, ----, an}
h[n] = {b1, b2, b3, ----, bn}
The values in bold are the values at t = 0.
Now, we write one of the signals in a row and other one in a column

6|Page

Now, we multiply each value of the column with the row.

Then y[n] will be

y[n] = {a1b1, a1b2 + a2b1, a1b3 + a2b2 + a3b1, (a1b4 + --- + a4b1) -----, anbm}
The value in bold is value at t = 0.
We will take a look at an example.

7|Page

Example:
Find the convolution of the following signal
2
x[n] = {1, , 3, 4, 5}

h[n] = {

2
, 1, 3}

Solution:
Limits of x[n] = [-1,3], limits of h[n] = [0,2] limits of y[n] = [-1 + 0,3 +2] = [-1,5].
Forming table, we get

y[n] = {2, (
y = {2,

4
+ 1) , (3 + 2 6), (6 + 3 8), (9 + 4 10), (12 + 5), 15}

3
, 7, 11, 15, 7, 15}.

This concludes our discussion with the LTI systems. Further, we will discuss the Fourier
series formation for a signal and its properties.

Did you enjoy this article on Properties of LTI Systems? Let us know in the comments.
You may also enjoy.
Introduction to Fourier Series
Properties of Fourier Series
8|Page

Symmetry Conditions in Fourier Series

Fourier Transform

9|Page