Signal Flow Graphs

Er. Vinay Kumar

Department of Electronics Engineering
Kamla Nehru Institute of Technology, Sultanpur (U.P.)
[email protected]

© 2022 Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Signal Flow Graphs :
➢ A signal flow graph is a pictorial representation of the simultaneous equations
describing a system. It graphically displays the transmission of signals through
the system, as does the block diagram.
➢ But it is easier to draw and therefore easier to manipulate than the block
diagram.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Fundamentals of Signal Flow Graphs:
Let us first consider the simple equation
𝑋𝑖 = 𝐴𝑖𝑗 𝑋𝑗
The variables 𝑋𝑖 and 𝑋𝑗 can be functions of time, complex frequency, or any other
quantity. They may even be constants, which are “variables” in the mathematical
sense.
For signal flow graphs, 𝐴𝑖𝑗 is a mathematical operator mapping 𝑋𝑗 into 𝑋𝑖 , and is
called the transmission function.
For example, 𝐴𝑖𝑗 may be a constant, in which case 𝑋𝑖 is a constant times 𝑋𝑖 in
Equation (𝑋𝑖 = 𝐴𝑖𝑗 𝑋𝑗 ); if 𝑋𝑖 and 𝑋𝑗 are functions of s or z, 𝐴𝑖𝑗 may be a transfer
function 𝐴𝑖𝑗 (𝑠) or 𝐴𝑖𝑗 (𝑧).

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Fundamentals of Signal Flow Graphs:
The signal flow graph for Equation 𝑋𝑖 = 𝐴𝑖𝑗 𝑋𝑗 is given in Fig. . This is the
simplest form of a signal flow graph.
Note that the variables 𝑋𝑖 and 𝑋𝑗 are represented by a small dot called a node, and
the transmission function 𝐴𝑖𝑗 is represented by a line with an arrow, called a
branch.

➢ Every variable in a signal flow graph is designated by a node, and every

transmission function by a branch.
➢ Branches are always unidirectional.
➢ The arrow denotes the direction of signal flow.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Fundamentals of Signal Flow Graphs:

Ohm’s law states that E= RI, where E is a voltage, I a current, and R a resistance.
The signal flow graph for this equation is given in Fig.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
SIGNAL FLOW GRAPH ALGEBRA :
The Addition Rule
The value of the variable designated by a node is equal to the sum of all signals
entering the node. In other words, the equation
𝑛

𝑋𝑖 = ෍ 𝐴𝑖𝑗 𝑋𝑗
𝑗=1
represented by Fig.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
SIGNAL FLOW GRAPH ALGEBRA : The Addition Rule
Example:
The signal flow graph for the equation of a line in rectangular coordinates,
𝒀 = 𝒎𝑿 + 𝒃
Since b, the Y-axis intercept, is a constant it may represent a node (variable) or a
transmission function.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
SIGNAL FLOW GRAPH ALGEBRA :
The Transmission Rule Example:
The value of the variable designated by a The signal How graph of the
node is transmitted on every branch leaving simultaneous equations
that node. In other words, the equation 𝑌 = 3𝑋 , Z = −4𝑋
𝑋𝑖 = 𝐴𝑖𝑘 𝑋𝑘 𝑖 = 1, 2, 3 𝑛, 𝑘 𝑓𝑖𝑥𝑒𝑑 is given in Fig.
represented by Fig.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
SIGNAL FLOW GRAPH ALGEBRA :
The Multiplication Rule Example:
A cascaded (series) connection of 𝑛 − 1 The signal flow graph of the
branches with transmission functions simultaneous equations
𝐴21 , 𝐴32 , 𝐴43 , … … 𝐴𝑛 𝑛−1 𝑌 = 10𝑋 , Z = −20𝑌
can be replaced by a single branch with a new is given in Fig.
transmission function equal to
the product of the old ones. That is
which reduces to
𝑋𝑛 = 𝐴21 ∙ 𝐴32 ∙ 𝐴43 ∙ ⋯ 𝐴𝑛 𝑛−1 ∙ 𝑋1
The signal flow graph equivalence is
represented by Fig .

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
DEFINITIONS :

➢ Path: A path is a continuous, unidirectional succession of branches along

which no node is passed more than once. For example, 𝑋1 to 𝑋2 to 𝑋3 to 𝑋4 ,
𝑋2 to 𝑋3 and back to 𝑋2 , and 𝑋1 to 𝑋2 to 𝑋4 are paths.
➢ Input Node: An input node or source is a node with only outgoing branches.
For example, 𝑋1 is an input node.
➢ Output Node: An output node or sink is a node with only incoming branches.
For example, 𝑋4 is an output node.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
DEFINITIONS :

➢ Forward Path: A forward path is a path from the input node to the output
node. For example, 𝑋1 to 𝑋2 to 𝑋3 to 𝑋4 , and 𝑋1 to 𝑋2 to 𝑋4 are forward paths.
➢ Feedback Path: A feedback path or feedback loop is a path which originates
and terminates on the same node. For example, 𝑋2 to 𝑋3 and back to 𝑋2 is a
feedback path.
➢ Self-Loop: A self-loop is a feedback loop consisting of a single branch. For
example, 𝐴33 is a self-loop.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
DEFINITIONS :

➢ Gain: The gain of a branch is the transmission function of that branch when
the transmission function is a multiplicative operator. For example, 𝐴33 is the
gain of the self-loop if 𝐴33 is a constant or transfer function.
➢ Path Gain: The path gain is the product of the branch gains encountered in
traversing a path. For example, the path gain of the forward path from 𝑋1 to 𝑋2
to 𝑋3 to 𝑋4 is 𝐴21 𝐴32 𝐴43
➢ Loop Gain : The loop gain is the product of the branch gains of the loop. For
example, the loop gain of the feedback loop from 𝑋2 to 𝑋3 and back to 𝑋2 is
𝐴32 𝐴23 .
© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Signal-flow graphs :
➢ Signal-flow graphs are an alternative to block diagrams. Unlike block
diagrams, which consist of blocks, signals, summing junctions, and pickoff
points, a signal-flow graph consists only of branches, which represent systems,
and nodes, which represent signals. These elements are shown in Figures (a)
and (b), respectively.
➢ A system is represented by a line with an arrow showing the direction of signal
flow through the system.
➢ Adjacent to the line we write the transfer function. A signal is a node with the
signal's name written adjacent to the node.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Signal-flow graphs :
Figure shows the interconnection of the systems
and the signals. Each signal is the sum of signals
flowing into it.

For example, we see that the signal

𝑉 𝑠 = 𝑅1 𝑠 𝐺1 𝑠 − 𝑅2 𝑠 𝐺2 𝑠 + 𝑅3 𝑠 𝐺3 𝑠
The signal
𝐶2 𝑠 = 𝑉 𝑠 𝐺5 𝑠 = 𝑅1 𝑠 𝐺1 𝑠 𝐺5 𝑠 − 𝑅2 𝑠 𝐺2 𝑠 𝐺5 𝑠 + 𝑅3 𝑠 𝐺3 𝑠 𝐺5 𝑠
And the signal
𝐶3 𝑠 = −𝑉 𝑠 𝐺6 𝑠 = −𝑅1 𝑠 𝐺1 𝑠 𝐺6 𝑠 + 𝑅2 𝑠 𝐺2 𝑠 𝐺6 𝑠 − 𝑅3 𝑠 𝐺3 𝑠 𝐺6 𝑠

Notice that in summing negative signals we associate the negative sign with the system
and not with a summing junction, as in the case of block diagrams.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Converting Common Block Diagrams to Signal-Flow Graphs:
Cascade Form Block Diagram

We start by drawing the signal nodes for that system. Next we interconnect the signal
nodes with system branches.

The signal nodes The interconnection

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Converting Common Block Diagrams to Signal-Flow Graphs:
Parallel Form Block Diagram

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Converting Common Block Diagrams to Signal-Flow Graphs:
Feedback Form Block Diagram

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Converting a Block Diagram to a Signal-Flow Graph

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Converting a Block Diagram to a Signal-Flow Graph

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Converting a Block Diagram to a Signal-Flow Graph

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Converting a Block Diagram to a Signal-Flow Graph

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
General formula for signal flow graph :
MASON’S gain Formula:
σ 𝑃𝑘 ∆𝑘 𝑃1 ∆1 +𝑃2 ∆2 +⋯+𝑃𝑘 ∆𝑘
The overall Gain / Transfer function = =
∆ ∆

Where; 𝑃𝑘 = path gain of 𝑘 𝑡ℎ forward path

∆ = 1 −[sum of loop gains of all individual loop]
+ [sum of gain products of 2 non-touching loop ]
− [sum of gain products of 3 non-touching loop ] + ⋯
∆𝑘 = it is that value of ∆ obtained by removing all the loops
touching 𝑘 𝑡ℎ forward path

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Example :
Find the transfer function, C(s)/R(s), for the signal-flow graph in

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Example :
Solution:
First, identify the forward-path gains.
In this example there is only one:

Second, identify the loop gains. There are four, as follows:

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Example :
Solution….:
Third, identify the non-touching loops taken two at a time.
we can see that
➢ loop 1 does not touch loop 2,
➢ loop 1 does not touch loop 3, and
➢ loop 2 does not touch loop 3.
Notice that loops 1, 2, and 3 all touch loop 4. Thus, the
combinations of non-touching loops taken two at a time are as
follows:

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Example :
Solution….:
Finally, the nontouching loops taken three at a time are as follows:

To find ∆:

We form ∆𝑘 by eliminating from Δ the loop gains that touch the kth forward path:

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Example :
Solution….:
𝑃1 ∆1
The overall Gain / Transfer function =
∆

Since there is only one forward path, G(s) consists of only one term, rather than a
sum of terms, each coming from a forward path.

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved
Example :
Find of given block diagram G3
+
+
R G1 G2 C
– +
H2

H1

By signal flow graph

© 2022 | Er. Vinay Kumar, Department of Electronics Engineering, KNIT, Sultanpur. All rights reserved