Overview of

Signal Flow Graphs

1
 Outline
• Introduction to Signal Flow Graphs
– Definitions
– Terminologies
– Examples
• Mason’s Gain Formula
– Examples
• Signal Flow Graph from Block Diagrams
• Design Examples

2
 Introduction
• Alternative method to block diagram representation,
developed by Samuel Jefferson Mason.

• Advantage: the availability of a flow graph gain formula,

also called Mason’s gain formula.

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

are connected by directed branches.

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

another and gives the relationships among the signals.

3
 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;

a y
x

• 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.

4
Signal-Flow Graph Models

Y1( s ) G11( s )  R1( s )  G12( s )  R2( s )

Y2( s ) G21( s )  R1( s )  G22( s )  R2( s )

5
 Signal-Flow Graph Models
r1 and r2 are inputs and x1 and x2 are outputs

a11 x1  a12 x2  r1 x1

a21 x1  a22 x2  r2 x2

6
 Signal-Flow Graph Models

xo is input and x4 is output

x1  ax0  bx1  cx2 f

x2  dx1  ex3
c
x0 x1 x2 g x3 x4
a d h
x3  fx0  gx 2
x4  hx 3 b e

7
 Construct the signal flow graph for the following set of
simultaneous equations.

• There are four variables in the equations (i.e., x 1,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.

8
 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. 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.

9
 Terminologies
• A self-loop is a feedback loop consisting of a single branch. i.e.; A33 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.

10
Consider the signal flow graph below and identify the following

a) Input node.
b) Output node.
c) Forward paths.
d) Feedback paths (loops).
e) Determine the loop gains of the feedback loops.
f) Determine the path gains of the forward paths.
g) Non-touching loops

11
 Consider the signal flow graph below and identify the following

• There are two forward path gains;

12
 Consider the signal flow graph below and identify the following

• There are four loops

13
 Consider the signal flow graph below and identify the following

• Nontouching loop gains;

14
 Consider the signal flow graph below and identify the
following

a) Input node.
b) Output node.
c) Forward paths.
d) Feedback paths.
e) Self loop.
f) Determine the loop gains of the feedback loops.
g) Determine the path gains of the forward paths.

15
 Input and output Nodes

a) Input node

b) Output node

16
(c) Forward Paths

17
(d) Feedback Paths or Loops

18
(d) Feedback Paths or Loops

19
(d) Feedback Paths or Loops

20
(d) Feedback Paths or Loops

21
(e) Self Loop(s)

22
(f) Loop Gains of the Feedback Loops

23
(g) Path Gains of the Forward Paths

24
 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.
25
 Mason’s Rule:
• The transfer function, C(s)/R(s), of a system represented by a signal-flow graph
is;
n
 Pi  i
C( s ) i 1

R( s ) 
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.
26
 Mason’s Rule:
n
 Pi  i
C( s ) i 1

R( s ) 
∆ = 1- (sum of all individual loop gains) + (sum of the products of the gains
of all possible two loops that do not touch each other) – (sum of the
products of the gains of all possible three loops that do not touch each
other) + … and so forth with sums of higher number of non-touching loop
gains

∆i = value of Δ for the part of the block diagram that does not touch the i-th
forward path (Δi = 1 if there are no non-touching loops to the i-th path.)

27
 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
28
 Example#1: Apply Mason’s Rule to calculate the transfer function of
the system represented by following Signal Flow Graph

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

L1  G1G4 H1 , L2  G1G2G4 H 2 , L3  G1G3G4 H 2

29
 Example#1: 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 H1  G1G2G4 H 2  G1G3G4 H 2 

30
 Example#1: 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
31
Example#1: Continue

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

P1

P2

1. Calculate forward path gains for each forward path.

P1  G1G2 G3G4 (path 1) and P2  G5G6 G7 G8 (path 2)

2. Calculate all loop gains.

L1  G2 H 2 , L2  H 3G3 , L3  G6 H 6 , L4  G7 H 7

3. Consider two non-touching loops.

L1L3 L1L4
L2L4 L2L3 33
 Example#2: continue

4. Consider three non-touching loops.

None.

5. Calculate Δ from steps 2,3,4.

  1   L1  L2  L3  L4    L1 L3  L1 L4  L2 L3  L2 L4 

  1   G2 H 2  H 3G3  G6 H 6  G7 H 7  
 G2 H 2G6 H 6  G2 H 2G7 H 7  H 3G3G6 H 6  H 3G3G7 H 7 

34
 Example#2: continue
Eliminate forward path-1

1  1   L3  L4 
1  1   G6 H 6  G7 H 7 

Eliminate forward path-2

 2  1   L1  L2 

 2  1   G2 H 2  G3 H 3 

35
 Example#2: continue

Y ( s ) P11  P2  2

R( s ) 

Y (s) G1G2G3G4 1   G6 H 6  G7 H 7    G5G6 G7 G8 1   G2 H 2  G3 H 3  


R( s ) 1   G2 H 2  H 3G3  G6 H 6  G7 H 7    G2 H 2 G6 H 6  G2 H 2 G7 H 7  H 3G3G6 H 6  H 3G3G7 H 7 

36
 Example#3
• Find the transfer function, C(s)/R(s), for the signal-flow
graph in figure below.

37
 Example#3
• There is only one forward Path.

P1  G1 ( s )G2 ( s )G3 ( s )G4 ( s )G5 ( s )

38
 Example#3
• There are four feedback loops.

39
 Example#3
• Non-touching loops taken two at a time.

40
 Example#3
• Non-touching loops taken three at a time.

41
 Example#3

Eliminate forward path-1

42
 From Block Diagram to Signal-Flow Graph Models
Example#5

H1

R(s) E(s) X1 － X3 C(s)

G1 G2 G3 G4
－ X2
－
H2

H3

－ H1
R(s) 1 E(s) G1 X1 G2 X2 G3 X3 G4 C(s)

－ H2
－ H3
43
 From Block Diagram to Signal-Flow Graph Models
Example#5
－ H1
R(s) 1 E(s) G1 X1 G2 X2 G3 G4 X3 1 C(s)

－ H2

－ H3

  1  (G1G2G3G4 H 3  G2G3 H 2  G3G4 H 1 )

P1  G1G2G3G4 ; 1  1

C ( s) G1G2G3G4
G 
R( s ) 1  G1G2G3G4 H 3  G2G3 H 2  G3G4 H 1
44
END OF LECTURE

45