Signal Flow Graph (SFG)
Introduction: Block diagram reduction is the excellent method for determining the transfer function of the control system. However, in a complicated system, it is very difficult and time-consuming process that is why an alternate method, i.e., SFG was developed by S.J Mason which relates the input and output system variables graphically. In the signal flow graph, the transfer function is referred to as transmittance.
Characteristics of SFG: SFG is a graphical representation of the relationship between the variables of a set of linear algebraic equations. It doesn’t require any reduction technique or process.
- It represents a network in which nodes are used for the representation of system variable which is connected by direct branches.
- SFG is a diagram which represents a set of equations. It consists of nodes and branches such that each branch of SFG having an arrow which represents the flow of the signal.
- It is only applicable to the linear system.
Terms used in SFG
Node: It represents the system variable which equals to the sum of all signals. Outgoing signal from the node does not affect the value of node variables.
Branch: Branch is defined as a path from one node to another node, in the direction indicated by the branch arrow.
Node as a summing point:
x1 = Summing point x1 = x2+x3+x4
Node as a transmitting (outgoing) point:
x1 = x5+x6
Input node or source: It is the node which have only outgoing branches.
Output node or sink: It is a node which has only incoming branches.
Forward Path: It is a path from an input node to an output node in the direction of branch arrow.
Loop: It is a path that starts and ends at the same node.
Non-touching loop: Loop is said to be non-touching if they do not have any common node.
Forward path gain: A product of all branches gain along the forward path is called Forward path gain.
Loop Gain: Loop gain is the product of branch gain which travels in the loop.
Construction of SFG and Mason Gain Formula:
The SFG of a system is constructed by the following equations –
Example
Consider a system described by following sets of equations
Where x1 is input and x5 is output.
Step1 – First step is to draw all the nodes.
Step2 – Draw the SFG for equation (1)
Step3 – Draw the SFG for equation (2)
Step4 – Draw the SFG for equation (3)
Step5 – Draw the SFG for equation (4)
Step6 – Now draw the complete signal flow graph with the help of the above graph.