Outline

• Introduction to Signal Flow Graphs

 Definitions
 Terminologies
• Signal-Flow Graph Models
• BD to SFG
 Example
• Mason’s Gain Formula
Example

1
 Introduction
• Definition:-

“ A signal flow graph is a graphical representation of the

relationship between variables of a set of linear algebraic
equation.”

• A signal-flow graph consists of a network in which

nodes are connected by directed branches.

• It depicts the flow of signals from one point of a system to

another and gives the relationships among the signals.

2
 Fundamentals of Signal Flow Graphs
• Consider a simple equation below and draw its signal flow graph:
y  ax
• The signal flow graph of the equation is shown below;

x
a y

• Every variable in a signal flow graph is designed by a Node.

• Every transmission function in a signal flow graph is designed by
a
Branch.
• Branches are always unidirectional.
• The arrow in the branch denotes the direction of the signal flow. 3
 Terminologies
• An input node or source contain only the outgoing branches. i.e., X1
• An output node or sink contain only the incoming branches. i.e., X4

• A path is a continuous, unidirectional succession of branches along which no

node is passed more than ones. i.e.,
X1 to X2 to X3 to X4 X1 to X2 to X4 X2 to X3 to X4

• A forward path is a path from the input node to the output node. i.e.,
X1 to X2 to X3 to X4 , and X1 to X2 to X4 , are forward paths.
• A feedback path or feedback loop is a path which originates and terminates on
the same node. i.e.; X2 to X3 and back to X2 is a feedback path.

4
 Terminologie
• s consisting of a single branch. i.e.; A
A self-loop is a feedback loop 33 is a self
loop.
• The gain of a branch is the transmission function of that branch.
• The path gain is the product of branch gains encountered in traversing a path.
i.e. the gain of forwards path X1 to X2 to X3 to X4 is A21A32A43

• The loop gain is the product of the branch gains of the loop. i.e., the loop gain
of the feedback loop from X2 to X3 and back to X2 is A32A23.

• Two loops, paths, or loop and a path are said to be non-touching if they have
no nodes in common.

5
 SFG terms representation
input node (source)
transmittance
branch
mixed node x4
mixed node
node d
x1 a b path x3
1
x3
forward path x2 lo o
c
p

input node (source)

6
 Signal-Flow Graph Models

xo is input and x4 is output

x1  ax0  bx1  cx2 f

c
x2  dx1  x0 x1 x2 x3 x4
a d h
ex3 g
x3  fx0 
b e
gx2 x4  hx3
 Construct the signal flow graph for the following set of
simultaneous equations.

• There are four variables in the equations (i.e., x1,x2,x3,and x4) therefore four nodes are
required to construct the signal flow graph.
• Arrange these four nodes from left to right and connect them with the associated
branches.

• Another way to arrange this

graph is shown in the figure.
 BD to SFG
Block Diagram Signal Flow Graph

9
 BD to SFG
Block Diagram
Block
Diagram

Signal Flow Graph

10
Example:-

11
 Mason’s Rule (Mason, 1953)
• The block diagram reduction technique requires successive
application of fundamental relationships in order to arrive at the
system transfer function.
• On the other hand, Mason’s rule for reducing a signal-flow graph
to a single transfer function requires the application of one
formula.
• The formula was derived by S. J. Mason when he related the
signal-flow graph to the simultaneous equations that can be
written from the graph.
12
 Mason’s Rule:
• The transfer function T, of a system represented by a signal-flow graph is;
n

P i

C(s)  i1
T R(s) i 
Where,

n = number of forward paths.

Pi = the i th forward-path gain.
∆ = Determinant of the system
∆i = Determinant of the ith forward path

• ∆ is called the signal flow graph determinant or characteristic function. Since

∆=0 is the system characteristic equation.

13
 Mason’s Rule:
n

P i

C(s)  i1
T R(s) i 

∆ = 1- (sum of all individual loop transmittance) + (sum of the products of

loop transmittance of all possible pairs of Non Touching loops) – (sum of
the products of loop transmittance of Triple of Non Touching loop) + …

∆i = Calculate ∆ for i th path

=1- All the loops that do not touch the i th forward path

14
 Systematic approach

1. Calculate forward path gain Pi for each forward path i.

2. Calculate all loop transfer functions.
3. Consider non-touching loops 2 at a time.
4. Consider non-touching loops 3 at a time.
5. etc
6. Calculate Δ from steps 2,3,4 and 5
7. Calculate Δi as portion of Δ not touching forward path i

15
 Example 1:
Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph

16
 Continued…..
• In this system there is only one forward path between the input R(s) and the
output C(s). The forward path gain is
𝑃1 = 𝐺1𝐺2𝐺3
• we see that there are three individual loops. The gains of these loops are
𝐿1 = 𝐺1𝐺2𝐻1
𝐿2 = −𝐺2𝐺3𝐻2
𝐿3 = −𝐺1𝐺2𝐺3
• Note that since all three loops have a common branch, there are no non-touching
loops. Hence, the determinant ∆ is given by

∆= 1 − (𝐿1+ 𝐿2 + 𝐿 3 )

= 1 − 𝐺1𝐺2𝐻1 +𝐺2 𝐺3𝐻2 +𝐺1 𝐺2𝐺3

• There is no any non touching loop so we get,
∆𝑙 = 1
• Therefore, the overall gain between the input 𝑅𝑠 and the output 𝐶𝑠 or the closed
loop transfer function, is given by
𝐶𝑠 𝐺 1 𝐺 2𝐺 3
=
𝑅𝑠 1 − 𝐺1𝐺2𝐻1 +𝐺2 𝐺3𝐻2 +𝐺1 𝐺2𝐺3
17
 Example 2 :
Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph

Therefore,
C(s) P11  P22
T 
There are three feedback loops R(s) 

L 1  G1G4 H 1 , L2  G1G2G4 H 2 , L3  G1G3G4 H 2

18
 Example2:
Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph

There are no non-touching loops, therefore

∆ = 1- (sum of all individual loop gains)

  1  L1  L2  L3 

  1 G1G4 H 1  G1G2G4 H 2  G1G3G4 H 2


19
 Example2 :
Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph

Eliminate forward path-1

∆1 = 1- (sum of all individual loop gains)+...

∆1 = 1

Eliminate forward path-2

∆2 = 1- (sum of all individual loop gains)+...

∆2 = 1
20
Example 2: Continue

21
THANK YOU

22