Chapter 4 - System Representation
Chapter 4 - System Representation
CONTROL PRINCIPLE
CHAPTER 4
System Representation
Block Diagram
Signal Flow Graph
Block Diagram
A block diagram of a system is a practical representation of the
functions performed by each component and of the flow of
signals.
Components of a block diagram:
Cascade Form
Therefore,
Y ( s ) = G ( s )[ R( s ) − H ( s )Y ( s )]
Y (s) G (s)
=
R( s) 1 + G ( s) H ( s)
Block Diagram Reduction
Reduction Rules
Block Diagram Reduction
Reduction Rules
Block Diagram Reduction
Rules:
1. Rearrange summing junction for loops.
2. Simplified loops and combine any cascade block.
3. Get transfer function.
Example 1:
Example 2:
3
C (s) s +1
= 4 2
R( s) 2s + s + 2s
Problem
Find transfer function Y(s)/U(s)
Solution:
U(s) G1G2G3G4 Y(s)
1 − G3G4 H1 + G2G3 H 2 + G1G2G3G4 H 3
Signal Flow Graph Models
A signal flow graph is a graphical representation of the
relationships between the variables of a set of linear algebraic
equations.
The basic element of a signal-flow graph is a unidirectional
path segment called a branch.
The input and output points or junctions are called nodes.
A path is a branch or continuous sequence of branches that can
be traversed from one signal (node) to another signal (node).
A loop is a closed path that originates and terminates on the
same node, and along the path no node is met twice.
Two loops are said to be nontouching if they do not have a
same common node.
Signal Flow Graph Models
∑P ∆ k k
T= k
Where,
∆
k = Number of forward path
Pk = The kth forward-path gain
The paths connecting the input R(s) and output Y(s) are
Path 1: P1 = G1G2G3G4
Path 2: P2 = G5G6G7 G8
Signal Flow Graph Models
There are four individual loops:
L1 = G2 H 2
L2 = G3 H 3
L3 = G6 H 6
L4 = G7 H 7
Loops L1 and L2 do no touch L3 and L4 . Therefore the determinant is
∆ = 1 − ( L1 + L2 + L3 + L4 ) + ( L1 L3 + L1 L4 + L2 L3 + L2 L4 )
The cofactor of the determinant along path 1 is evaluated by removing
the loops that touch path 1 from ∆ . Therefore we have
L1 = L2 = 0 and ∆1 = 1 − ( L3 + L4 )
Y ( s) P1∆1 + P2 ∆ 2
= T (s) =
R( s) ∆
G1G2G3G4 (1 − L3 − L4 ) + G5G6G7G8 (1 − L1 − L2 )
=
1 − L1 − L2 − L3 − L4 + L1 L3 + L1 L4 + L2 L3 + L2 L4
Signal Flow Graph Models
Problem: Obtain closed-loop transfer function by use of Mason’s gain forward
Further Reading