Signal Flow Graph

What is Signal Flow Graph?
• SFG is a diagram which represents a set of simultaneous

equations.
• This method was developed by S. J. Mason. This method
does not require any reduction technique.
• It consists of nodes and these nodes are connected by a
directed line called branches.
• Every branch has an arrow which represents the flow of
signal.
• For complicated systems, when Block Diagram (BD) reduction
method becomes tedious and time consuming then SFG is a
good choice.
What is Signal Flow Graph?
• 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 depicts the flow of signals from one point of a system

to another and gives the relationships among the signals.
2
Comparison of BD and SFG
block diagram: signal flow graph:
In this case at each step block Only one time SFG is to be

diagram is to be redrawn. drawn and then Mason’s gain
That’s why it is tedious formula is to be evaluated.
method. So time and space is saved.
So wastage of time and space.
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.
Fundamentals of Signal Flow Graphs
Signal-Flow Graph Models
Y1( s ) G11( s )  R1( s )  G12( s )  R2( s )
Y2( s ) G21( s )  R1( s )  G22( s )  R2( s )

r1 and r2 are inputs and x1 and x2 are outputs
a11 x1  a12 x2  r1 x1
a21 x1  a22 x2  r2 x2
xo is input and x4 is output
x1  ax0  bx1  cx2 f

c
x2  dx1  ex3 x0 x1 x2 g x3 x4
a d h
x3  fx0  gx2
x4  hx 3 b e
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.
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.
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.
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
• There are two forward path gains;

• There are four loops

• Nontouching loop gains;

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.
Input and output Nodes
a) Input node
b) Output node
(c) Forward Paths
(d) Feedback Paths or Loops
(e) Self Loop(s)
(f) Loop Gains of the Feedback Loops
(g) Path Gains of the Forward Paths
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.
Mason’s Rule:
• The transfer function, C(s)/R(s), of a system represented by a signal-flow graph
is; n
C ( s)  P i i
 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.
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.)
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
29
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

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 

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

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

∆2 = 1
Example#1: Continue
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.
2. Calculate all loop gains.
3. Consider two non-touching loops.

L1L3 L1L4
L2L4 L2L3 34
Example#2: continue
4. Consider three non-touching loops.

None.
5. Calculate Δ from steps 2,3,4.
  1  L1  L2  L3  L4   L1L3  L1L4  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 
35
Example#2: continue
1  1  L3  L4 
1  1  G6 H 6  G7 H 7 
 2  1  L1  L2 
 2  1  G2 H 2  G3 H 3 
36
Example#2: continue
Y ( s ) P11  P2  2

R( s ) 
Y (s) G1G2G3G4 1  G6 H 6  G7 H 7   G5G6G7 G8 1  G2 H 2  G3 H 3 


R( s ) 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 
37
Example#3
• Find the transfer function, C(s)/R(s), for the signal-flow
graph in figure below.
Example#3
• There is only one forward Path.
P1  G1 ( s )G2 ( s )G3 ( s )G4 ( s )G5 ( s )

Example#3
• There are four feedback loops.
Example#3
• Non-touching loops taken two at a time.
Example#3
• Non-touching loops taken three at a time.
Example#3

Example#4: Apply Mason’s Rule to calculate the transfer function
of the system represented by following Signal Flow Graph
There are three forward paths, therefore n=3.
3
 Pi  i
C( s ) i 1 P11  P2  2  P3  3
 
R( s )  
Example#4: Forward Paths
P3  A42 A54 A65 A76
P1  A32 A43 A54 A65 A76 P2  A72

Example#4: Loop Gains of the Feedback Loops
L1  A32 A23
L5  A76 A67
L2  A43 A34 L9  A72 A57 A45 A34 A23
L6  A77
L3  A54 A45 L10  A72 A67 A56 A45 A34 A23
L7  A42 A34 A23
L4  A65 A56
L8  A65 A76 A67
Example#4: two non-touching loops
L1 L3 L2 L4 L3 L5 L4 L6 L5 L7 L7 L8
L1L4 L2 L5 L3 L6 L4 L7
L1L5 L2 L6
L1L6 L2 L8
L1 L8
Example#4: Three non-touching loops
L1 L3 L2 L4 L3 L5 L4 L6 L5 L7 L7 L8
L1L4 L2 L5 L3 L6 L4 L7
L1L5 L2 L6
L1L6 L2 L8
L1 L8

Signal Flow Graph

Uploaded by

Copyright:

Available Formats

Signal Flow Graph

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Signal Flow Graph

Uploaded by

Copyright:

Available Formats

What is Signal Flow Graph?

• SFG is a diagram which represents a set of simultaneous

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

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

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

In this case at each step block Only one time SFG is to be

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

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

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

xo is input and x4 is output

x1  ax0  bx1  cx2 f

• Another way to arrange this

• There are two forward path gains;

• There are four loops

• Nontouching loop gains;

n = number of forward paths.

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

1. Calculate forward path gain Pi for each forward

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

There are no non-touching loops, therefore

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

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

Eliminate forward path-1

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

Eliminate forward path-2

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

1. Calculate forward path gains for each forward path.

2. Calculate all loop gains.

3. Consider two non-touching loops.

4. Consider three non-touching loops.

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

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

Eliminate forward path-2

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

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

Eliminate forward path-1

There are three forward paths, therefore n=3.

P3  A42 A54 A65 A76

P1  A32 A43 A54 A65 A76 P2  A72

You might also like