Professional Documents
Culture Documents
A signal flow graph is a graphical representation of the relationships between the variables of
the system. It is an alternative approach to block diagram representation.
A signal flow graph consists of:
Node: A point which represent signals of the system and are labelled with signal names.
Branch: A line which provides a path for the flow of signal from one node to another. They
represent system blocks and are labelled with system transfer functions.
Fig.1
Input node/Source node: Node with only outgoing branches.
Output node/Sink node: Node with only incoming branches.
Path: A traversal of connected branches as per the direction indicated by the arrow on the
branch such that no node is traversed more than once.
Fig. 2
Forward Path: A path connecting the input and the output node.
Forward path gain: Gain along any path from the input to the output
Fig. 2 has two forward paths with the following gains:
∆
=
∆
Where,
TF = Transfer Function
Pk = Gain of the kth forward path
Δk = the part of Δ not touching the kth forward path.
Δ = 1 – [sum of individual loop gains] + [sum of gain products of all combinations of two non-
touching loops] − [sum of gain products of all combinations of three non-touching loops] + …
[sum of gain products of all combinations of n non-touching loops]
Note the alternate change of signs.
G5(s)
-H3(s) H1(s)
-H2(s)
Solution:
i) Determining forward path gains (Pk);
There are 2 forward paths i.e. P=2
Gain of the 1st forward path, =
Gain of the 2nd forward path, =
ii) Determining ∆
The given signal flow graph has 3 loops with the following loop gains:
=− , = , =−
Sum of individual loop gains is;
+ + =− + −
Sum of gain products of all combinations of two non-touching loops:
Gain product of 1st combination is = (− )×( )=−
nd
Gain product of 2 combination is = (− ) × (− )=
The sum of the 2 combinations will be: − +
∆= 1 − ( + + )+( + )
∆= 1 − (− + − ) + (− + )
∆= + − + − +
iii) Determining ∆
To obtain ∆ , make the gains of all the branches touching the forward path P1 to be zero in the
equation for ∆ above.
∆ = 1 − (0 + 0 + 0) + (0 + 0)
∆ =1
G5(s)
-H3(s) H1(s)
-H2(s)
To obtain ∆ , make the gains of all the branches touching the forward path P2 to be zero in the
equation for ∆ above
∆ = 1 − (0 + 0 + 0) + (0 + 0)
∆ =1
Therefore,
=2
=
=
∆= 1 + − + − +
∆ =1
∆ =1
Substituting into
∆
=
∆
Solution
i) Determining forward path gains (Pk)
There are 2 forward paths i.e. P=2
The 1st identified forward path is highlighted, and therefore the gain for the path is;
=
The 2nd identified forward path is highlighted as shown and the path gain is given by
=
Since all are touching the forward path P1, we make them all 0.
∆ =1−0+0+0−0=1
To obtain ∆ , make the gains of all the branches touching the forward path P2 to be zero in
the equation for ∆ above
=0
Substituting in the equation for ∆
∆ =1− +0+0− ×0=1−
∆ + ∆
=
∆
(1) + (1 − )
=
1− + + −
+ −
=
− + + −
Example 3: The figure below shows a signal flow graph of a control system. Determine
the system gain using Mason’s formula.
Solution
i) Determining forward path gains (Pk)
There are 3 forward paths i.e. P=3
The path-gain for the 1st identified forward path is
=
iii) Determining ∆
To obtain ∆ , make the gains of all the branches touching the forward path P1 to be zero in
the equation for ∆ above.
Since all are touching the forward path P1, P2, P3, we make them all 0
∆ =1−0+0+0=1
∆ =1−0+0+0=1
∆ =1−0+0+0=1
Substituting in the equation for ∆
∆ + ∆ + ∆
=
∆
(1) + (1) + (1)
=
1−( + + )
( + ) +
=
−( + + )
Check this link for further knowledge: https://www.youtube.com/watch?v=9eAzSCKuGtc
2.5
Example 5: Draw a signal flow graph for the following set of linear equations
=4 +3 +2
=7
=5 +6 +9
=3 +8
x1 4 x2 7 x3 6 x4 x5
8
3
5
3
H1 G4
R(s) 1 1 G2 G3 1 C(s)
G1
H2
−
Q2 The Figure 1 below shows a block diagram of a control system. (20mks)
Figure 1
i) Draw a signal flow graph for the block diagram
ii) Use Mason’s gain formula to determine the transfer function