Topic

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 n’t 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.
 Comparison of BD and SFG
block diagram: signal flow graph:

R(s) C (s) G(s)

G(s)
R(s) C (s)
In this case at each step block diagram is to Only one time SFG is to be drawn and
be redrawn. That’s why it is tedious method. then Mason’s gain formula is to be
So wastage of time and space. evaluated.
So time and space is saved.
SFG
 Definition of terms required in SFG
Node: It is a point representing a variable.
x2 = t 12 x1 +t32 x3
X3
X1 t12 X2
t32
In this SFG there are 3 nodes.

Branch : A line joining two nodes.

X1 X2

Input Node : Node which has only outgoing branches.

X1 is input node.
Output node/ sink node: Only incoming branches.

Mixed nodes: Has both incoming and outgoing branches.

Transmittance : It is the gain between two nodes. It is generally

written on the branch near the arrow.

t12 t23 t34

X4
X1 X2 X3

t43
• Path : It is the traversal of connected branches in the direction
of branch arrows, such that no node is traversed more than once.
• Forward path : A path which originates from the input node
and terminates at the output node and along which no node
is traversed more than once.
• Forward Path gain : It is the product of branch transmittances
of a forward path.

P 1 = G1 G2 G3 G4, P 2 = G5 G6 G7 G8
Loop : Path that originates and terminates at the same node
and along which no other node is traversed more than once.
Self loop: Path that originates and terminates at the same
node.
Loop gain: it is the product of branch transmittances of a loop.
Non-touching loops: Loops that don’t have any common node
or branch.

L 1 = G2 H2 L 2 = H3

L3= G7 H7
Non-touching loops are L1 & L2, L1
& L3, L2 &L3
 SFG terms representation
input node (source)
transmittance
branch
mixed node x4
mixed node
node d
x1 a path x3
b 1
forward
x 2 path loop x3
c

input node (source)

 Mason’s Gain Formula
• A technique to reduce a signal-flow graph to a single transfer
function requires the application of one formula.
• The transfer function, C(s)/R(s), of a system represented by a
signal-flow graph is

k = number of forward path

Pk = the kth forward path gain
∆ = 1 – (Σ loop gains) + (Σ non-touching loop gains taken two at a
time) – (Σ non-touching loop gains taken three at a time)+ so
on .
∆ k = 1 – (loop-gain which does not touch the forward path)
Ex: SFG from BD
Construction of SFG from simultaneous
equations
t21 t 23

t31

t32
t33
After joining all SFG
 SFG from Differential equations
Consider the differential equation
y  3 y  5 y  2 y  x
Step 1: Solve the above eqn for highest order

y  x  3 y  5 y  2 y
Step 2: Consider the left hand terms (highest derivative) as dependant variable and all
other terms on right hand side as independent variables.
Construct the branches of signal flow graph as shown below:-
x
1
y -2 y 
y -5
-3
y 
(a)
Step 3: Connect the nodes of highest order derivatives to the lowest order der.node and so
on. The flow of signal will be from higher node to lower node and transmittance will be 1/s
as shown in fig (b)
x
1
y -2
y 
1/s -5
y

(b) 1/s -3
y  1/s

Step 4: Reverse the sign of a branch connecting y’’’ to y’’, with condition no change in
T/F fn.
Step5: Redraw the SFG as shown.
Problem: to find out loops from
the given SFG
Ex: Signal-Flow Graph Models
P1 =

P2=
Individual loops

L 1 = G2 H2 Pair of Non-touching loops

L 1L 3 L 1L 4
L 2= G3 H3 L2 L3 L 2L 4

L 3 = G6 H6

L 4 = G7 H7
Y

 Pk  k
R (1  ( L1  L2  )   LiLj   LiLjLk..

Y( s ) G 1 G 2 G 3 G 4 1  L 3  L 4  G 5 G 6 G 7 G 8 1  L 1  L 2

R( s ) 1  L 1  L 2  L 3  L 4  L 1 L 3  L 1 L 4  L 2 L 3  L 2 L 4
 Block Diagram Reduction Example

H2

R _ C
+_ + G1 + G2 G3
+

H1
R

R
R
R G1G2G3 C
+_ 1  G1G2 H1  G2G3 H 2

R G1G2G3 C
1  G1G2 H1  G2G3 H 2  G1G2G3
Solution for same problem by using
SFG
 Forward Path

P 1 = G 1 G 2 G3
 Loops

L 1 = G 1 G 2 H1 L 2 = - G 2 G3 H2
 L 3 = - G 1 G 2 G3

P 1 = G 1 G 2 G3

L 1 = G 1 G 2 H1

L 2 = - G 2 G3 H2
L 3 = - G 1 G 2 G3

∆1 = 1

∆ = 1- (L1 + L 2 +L 3 )

T.F= (G 1 G 2 G3 )/ [1 -G 1 G 2 H1 + G 1 G 2 G3 + G 2 G3 H2 ]
 SFG from given T/F
C (s ) 24

R (s ) (s  2)(s  3)(s  4)

1 s 1

( s  2) (1  2s 1 )