Time-Domain Representations of LTI Systems

Relation Between LTI System Properties and the

Impulse Response

Memory-less LTI Systems

1. The output of a discrete-time LTI system:


y[n]  h[n]  x[n]   h[k ]x[n  k ]
k 

y[n]   h[ 2]x[n  2]  h[1]x[n  1]  h[0]x[n]  h[1]x[n  1]  h[2]x[n  2] 

1
 Time-Domain Representations of LTI Systems
2. To be memoryless, y[n] must depend only on x[n] and therefore cannot
depend on x[n  k] for k  0.
A discrete-time LTI system is memoryless if and only if
h[k ]  c [k ] c is an arbitrary constant
 Continuous-time system:
1. Output:

y(t )   h( )x(t  )d ,


2. A continuous-time LTI system is memoryless if and only if

h( )  c ( ) c is an arbitrary constant

2.7.2 Causal LTI Systems

The output of a causal LTI system depends only on past or present values
of the input.
 Discrete-time system:
1. Convolution sum: y[n]   h[2]x[n  2]  h[1]x[n  1]  h[0]x[n]
 h[1]x[n  1]  h[2]x[n  2]  .
2
 Time-Domain Representations of LTI Systems
2. For a discrete-time causal LTI system,
h[k ]  0 for k  0
3. Convolution sum in new form:

y[n]   h[k ]x[n  k ].
k 0

 Continuous-time system:
1. Convolution integral: 3. Convolution integral in new form:
 
y(t )   h( ) x(t  )d . y(t )   h( ) x(t   )d .
 0

2. For a continuous-time causal LTI system,

h( )  0 for   0
2.7.3 Stable LTI Systems
A system is BIBO stable if the output is guaranteed to be bounded for every
bounded input.
 Discrete-time case: Input x[n]  M x   Output: y[n]  M y  
3
 Time-Domain Representations of LTI Systems
1. The magnitude of output:

y[n]  h[n]  x[n]   h[k ]x[n  k ]
k 


y[n]   h[k ]x[n  k ] ab  a  b
k 

ab  a b
y[n]  
k 
h[k ] x[n  k ]

2. Assume that the input is bounded, i.e.,

x[n]  M x   x[n  k ]  M x
and it follows that
multiply both sides by
 summation of h[k]
y[n]  Mx  h[k] (2.28)
k 

Hence, the output is bounded, or y[n] ≤  for all n, provided that the impulse
response of the system is absolutely summable.
3. Condition for impulse response of a stable discrete-time LTI system:
4
 Time-Domain Representations of LTI Systems


 h[k ]  .
k 

 Continuous-time case:
Condition for impulse response of a stable continuous-time LTI system:

 h( ) d  


Example 2.12 Properties of the First-Order Recursive System

The first-order system is described by the difference equation
y[n]   y[n 1]  x[n]
and has the impulse response
h[n]   nu[n]
Is this system causal, memoryless, and BIBO stable?
<Sol.>
1. The system is causal, since h[n] = 0 for n < 0.
2. The system is not memoryless, since h[n]  0 for n > 0.
3. Stability: Checking whether the impulse response is absolutely summable?
5
 Time-Domain Representations of LTI Systems
  

 h[k ]        
k k
if and only if  < 1
k  k 0 k 0

◆ Note:
A system can be unstable even though the impulse response has a finite value.
1. Ideal integrator:
t
y(t)   x( )d (2.29)


Input: x() =  (), then the output is y(t) = h(t) = u(t).

h(t) is not absolutely integrable
Ideal integrator is not stable!
2. Ideal accumulator:
n
y[n]   x[k ]
k 

Impulse response: h[n] = u[n]

h[n] is not absolutely summable
Ideal accumulator is not stable!
6