Professional Documents
Culture Documents
Description of Systems
1
M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl
System Examples
Feedback Systems
In a feedback system the response of the system is fed back
and combined with the excitation is such a way as to optimize
the response in some desired sense. Examples of feedback
systems are
1. Temperature control in a house using a thermostat
2. Water level control in the tank of a flush toilet.
3. Pouring a glass of lemonade to the top of the glass without
overflowing.
4. A refrigerator ice maker which keeps the bin full of ice
but does not make extra ice.
5. Driving a car.
Systems
Zero-State Response of an RC
Lowpass Filter to a Step Excitation
()
) ()
()
()
Zero-Input Response of an RC
Lowpass Filter
10
Homogeneity
In a homogeneous system, multiplying the
excitation by any constant (including complex
constants), multiplies the zero-state response by the
same constant.
()
11
12
Homogeneity
Homogeneity
Let y ( t ) = exp ( x ( t )) . Is this system homogeneous?
Let x ( t ) = g ( t ) . Then y ( t ) = exp ( g ( t )) .
Let x ( t ) = K g ( t ) . Then y ( t ) = exp ( K g ( t )) = exp ( g ( t ))
homogeneous.
If g(t)
y1 ( t ) and K g(t)
K y1 ( t )
H
H is Homogeneous
M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl
() ()
Let x ( t ) = g ( t ) . Then y ( t ) = g ( t ) + 2.
Let x ( t ) = K g ( t ) . Then y ( t ) = K g ( t ) + 2
K y ( t ) = K g ( t ) + 2K y ( t ) K y ( t ) , Not homogeneous
Let y t = x t + 2. Is this system homogeneous?
13
Time Invariance
14
Time Invariance
Let y ( t ) = exp ( x ( t )) . Is this system time invariant?
Let x ( t ) = g ( t ) . Then y ( t ) = exp ( g ( t )) .
Let x ( t ) = g ( t t ) . Then y ( t ) = exp ( g ( t t ))
y ( t t ) = exp ( g ( t t )) y ( t ) = y ( t t ) , Time Invariant
() ( )
() ()
() ( )
Let x ( t ) = g ( t t ) . Then y ( t ) = g ( t / 2 t )
y ( t t ) = g (( t t ) / 2 ) y ( t ) y ( t t ) , Time Variant
Let y t = x t / 2 . Is this system time invariant?
Let x1 t = g t . Then y1 t = g t / 2 .
2
15
Additivity
16
Additivity
( ) ( ( ))
Let x ( t ) = g ( t ) . Then y ( t ) = u ( g ( t )) .
Let x ( t ) = h ( t ) . Then y ( t ) = u ( h ( t )) .
Let x ( t ) = g ( t ) + h ( t ) . Then y ( t ) = u ( g ( t ) + h ( t ))
y ( t ) + y ( t ) = u ( g ( t )) + u ( h ( t )) u ( g ( t ) + h ( t )) . Not additive.
(For example, at time t = 3, if g ( 3) = 4 and h ( 3) = 2,
y ( 3) + y ( 3) = u ( 4 ) + u ( 2 ) = 1+ 1 = 2. But y ( 3) = u ( 4 + 6 ) = 1.)
Let y t = u x t . Is this system additive?
1
and g ( t ) + h ( t ) H y1 ( t ) + y 2 ( t ) H is Additive
M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl
17
18
()
( )
()
) ( )
( )
0.25rect ( t / 4 ) or into any other convenient sum of functions that
equals x ( t ) .
those responses. Let x t = rect t / 4 . We could break x t
19
Stability
21
Memory
22
Static Non-Linearity
Many real systems are non-linear because the
relationship between excitation amplitude and
response amplitude is non-linear
20
Causality
23
24
Static Non-Linearity
Invertibility
25
Dynamics of Second-Order
Systems
Dynamics of Second-Order
Systems
()
v out t = K1e
+ 2 2 t
n
+ K2e
2 2 t
n
26
+ 2 2 t
n
2 2 t
n
+ K 2 e
applies
+A
damping ratio.
27
28
Discrete-Time Systems
29
30
Discrete-Time Systems
In a discrete-time system events occur at points in time but not
between those points. The most important example is a digital
computer. Significant events occur at the end of each clock
cycle and nothing of significance (to the computer user) happens
between those points in time.
Discrete-time systems can be described by difference (not
differential) equations. Let a discrete-time system generate an
excitation signal y[n] where n is the number of discrete-time
intervals that have elapsed since some beginning time n = 0.
Then, for example a simple discrete-time system might be
described by
y [ n ] = 1.97 y [ n 1] y [ n 2 ]
31
Discrete-Time Systems
32
Discrete-Time Systems
y [ n ] = 1.97 y [ n 1] y [ n 2 ]
The equation
y [ n ] = 1.97 y [ n 1] y [ n 2 ]
Initial Conditions
says in words
yn = 1 ; yn1 = 0 ;
while 1,
The signal value at any time n is 1.97 times the signal value at the
previous time [ n 1] minus the signal value at the time before that
end
[ n 2 ].
If we know the signal value at any two times, we can compute its
value at all other (discrete) times. This is quite similar to a
33
Discrete-Time Systems
34
y [ n ] = 1.97 y [ n 1] y [ n 2 ]
input) response is y [ n ].
35
36
the forcing function (1 / 3) and all its unique differences. The first
n
backward difference of (1 / 3) is (1 / 3) (1 / 3)
n
y [ 0 ] = K (1 / 2 ) = K = 3 and y [ n ] = 3(1 / 2 ) .
0
n1
37
38
A System
Kp =
(1 / 3)
5 (1 / 3) 3(1 / 3)
n
n 1
n 1
= (1 / 3) . Solving,
n
1/ 3
= 1 / 4. Then the total
5 (1 / 3) 3
n
y [ n ] = 5 4 ( 4 / 5 ) u [ n ]
conditions y [ 0 ] = K ( 3 / 5 ) (1 / 4 ) (1 / 3) = K 1 / 4 = 1
0
39
A System
40
System Properties
41
42
43