Scribd
Upload
9 views7 pages

Signal Flow Graph

Activity

Uploaded by

Domingo Noveras
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views7 pages

Signal Flow Graph

Activity

Uploaded by

Domingo Noveras
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

SIGNAL FLOW GRAPH

INTRODUCTION

The most used graphical representation of a feedback control system is the


block diagram. In this chapter we shall consider another model, the signal flow
graph.
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.
DEFINITIONS
The following terminology is frequently used in a signal flow graph theory.
The examples associated with each definition refer to the following signal flow
graph.

A 42

A21 A32 A33 A 43


X1 X2 X3 X4
A23

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


node is passed more than once. For example, X1 to X2 to X3 to X4, X2 to X3 and
back to X2, and X1 to X2 to X4 are paths.
An input node or source is a node with only outgoing branches. For example,
X1, is an input node.
An output node or sink is a node with only incoming branches. For example, X4
is an output branch.
A forward path is a path from the input node to the output node. For example,
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. For example, X2 to X3 and back to X2, is a feedback path.
A self-loop is a feedback loop consisting of a single branch. For example, A33 is
a self-loop.
The gain of a branch is the transmission function of that branch when the
transmission function is a multiplicative operator. For example, A33 is the gain of
the self-loop if A33 is a constant or transfer function.
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 X1 to X2, to X3 to X4, is
A21A32A43
The loop gain is the product of the branch gains of the loop. For example, the
loop gain of the feedback loop from X2 to X3 and back to X2 is A32A23.
SIGNAL FLOW GRAPH ALGEBRA
Signal flow graph for a system can be reduced to obtain the transfer function on
of the system using the following rules. The guideline in developing the rules
for signal flow graph algebra is that the signal at a anode is given by sum of all
incoming signals.

Rule 1 : Incoming signal to a node through a branch is given by the product of a


signal at previous node and the gain of the branch.

X1 a
aX X2
1
X 2=ax X3
1

X2 a2
X 3 =a1 x1 + a2 x 2

Rule 2 : Cascaded branches can be combined to give a single branch whose


transmittance is equal to the product of individual branch transmittance.

Rule 3 : Parallel branches may be represented by single branch whose


transmittance is the sum of individual branch transmittance.

Ruled 4 : A mixed node can be eliminated by multiplying the transmittance of


outgoing branch (from the mixed node) to the transmittance of all incoming
branches to the mixed node.
Rule 5 : A loop may be eliminated by writing equations at the input and output
node and rearranging the equations to find the ratio of output to input.This ratio
gives the gain of resultant branch.

A21 A 32 A 43 … … An (n−1 )
Rule 6: A cascaded connection n-1 branches with transmission functions
can be replaced by a single branch with a new transmission
function equal to the product of the old ones. That is,
X n=A 21 × A 32 × A 43 … . A n(n−1) × X 1

CONSTRUCTION OF A SIGNL FLOW GRAPH


The signal flow graph of a linear feedback control system whose
components are specified by non-interacting transfer functions can be
constructed by direct reference to the block diagram of the system. Each variable
of the block diagram becomes a node and each block becomes a branch.
Example 1.1
The block diagram of a canonical feedback control system is given by:

+ E C
R G
±

The signal flow graph is constructed from this diagram

1 G 1
R E ± C C

H
Example 1.2 Convert to a Signal Flow Graph
Example 1.3

Identify the following


a. input node = X 1
b. output node = X 8
c. forward paths =X1 to X2 to X7 to X8
=X1 to X2 to X3 to X4 to X5 to X6 to X7 to X8
=X1 to X2 to X4 to X5 to X6 to X7 to X8
d. feedback paths = X2 to X3 to X2, X3 to X4 to X3, X5 to X6 to X5
e. self-loop =X7 to X7
f. loop gains of the feedback loops = A32A23, A43A34
g. path gains of the forward paths = A72, A32A43A54A65A76, A42A54A65A76

SOLUTION
Mason’s gain Formula
∑ Pk ∆ k
k
P=
∆
Where
Pk = path gain∨transmittance of k th forward path

∆=determinant of graph
=1 – (sum of all different loop gains) + (sum of all gain products of all possible conditions of two non
touching loops) – (sum of gain products of all possible combinations of three nontouching loops)
∆ k =cofactor of ∆

You might also like