Computing the output response

of LTI Systems.
• By breaking or decomposing and
representing the input signal to the LTI
system into terms of a linear combination of
a set of basic signals.
• Using the superposition property of LTI
system to compute the output of the system
in terms of its response to these basic
signals.
1
 General Signal Representations
By Basic Signal
• The basic signal - in particular the unit
impulse can be used to decompose and
represent the general form of any signal.
• Linear combination of delayed impulses can
represent these general signals.

2
 Response of LTI System to
General Input Signal

General Output
Input LTI SYSTEM Response
Signal Signal
Delayed
Impulse LTI SYSTEM
Signal 1

Delayed Response
Impulse
LTI SYSTEM to Impulse 3
signal N
Representation of Discrete-time
Signals in Terms of Impulses.
Discrete-time signals are sequences
of individual impulses.
x[n]
-4 -1 2 3
-3 -2 0 1 4 n

x[2] [n  2]
-4 -1 2 3
-3 -2 0 1 4 n
x[1] [n  1]
-4 -1 2 3
-3 -2 0 1 4 n 4
Discrete-time signals are sequences
of individual scaled unit impulses.
x[n]
-4 -1 2 3
-3 -2 0 1 4 n

x[2] [n  2]
-4 -1 2 3
-3 -2 0 1 4 n
x[1] [n  1]
-4 -1 2 3
-3 -2 0 1 4 n
x[0] [n]
-4 -1 2 3
5
-3 -2 0 1 4 n
 Shifted Scaled Impulses

x[n]  ...  x[3] [n  3]  x[2] [n  2]  x[1] [n  1]  x[0] [n]

 x[1] [n  1]  x[2] [n  2]  x[3] [n  3]  .....
Generally:-

x[n]   x[k ] [n  k ],
k  

The arbitrary sequence is represented by a linear combination of

shifted unit impulses [n-k] , where the weights in this linear
combination are x[k].
The above equation is called the sifting property of discrete-time unit
impulse.
6
As Example consider unit step signal x[n]=u[n]:-

x[n]  u[n]  ...  0. [n  3]  0. [n  2]  0. [n  1]  1. [n]

 1. [n  1]  1. [n  2]  1. [n  3]  .....
Generally:-

u[n]  1. [n  k ],
k 0
The unit step sequence is represented by a linear combination of


shifted unit impulses [n-k] , where the weights in this linear
combination are ones from k=0 right up to k
This is identically similar to the expression we have derived,
when we dealt with unit step.
7
 The Discrete-time Unit Impulse
Responses and the Convolution
Sum Representation

• To determine the output response of an LTI

system to an arbitrary input signal x[n], we
make use of the sifting property for input
signal and the superposition and time-
invariant properties of LTI system.

8
Convolution Sum Representation
• The response of a linear system to x[n] will
be the superposition of the scaled responses
of the system to each of these shifted
impulses.
• From the time-invariant property, the
response of LTI system to the time-shifted
unit impulses are simply time-shifted
responses of one another.
9
 Unit Impulse Response h[n]

[n] ho[n]
LTI System
0
n0

[n-k] hk[n]
k LTI System

n=k
10
 Response to scaled unit
impulse input x[n][n-k]
x[-k].[n+k] x[-k].h-k[n]
-k LTI System
n=-k

x[0].[n] x[0].ho[n]
LTI System
0
n0
x[+k].[n-k]
k LTI System x[+k].hk[n]
nk

11
 Output y[n] of LTI System
With the input x[n] being expressed as
the delayed train of scaled impulses we have : -

y[n]   x[k].h
k - 
k [n].

Thus, if we know the response of a linear system to

the set of shifted unit impulses, we can construct the
response y[n] to an arbitrary input signal x[n].
12
h-1[n] x[n]

h0[n]

h1[n]

13
 x[-1]h-1[n]
x[-1][n+1]
0 0

x[0]h0[n]
x[0][n]
0 0
x[1][n-1] x[1]h1[n]

0 0

x[n] y[n]
0
0

14
• In general, the response hk[n] need not be
related to each other for different values of
k.
• If the linear system is also time-invariant
system, then these responses hk[n] to time
shifted unit impulse are all time-shifted
versions of each other.
• I.e. hk[n]=h0[n-k].
• For notational convenience we drop the
subscript on h0[n] =h[n].
• h[n] is defined as the unit impluse (sample)15
response
 Convolution sum or
Superposition sum.

y[n]   x[k ].h[n  k ]
k  

Convolution operation
notation given by : -
y[n]  x[n] * h[n] 16
 Convolution sum or Superposition sum.

x[k]

h[k]


y[0]   x[k ]h[0  k ]  0.5
k  

17
 Convolution sum or Superposition sum.

x[k]

h[k]


y[0]   x[k ]h[0  k ]  0.5
k  

y[1]   x[k ]h[1  k ]  2.5
k  

18
 Convolution sum or Superposition sum.

x[k]

h[k]


y[0]   x[k ]h[0  k ]  0.5
k  

y[1]   x[k ]h[1  k ]  2.5
k  

y[2]   x[k ]h[2  k ]  2.5
k  

19
Convolution sum or Superposition sum.

x[k]

h[k]


y[0]   x[k ]h[0  k ]  0.5
k  

y[1]   x[k ]h[1  k ]  2.5
k  

y[2]   x[k ]h[2  k ]  2.5
k  


y[3] 


 x[k ]h[3  k ]  2.0 y[n]   x[k ] h[n  k ]

k  
20
y[n]=x[0]h[n-0]+x[1]h[n-1]= 1 1 h[n]
1
0.5h[n]+2h[n-1]
x x x x
0
0.5
1 x[n]
0

0.5 0.5h[n]

2 2 2
2h[n-1]

2.5 2.5

2 y[n]
0.5
21