Scribd
Upload
50 views24 pages

SE201 - 071 - Signal Flow Graphs

This document discusses signal flow graphs and their use in analyzing linear systems. It defines the basic elements of a signal flow graph as nodes connected by directed branches, and discusses properties like paths and loops. It also covers Mason's rule for determining a system's transfer function using the graph's determinant and cofactors calculated from loop and path gains. Examples are provided to demonstrate how to analyze graphs and calculate transfer functions.

Uploaded by

Vinod Kumar Suvata
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
50 views24 pages

SE201 - 071 - Signal Flow Graphs

This document discusses signal flow graphs and their use in analyzing linear systems. It defines the basic elements of a signal flow graph as nodes connected by directed branches, and discusses properties like paths and loops. It also covers Mason's rule for determining a system's transfer function using the graph's determinant and cofactors calculated from loop and path gains. Examples are provided to demonstrate how to analyze graphs and calculate transfer functions.

Uploaded by

Vinod Kumar Suvata
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 24

Term 071

SE201: Introduction to Systems Engineering

Signal Flow Graphs

Dr. Samir Al-Amer


Term 071
Outlines
• Basic Elements of Signal Flow Graph
• Basic Properties
• Definitions of Signal Flow Graph Terms
• Mason Theory
• Examples

SE201 Al-Amer_Term 071 2


Basic Elements of Signal Flow Graph

 A Signal flow graph is a diagram consisting


of nodes that are connected by several
directed branches.

branch branch

node node

SE201 Al-Amer_Term 071 3


Basic Elements of Signal Flow Graph

 A node is used to represent a variable (inputs,


outputs, other signals)
 A branch shows the dependence of one variable
( node) on another variable (node)
 Each branch has GAIN and DIRECTION
 A signal can transmit through a branch only in the
direction of the arrow
 If gain is not specified gain =1

G
B=GA
A B
SE201 Al-Amer_Term 071 4
Nodes
 A node is used to represent a variable
 Source node (input node)
 All braches connected to the node are leaving the node

 Input signal is not affected by other signals

 Sink node (output node)


 All braches connected to the node are entering the node

 output signal is not affecting other signals

D
Source node A B C Sink node
X Y Z V
U
SE201 Al-Amer_Term 071 5
Relationship Between Variables
D
Source node A B C Sink node
X Y Z V
U
Gain is not
shown means
U (input) gain=1
X=AU+Y
Y=BX
Z=CY+DX
V=Z (output)

SE201 Al-Amer_Term 071 6


Another Example
D
Source node
A B Y C Sink node

U X Z V
3 K
W H
X=AU+Y
Y=BX+KZ
Z=CY+DX+HW
W=3U
V=Z

SE201 Al-Amer_Term 071 7


Basic Properties
 Signal flow graphs applies to linear systems only
 Nodes are used to represent variables
 A branch from node X to node Y means that Y depends
on X
 Value of the variable (node) is the sum of gain of
branch * value of node
 Non-input node cannot be converted to an input node
 We can create an output node by connecting unit branch
to any node

SE201 Al-Amer_Term 071 8


Terminology: Paths
 A path: is a branch or a continuous sequence of
branches that can be traversed from one node to
another node
A B Y C
U Z V
X
3 K

W H
Z
U A X B Y C Z
U
3
W H
Paths from U to Z
SE201 Al-Amer_Term 071 9
Terminology: Paths
 A path: is a branch or a continuous sequence of
branches that can be traversed from one node to
another node
 Forward path: path from a source to a sink
 Path gain: product of gains of the braches that make the
path

A B Y C
U X Z V
3 K
W H

SE201 Al-Amer_Term 071 10


Terminology: loop
A loop: is a closed path that originates and 
terminates on the same node, and along the
.path no node is met twice
Nontouching loops: two loops are said to be 
nontouching if they do not have a common
.node
B Y

A B Y C X

X Z V Y C
U
3 K
W H K
SE201 Al-Amer_Term 071 11
An example

a11 x1 + a12 x2 + r1 = x1
a21 x1 + a22 x2 + r2 = x2

SE201 Al-Amer_Term 071 12


…An example
(1- a11 )x1 + (- a12 ) x2 = r1
( - a21 ) x1 + (1- a22 )x2 = r2

 This have the solution


x1= (1- a22 )/ r1 + a12 / r2

x2= (1- a11 )/ r2 + a21 / r1

 = 1 - a11 - a22 + a22 a11 - a12 a21


SE201 Al-Amer_Term 071 13
An example
 = 1 - a11 - a22 + a22 a11 - a12 a21

 Self loops a11 , a22 , a12 a21


 Product of nontouching loops a22 a11

SE201 Al-Amer_Term 071 14


SGF : in general
 The linear dependence (Tij) between the
independent variable xi (input) and the
dependent variable (output) xj is given by
Mason’s SF gain formula

 P ijk  ijk
Tij  k


Pijk  k th path from x i to x j
  deterninant of the graph
 ijk  cofactor of the path Pijk
SE201 Al-Amer_Term 071 15
The determinant 
N M ,Q
  1   Ln  L m Lq   Lr Ls Lt ...
n 1 m 1, q 1

Lq is the loop gain


 Or
=1 –(sum of all different loop gains) +(sum of the gain products
of all combinations of 2 nontouching loops)
-(sum of the gain products of all combinations of 3 nontouching
loops)…

 The cofactor  ijk is the determinant with loops


touching the kth path removed

SE201 Al-Amer_Term 071 16


Example
Determine the transfer function between V and U

A B Y C
U X Z V
3 K
W H
 The number of forward paths from U to V = ?
 Path Gains ?
 Loops ?
 Determinant ?
 Cofactors ?
 Transfer function ?
SE201 Al-Amer_Term 071 17
Example
Determine the transfer function between V and U

A B Y C
U X Z V
3 K
W H

 The number of forward paths from U to V = 2


 Path Gains ABC, 3H
 Loop Gains B, CK
 Transfer function (ABC+3H-3HB)/(1-B-CK)

SE201 Al-Amer_Term 071 18


An example

SE201 Al-Amer_Term 071 19


:An example
 Two paths :P1, P2
 Four loops
 P1 = G1G2G3G4, P2= G5G6G7G8
 L1=G2H2 L2=G3H3 L3=G6H6 L4=G7H7
 - (L1+L2+L3+L4)+(L1L3+L1L4+L2L3+L2L4)
 Cofactor for path 1: 1= 1- (L3+L4)
 Cofactor for path 2: 2= 1-(L1+L2)
 T(s) = (P11 + P22)/

SE201 Al-Amer_Term 071 20


Another example

SE201 Al-Amer_Term 071 21


 3 Paths
 8 loops

SE201 Al-Amer_Term 071 22


Summary

SE201 Al-Amer_Term 071 23


Keywords
• Node • Forward path
• Branch • cofactor
• Path
• Loop
• Non-touching loops
• Loop gain
• Sink node
• Source node

SE201 Al-Amer_Term 071 24

You might also like