0% found this document useful (0 votes)
143 views5 pages

Lecture 5 (Signal-Flow-Graphs) PDF

1) A signal flow graph is a diagram consisting of nodes connected by directed branches that represents the relationships between variables in a system. 2) Nodes represent variables like inputs, outputs, and intermediate signals. Branches show the dependence of one variable on another, with the direction of the arrow indicating the direction of signal flow. 3) Unless otherwise specified, branches have a gain of 1. Basic properties include that nodes represent linear relationships and the value of a node equals the sum of incoming branch gains multiplied by the values of connected nodes.

Uploaded by

MomenNaeem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
143 views5 pages

Lecture 5 (Signal-Flow-Graphs) PDF

1) A signal flow graph is a diagram consisting of nodes connected by directed branches that represents the relationships between variables in a system. 2) Nodes represent variables like inputs, outputs, and intermediate signals. Branches show the dependence of one variable on another, with the direction of the arrow indicating the direction of signal flow. 3) Unless otherwise specified, branches have a gain of 1. Basic properties include that nodes represent linear relationships and the value of a node equals the sum of incoming branch gains multiplied by the values of connected nodes.

Uploaded by

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

Lecture 3 Lecture 3

Signal Flow Graphs Signal Flow Graphs


Basic Elements of Signal Flow Graph
A Signal flow graph is a diagram consisting of nodes that are
Lecture 3 connected by several directed branches.
Signal Flow Graphs branch branch

node node
• Basic Elements of Signal Flow Graph
• Basic Properties A node is used to represent a variable (inputs, outputs, other signals)
A branch shows the dependence of one variable ( node) on another
• Definitions of Signal Flow Graph Terms variable (node)
• Mason Theory – Each branch has GAIN and DIRECTION
• Examples – A signal can transmit through a branch only in the direction of
the arrow
– If gain is not specified gain =1
G
B=GA
1 A B 2
Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu

Lecture 3 Lecture 3
Signal Flow Graphs Signal Flow Graphs
Nodes Relationship Between Variables

 A node is used to represent a variable


 Source node (input node) D
 All braches connected to the node are leaving the node Source node A B C Sink node
 Input signal is not affected by other signals

 Sink node (output node) X Y Z V


U
 All braches connected to the node are entering the node
Gain not shown
 output signal is not affecting other signals
implies gain=1
U (input)
D X=AU+Y
Source node A B Y=BX
C Sink node
Z=CY+DX
X Y Z V
U V=Z (output)

3 4
Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu
Lecture 3 Lecture 3
Signal Flow Graphs Signal Flow Graphs
Block Diagrams and their SFG Representations Example 1

D
ܻሺܵሻ
‫ ܵ ܩ‬ൌ Source node
ܷሺ‫ݏ‬ሻ B
A 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
௒ሺௌሻ ீሺௌሻ
‫ ܵ ܩ‬ൌ ൌ 5
ோሺ௦ሻ ଵାீ ௦ ுሺ௦ሻ 6
Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu

Lecture 3 Lecture 3
Signal Flow Graphs Signal Flow Graphs
Basic Properties Terminology: Paths

• Signal flow graphs applies to linear systems only


• Nodes are used to represent variables A path: is a branch or a continuous sequence of branches that can be
traversed from one node to another node
• 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 A B Y C
node U V
X Z
• Non-input node cannot be converted to an input node K
• We can create an output node by connecting unit branch to any node 3
W H
Z
U A X B Y C Z
U
3
W H
Paths from U to Z
7 8
Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu
Lecture 3 Lecture 3
Signal Flow Graphs Signal Flow Graphs
Terminology: Paths Terminology: loop

A path: is a branch or a continuous sequence of branches that can be A loop: is a closed path that originates and terminates on the same
traversed from one node to another node node, and along the path no node is met twice.
Forward path: path from a source to a sink Nontouching loops: two loops are said to be nontouching if they do
Path gain: product of gains of the braches that make the path not have a common node.

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

9 10
Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu

Lecture 3 Lecture 3
Signal Flow Graphs Signal Flow Graphs
Example 2 Example 2 contd…

(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


a11 x1 + a12 x2 + r1 = x1
a21 x1 + a22 x2 + r2 = x2 ∆ = 1 - a11 - a22 + a22 a11 - a12 a21

11
12
Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu
Lecture 3 Lecture 3
Signal Flow Graphs Signal Flow Graphs
Example 2 contd… SGF: General Formula

The linear dependence (Tij) between the independent


∆ = 1 - a11 - a22 + a22 a11 - a12 a21
variable xi (input) and the dependent variable (output) xj is
given by Mason’s SF gain formula
Self loops a11 , a22 , a12 a21
Product of nontouching loops a22 a11
∑P
k
ijk ∆ ijk
Tij =

th
Pijk = k path from x i to x j
∆ = determinant of the graph
∆ ijk = cofactor of the path Pijk
13 14

Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu

Lecture 3 Lecture 3
Signal Flow Graphs Signal Flow Graphs
The determinant ∆ Example 3

N M ,Q
Determine the transfer function between V and U
∆ = 1 − ∑ Ln + ∑L m Lq − ∑ Lr Ls Lt ...
n =1 m =1, q =1
A B Y C
Lq is the loop gain Z
U X V
Or K
∆=1 –(sum of all different loop gains) +(sum of the gain products of all 3
combinations of 2 nontouching loops) W H
-(sum of the gain products of all combinations of 3 nontouching loops)… The number of forward paths from U to V = ?
Path Gains ?
The cofactor ∆ ijk is the determinant with loops touching the kth Loops ?
path removed Determinant ?
Cofactors ?
Transfer function ?
15 16

Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu


Lecture 3 Lecture 3
Signal Flow Graphs Signal Flow Graphs
Example 3 contd… Example 4

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)

17
18
Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu

Lecture 3 Lecture 3
Signal Flow Graphs Signal Flow Graphs
Example 4 contd.. Example 5 (Try at Home)

Two paths :P1, P2


Four loops
P1 = G1G2G3G4, P2= G5G6G7G8
L1=G2H2 L2=G3H3 L3=G6H6 L4=G7H7
∆= 1 - (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)/∆

19 20
Dr. Kalyana Veluvolu Dr. Kalyana Veluvolu

You might also like