Scribd
Upload
39 views

EEE223 Signals & Systems Fall 2010

This lecture discusses properties of linear time-invariant (LTI) systems, including: 1) Systems can have memory or be memoryless. Memoryless systems' outputs only depend on the current input, while systems with memory have outputs that depend on past inputs as well. 2) Invertible systems can have their input reconstructed from their output through another system. 3) Causal systems only respond to present and past inputs, not future inputs. 4) Stable systems have bounded outputs for bounded inputs. The impulse response of a stable system must be absolutely integrable/summable.

Uploaded by

Muhammad Usman Ghani
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
39 views

EEE223 Signals & Systems Fall 2010

This lecture discusses properties of linear time-invariant (LTI) systems, including: 1) Systems can have memory or be memoryless. Memoryless systems' outputs only depend on the current input, while systems with memory have outputs that depend on past inputs as well. 2) Invertible systems can have their input reconstructed from their output through another system. 3) Causal systems only respond to present and past inputs, not future inputs. 4) Stable systems have bounded outputs for bounded inputs. The impulse response of a stable system must be absolutely integrable/summable.

Uploaded by

Muhammad Usman Ghani
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

EEE223 Signals & Systems

Fall 2010

Lecture 9
Outline
• Some properties of the Unit Impulse/Sample
• Properties of LTI Systems
• Systems with and without memory
• Invertible systems
• Causal Systems
• Stable Systems
Some properties of δ(t), δ[n]
x* δ[n], δ(t)
x* δ(t-to )
x* δ[n-no]
With and without memory
 System is memoryless if output at any time
ONLY depends on input at the same time
 For DT LTI systems:


y[ n ]   x [ k ] h[ n  k ]
k  
 this can only be true if h[n]=0 for n≠0
 ⇒ h[n] = Kδ[n], or K=h[0]=constant and

y[ n ]  Kx [ n ]
With and without memory
 For CT LTI systems:

y (t )   x ( ) h (t   ) d 

 System is memoryless only if h(t)=0 for t≠0
 ⇒ h(t)= Kδ(t), or K=constant and

y ( t )  Kx ( t )
Invertible LTI Systems
• Invertible, if we can design h1(t) such that:

x(t) h(t) h1(t) x(t)

• This implies: h*h1 = δ(t)


• Similarly for DT, h*h1 = δ[n]
• Why?
• Example: pure time shift: h(t)= δ(t-to), h1(t)=?
• Example: accumulator: h[n]=u[n], h1[n]=?
Causal systems
 Do not respond until they receive an input
 i.e. Output depends only on present and past

values of the input


 y[n] must depend on x[k] where k<=n
 This will be true iff h[n]=0 for n<0
 Convolution sum is?

 CT systems are causal iff h(t)=0 for t<0


 Convolution integral is?
Stable systems
• Bounded input leads to bounded output
Let x[n]  K for all n
then
 
y[n]   h[k ]x[n  k ]   h[k ] x[n  k ]
k   k  

y[n]  K  h[k ]
k  
for all n

For y[n] to be bounded ,  h[k ]  
k  
Stable systems
• Bounded input leads to bounded output
Let x(t )  K for all t
then
 
y (t )   h( )x(t   )d   h( ) x(t   ) d
 

y (t )  K  h( ) d


For y (t ) to be bounded ,  h( ) d  

Stable systems
• Examples:
• h[n]=δ[n-no]?
• h[n]=u[n]?
• h(t)= δ(t-to)?
• H(t)=u(t)?
Enough for today!

You might also like