Signal Flow Graph
• An alternate way of representing a system described by a set of equations.
• Graphically you will see a flow of signal along a collection of paths, nodes and
loops, consistent with the system described by a set of equation and in this spirit
we call it Signal Flow Graph representation.
Consider a Simple Equation
Terminologies used in Signal Flow Graph
• Node: A node is a point representing a variable or signal
• Source Node(input node): The node having only an outgoing branch.
• Sink Node(output node): The node having only incoming branches.
• Chain Node(mixed node): The node having incoming and outgoing branches.
• Branch: A branch is directed line segment joining two nodes.
• Path: A path is a traversal of connected branches in the direction of branch arrows
• Forward Path: A path from input node(source) to an output node(sink) which
does not cross any nodes more than once.
• Loop: A loop is a closed path
• Feedback loop (closed loop): A path which terminates at a node from
where it originated, after travelling through at least one other node,
without tracing any other node twice.
• Self Loop: A feedback loop consisting of only one node. A self loop cannot
appear in while defining a forward path or feedback loop as node
containing it gets traced twice (which is not allowed.
• Non-touching loops: Loops are non-touching if they do not posses any
node in common.
• Transmittance(gain): Transmittance is the gain between two nodes.
• Forward path gain: Product of all the branch transmittances of a forward path.
• Loop gain: Product of all the branch transmittance along the loop.
Elements of SFG
Source node
Sink node
Mixed node
Elements of SFG
1st forward path
2nd forward path
3rd forward path
4th forward path
feedback path
Self loop
Elements of SFG
Properties of Signal Flow Graph
• It is applicable to only LTI system
• Signal gets multiplied by branch gain/transmittance when it
travels along it
• The value of variable represented by a node is an algebraic sum of all
signals entering that node
• The value of a variable at a node is available to all the
branches leaving that node
Method to obtain a signal flow graph
Consider the following equations We’ll have the following
representation
Consider following block diagram We’ll have following
representation
Mason’s Gain Formula
In the block diagram reduction method we apply reduction rules one after another,
keep on drawing reduced block diagram at every step and arrive at a simpler system
In contrast in signal flow graph approach, once S.F.G is obtained, direct use of one
formula leads to the overall system transfer function
The formula used will be called Mason Gain formula
Example 1
Identify forward paths 2 forward paths
Identify loops 3 loops
Comparison
• Correlation between signal flow graph
and block diagram:
Signal Flow Graph Block Diagram
Source or input node Input signal
Sink or output node Output signal
Branch Block
Node Signal
Example
Example
Example
Example:
Example
Example: Use mason gain to find transfer function
2 non-touching loops
5 forward paths So
𝑇 1 =𝐺1 𝐺 2
𝑇 2 =𝐺 4
𝑇 3 =𝐺 7 𝐺8
𝑇 4=𝐺 1 𝐺5 𝐺8 Along path 1 only 1 non-touching loop
𝑇 5 =𝐺7 𝐺6 𝐺 2
3 loops Along T2 3 non-touching loop and 1 NTP
𝐿1=𝐺 9
𝐿2=𝐺 3
𝐿
3=𝐺 5 𝐺 6
Along T3, 1 NTL and 0 NTP
Converting Block diagram to signal Flow
No combination of non-touching loops
For both the forward paths T1 and T2, all loops are touching
Application of Mason Gain formula to Electric
network
Example
Example
