5 Block Diagram Representation of LTI Systems
5 Block Diagram Representation of LTI Systems
Given a more complicated block diagram (many interconnected blocks). The following trans-
formations can simplify/reduce the BD to a smaller one between a specific input and output.
2. Parallel transformation
G1 (s)
R(s) b
Y (s) ⇒ R(s) G1 (s) + G2 (s) Y (s)
G2 (s)
. G(s)
R(s) G(s) b
Y (s) ⇒ R(s) 1+H(s)G(s) Y (s)
−
Closed loop transfer function
H(s)
Ea (s)
R(s) Gr (s) Gc (s) Gp (s) b
Y (s)
−
H(s)
Gc (s)Gp (s)
• 1+Gc (s)Gp (s)H(s) is the Closed-loop transfer function
G (s)G (s)
• T (s) = Y(s)/R(s) = Gr (s) 1+Gcc(s)Gpp(s)H(s) : is the total transfer function
Dr.Guernane 16
EE352 Lectures:04 Spring 2023
• If Gr (s) = H(s) = 1, the control system is called unity feedback, otherwise it is called
non-unity feedback.
MATLAB tips:
1. There are commands to compute the equivalent of a series, parallel or feedback systems.
after defining (creating) them you can do:
2. For example the total TF T (s) of the above block diagram can be computed in matlab using
the compound statement:
>> T=series(Gr,feedback(series(Gc,Gp),H)))
Dr.Guernane 17
EE352 Lectures:04 Spring 2023
D(s)
H(s)
Using superposition:
But how to compute The transfer function of more complicated block diagrams when there are no
reductive transformation to apply directly? Consider the:
– X(s) b
G(s) Y (s) ⇐⇒ –
X(s) G(s) b
Y (s)
1
V (s) V (s) G(s)
– X(s) G(s) b
Y (s) –
⇐⇒ X(s) b
G(s) Y (s)
Dr.Guernane 18
EE352 Lectures:04 Spring 2023
1
V (s) G(s) V (s)
Example: Using Block diagram transformations, compute the transfer function Y(s)/R(s)?
R(s) G1 (s) b
G2 (s) b
G3 (s) b
Y (s)
− − −
H2 (s) H3 (s)
H1 (s)
Chapter highlights:
• Mathematical models approximate the physical relationship between the a system output
and input.
• Generally, the more accurate the model, the more complicated it is.
• All these models are input/output (or external) representations since they relate the output
to the input without any intermediate (or internal) variables.
• Complex block diagrams can be simplified to one block by using both reductive transforma-
tions (series, parallel, feedback) and rearranging transformations.
Dr.Guernane 19
Chapter III
2. Input tracking: the output should be as close to the input (desired output) as possible
(a) Steady-state tracking: reduce the error between input and output in steady-state
(b) Transient tracking: reduce the error between input and output at the transient-phase.
3. Insensitivity to system parameter: The system should be the least sensitive to parameter
changes or uncertainty.
Theorem 2. A LTI system is said to be (BIBO) stable if its impulse response is absolutely integrable:
Z +∞
|h(τ)| dτ < M
−∞
Let the LTI system be described by its transfer function H(s) = L(h(t)). What is the condition
on H(s) for the system to be stable?
X
h(t) = mode(pi )
i
Where pi is the pole of H(s). a mode is the time-response (or ILT) that correspond to a pole term in the PFE
of H(s), For instance e−2t , us (t) and et are the mode that corresponds to the pole −2, 0 and 1 respectively.
Condition:
modet→∞ (pi ) → 0 ∀pi
Theorem 3. A LTI system is (BIBO) stable if and only if the all the poles of H(s) lie in the LHP (σ < 0)
20
EE352 Lectures:04 Spring 2023
Notice How the pole location determine whether the corresponding time response (or mode)
is absolutely integrable or not.
In the following figure, its can be seen that only poles in the LHP results in absolutely integrable
modes.
Dr.Guernane 21
EE352 Lectures:04 Spring 2023
Definition: A system is said to be Marginally unstable (or marginally stable) iff it is an unstable system
with no poles in the RHP and no repeated poles on the jω axis
Examples:
s−1
1. G(s) = s(s+3) marginally stable
s−1
2. G(s) = (s+2)(s+3) stable
s−1
3. G(s) = (s−2)(s+3)(s2 +1)
unstable
s+21
4. G(s) = (s+1)(s2 +2)
marginally unstable
2
5. G(s) = s2 (s2 +2)
unstable
R
−
+ +
−vi (t) − vo (t)
Dr.Guernane 22