L10 Control Systems - Mason S Gain Formula
L10 Control Systems - Mason S Gain Formula
Let us now discuss the Mason’s Gain Formula. Suppose there are ‘N’ forward paths in a
signal flow graph. The gain between the input and the output nodes of a signal flow graph
is nothing but the transfer function of the system. It can be calculated by using Mason’s
gain formula.
𝐶(𝑠) ∑𝑁𝑖=1 𝑃𝑖 ∆𝑖
𝑇= =
𝑅(𝑠) ∆
Where,
∆𝒊 𝑖𝑠 𝑜𝑏𝑡𝑎𝑖𝑛𝑒𝑑 𝑓𝑟𝑜𝑚 ∆ 𝑏𝑦 𝑟𝑒𝑚𝑜𝑣𝑖𝑛𝑔 𝑡ℎ𝑒 𝑙𝑜𝑜𝑝𝑠 𝑤ℎ𝑖𝑐ℎ 𝑎𝑟𝑒 𝑡𝑜𝑢𝑐ℎ𝑖𝑛𝑔 𝑡ℎ𝑒 𝑖 𝑡ℎ 𝑓𝑜𝑟𝑤𝑎𝑟𝑑 𝑝𝑎𝑡ℎ.
[
Consider the following signal flow graph in order to understand the basic terminology
involved here.
Path
It is a traversal of branches from one node to any other node in the direction of branch
arrows. It should not traverse any node more than once.
Examples: 𝑦2 → 𝑦3 → 𝑦4 → 𝑦5 and 𝑦5 → 𝑦3 → 𝑦2 .
41
Control Systems
Forward Path
The path that exists from the input node to the output node is known as forward path.
Examples: 𝑦1 → 𝑦2 → 𝑦3 → 𝑦4 → 𝑦5 → 𝑦6 and 𝑦1 → 𝑦2 → 𝑦3 → 𝑦5 → 𝑦6 .
Loop
The path that starts from one node and ends at the same node is known as loop. Hence,
it is a closed path.
Examples: 𝑦2 → 𝑦3 → 𝑦2 and 𝑦3 → 𝑦5 → 𝑦3 .
Loop Gain
It is obtained by calculating the product of all branch gains of a loop.
Non-touching Loops
These are the loops, which should not have any common node.
42
Control Systems
Higher number of (more than two) non-touching loops are not present in this signal flow
graph.
We know,
So, ∆1 = 1.
𝐶(𝑠) ∑2𝑖=1 𝑃𝑖 ∆𝑖
𝑇= =
𝑅(𝑠) ∆
𝐶(𝑠) 𝑃1 ∆1 + 𝑃2 ∆2
𝑇= =
𝑅(𝑠) ∆
43