Control Systems 1
Signal Flow Graphs
For complicated systems, Block diagram reduction method becomes tedious & time consuming. An
alternate method is that signal flow graphs developed by S.J. Mason. In these graphs, each node represents
a system variable & each branch connected between two nodes acts as Signal Multiplier. The direction of
signal flow is indicated by an arrow.
Definitions:
1. Node: A node is a point representing a variable.
2. Transmittance: A transmittance is a gain between two nodes.
3. Branch: A branch is a line joining two nodes. The signal travels along a branch.
4. Input node [Source]: It is a node which has only out going signals.
5. Output node [Sink]: It is a node which is having only incoming signals.
6. Mixed node: It is a node which has both incoming & outgoing branches (signals).
7. Path: It is the traversal of connected branches in the direction of branch arrows. Such that no node
is traversed more than once.
8. Loop: It is a closed path.
9. Loop Gain: It is the product of the branch transmittances of a loop.
10. Non-Touching Loops: Loops are Non-Touching, if they do not possess any common node.
11. Forward Path: It is a path from i/p node to the o/p node w hich doesn’t cross any node m ore than
once.
12. Forward Path Gain: It is the product of branch transmittances of a forward path.
M ASO N ’S GAIN FO RM U LA:
The relation between the i/p variable & the o/p variable of a signal flow graphs is given by the net
gain between the i/p & the o/p nodes and is known as Overall gain of the system.
Mason’s gain form ula for the determ ination of overall system gain is given by,
Where, – Path gain of forward path.
Determinant of the graph.
The value of the for that part of the graph not touching the forward path.
T Overall gain of the system.
2 Signal Flow Graphs
Problems:
(1) Obtain the closed loop TF, by using M ason’s gain form ula.
C(S)
R(S)
Solution:
M ason’s gain form ula is,
No. of forward paths:
No. of individual loops: Gain Products of all possible combinations of two non-touching loops:
No. of three non-touching loops = 0.
(2) Obtain the closed loop TF, by using M ason’s gain form ula.
R(S) C(S)
Solution:
M ason’s gain form ula is,
Forward Paths:
Control Systems 3
No. of individual loops: Two Non-touching loops:
(3) Construct a signal flow graph from the following equations. Obtain overallTF using M ason’s gain form ula.
Where is i/p variable & is o/p variable.
Solution:
No. of forward paths:
Individual loops: Two non-touching loops:
Three non-touching loops = 0
M ason’s gain form ula is,
(4) Obtain by Block Diagram Reduction method & verify the result by signal flow graph.
+
R(S) C(S)
-
+
+
4 Signal Flow Graphs
Solution: Re-arranging the summing points,
R(S) C(S)
- -
R(S) C(S)
Signal flow graphs:
R(S) C(S)
No. of forward paths:
No. of individual loops:
M ason’s gain form ula is,
(5) Obtain the TF & Verify by signal flow graph.
+
R(S) C(S)
- -
Solution: Shifting the take-off point ahead of the block . The BD reduces to,
+ C(S)
R(S)
- -
Control Systems 5
R(S) C(S)
-
R(S) C(S)
C(S)
R(S)
Signal flow graph:
R(S) C(S)
No. of forward paths:
No. of individual loops:
(6) Reduce the Block Diagram shown.
R(S)
- C(S)
- - +
Solution:
Shifting beyond , we get
R(S)
- C(S)
- - +
6 Signal Flow Graphs
Eliminating feed back loop , we get
R(S) C(S)
- - +
Eliminating feed back loop , we get
R(S) C(S)
- +
R(S) C(S)
- +
Eliminating the another feed back loop , we get
R(S) C(S)
R(S) C(S)
Signal flow graph:
R(S) C(S)
Control Systems 7
No. of forward paths:
No. of individual loops:
(7) Obtain the closed loop TF by using M ason’s gain form ula.
R(S) C(S)
Solution:
No. of forward paths:
No. of individual loops: Two non-touching loops:
(8) Obtain the TF of the closed loop control system represented by the Block Diagram shown below using
block diagram reduction method.
- -
Solution:
Shifting the take off point of beyond block & Simplifying for the blocks , we get
- -
8 Signal Flow Graphs
Eliminating loop, we get
(9) U sing M ason’s gain rule, obtain the overall TF of a control system represented by the signal flow graph
shown below.
Solution:
No. of forward paths:
Individual loops:
Two non-touching loops = 0
(10) Construct signal flow graph from the following equations & obtain the overall TF.
Control Systems 9
Solution:
No. of forward paths:
No. of individual loops: Two non-touching loops:
Three non-touching loops:
Four non-touching loops = 0
(11) O btain the TF using M ason’s gain form ula.
10 Signal Flow Graphs
Solution:
No. of forward paths:
No. of individual loops:
Two non-touching loops:
Three non-touching loops = 0
(12) Obtain the TF using M ason’s gain form ula.
Solution:
No. of forward paths: No. of individual loops:
Two non-touching loops:
(13) O btain the TF using M ason’s gain form ula.
Control Systems 11
Solution:
No. of forward paths:
No. of individual loops: Two non-touching loops:
Three non-touching loops = 0
(14) Draw the signal flow graph for the Block Diagram shown in fig. Hence obtain , Using
M ason’s gain form ula.
Solution:
No. of forward paths: No. of individual loops:
– Two non-touching loops:
–
12 Signal Flow Graphs
Three non-touching loops = 0
(15) Obtain TF, using block diagram algebra & also by using Masons Gain Formula. Hence Verify
the TF in both the methods.
Solution:
Same block diagram can be re-arranged as shown below.
Shifting the take-off points beyond we get
Control Systems 13
Substituting ‘x’ value in the block diagram . T he block diagram becom es,
Signal flow graph:
No. of forward paths:
No. of individual loops: Two non-touching loops = 0
(16) Obtain TF, using block diagram algebra & also by using Masons Gain Formula. Hence Verify
the TF in both the methods.
14 Signal Flow Graphs
Solution:
Same Block Diagram can be written as,
Substituting the value of ‘x’
Signal flow Graph:
Control Systems 15
No. of forward paths:
No. of individual loops: Two non-touching loops = 0
(17) Find the output
Solution:
(i) Let then we can find
No. of forward paths:
No. of individual loops: Two non-touching loops:
Three non-touching loops = 0
16 Signal Flow Graphs
(ii) Let Determine
No. of forward paths:
No. of individual loops:
‘ ’ rem ains sam e.
(iii) Let Determine
No. of forward paths:
‘ ’rem ains sam e.
(iv) Let Determine
(i.e., R esponse at ‘2’ w hen source ‘2’ is acting).
(figure is in next page)
No. of forward paths:
‘ ’rem ains sam e.
Control Systems 17
Hence,
