Scribd
Upload
39 views

Lesson M3a Signal Flow Graphs Block Diagrams

Signal flow graphs (SFGs) can be used as an alternative to block diagrams to model systems. SFGs represent variables as nodes and relationships between variables as directed branches connecting nodes. Each branch has a gain applied to the signal at the originating node. Key elements of SFGs include input/output nodes, paths, loops, and path/loop gains. SFGs can be manipulated and analyzed using rules of addition, transmission, and multiplication. Mason's direct rule provides a formula to directly calculate transfer functions from an SFG's topology and branch gains without explicit graph manipulation. Examples and exercises are provided to illustrate SFG concepts and analysis techniques.

Uploaded by

Asif Noor
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
39 views

Lesson M3a Signal Flow Graphs Block Diagrams

Signal flow graphs (SFGs) can be used as an alternative to block diagrams to model systems. SFGs represent variables as nodes and relationships between variables as directed branches connecting nodes. Each branch has a gain applied to the signal at the originating node. Key elements of SFGs include input/output nodes, paths, loops, and path/loop gains. SFGs can be manipulated and analyzed using rules of addition, transmission, and multiplication. Mason's direct rule provides a formula to directly calculate transfer functions from an SFG's topology and branch gains without explicit graph manipulation. Examples and exercises are provided to illustrate SFG concepts and analysis techniques.

Uploaded by

Asif Noor
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 30

SIGNAL FLOW GRAPHS

M. Azharul Haque,
Dept. of EEE , PAU
Signal Flow Graph (SGF)
The Block diagram is one possible model
for a system
Another popular system replaces the
blocks and summing junctions with a set of
nodes and directed lines Called a Signal
Flow Graph
Signal Flow Graph (Cont)
A graph is a collection of points and lines,
respectively referred to as nodes and branches.
Each end of a branch is connected to a node
and both ends of a branch may be connected to
the same node.
A signal-flow graph is a diagram which depicts
the cause and effect relationship among a
number of variables.
The variables are represented by the nodes of
the graph, while the connecting branches dene
the relationship. A typical signal-ow graph is
shown
Signal Flow Graph (Cont)
Signal Flow Graph (Cont)

Each directed branch links two nodes and


has a gain (transmittance) that is applied
to the signal at the originating node
SFG Terminologies
Input :(Source) Node: Has only outgoing branches
Output :(Sink) Node: Has only incoming branches
Path: A continuous succession of branches traversed in
the same direction
Forward Path: Path connecting a source to a sink
without visiting any node more than once
Loop: Closed path not visiting any node more than once
Path Gain: Product of gains on path
Forward-path Gain: Product of gains on forward path
Loop Gain: Product of gains on a loop
Non-touching Loops: Loops that have no node in
common
SFG Terminologies (Cont)
SFG Example
SFG vs Block Diagrams
Correlation between signal flow graph and
block diagram:
Signal Flow Graph Block Diagram
Source or input node Input signal
Sink or output node Output signal
Branch Block
Node Signal
SFG Manipulation Steps
Identify each summing junction or take-off
point as a node
SFG Manipulation Steps (Cont)
SFG Manipulation Steps (Cont)
SFG Manipulation Steps (Cont)
SFG Manipulation Steps (Cont)
SFG Manipulation Steps (Cont)
SFG Manipulation Steps (Cont)
SFG Manipulation Steps (Cont)
Signal Flow Graph Algebra
Addtion rule: The value of the variable
designated by a node is equal to the sum of
all signals entering the node.
Transmission rule: The value of the
variable designated by a node is transmitted
on every branch leaving the node.
Multiplication rule: A cascaded connection
of n-1 branches with transmission functions
can be replaced by a single branch with new
transmission function equal to the product of
the old ones.
Masons Direct Rule
The manipulation of signal-ow graphs is an
effective and straightforward means of
determining transfer functions for relatively small
graphs. However, such manipulations quickly
become unwieldy for larger graphs, and for such
situations the transfer function can be computed
directly
In general, the transfer function of a signal-ow
graph can be derived using the following
expression, commonly known as Masons Direct
Rule
Masons Direct Rule for Gain
The relationship between the i/p variable and o/p variable of a SGF
is given by Msons direct formula and

where
Pk = transmittance of the kth forward path from input xin,
to output, xout
= 1 - (sum of all individual loop gains)
+ (sum of loop gain products of all possible sets of non
touching loops taken two at a time)
- (sum of loop gain products of all possible sets of non
touching loops taken three at a time) + . . . and
k = the value of for that portion of the graph not
touching the kth forward path.
Example
Exercise #1 on SFG
Exercise #1 on SFG (Cont)
Exercise #1 on SFG (Cont)
Exercise #2 on SFG
Exercise #3
Solutions of Exercise Problem #3
Exercise Problem #4
Solutions to Exercise Problem #4
Exercise Problem #5

You might also like