Scribd
Upload
7 views

04 Lecture - Signal Flow Graph

Uploaded by

205905
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
7 views

04 Lecture - Signal Flow Graph

Uploaded by

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

Course Tentative

W Tuesday Thursday W Tuesday Thursday

Topic 4 revisions and


8 Topic 5
1 - - Topic 5

9 Topic 6 Topic 6 & 7


Introduction to the No class Nuzul Al-
2
Course Quran

Topic 2: Transfer 10 Topic 7 Test 2*


Topic 1: Basic
3 function and impulse
control system
response
11 Topic 8 Topic 8 & 9
No class Hari Raya No class Hari Raya
4
Puasa Puasa Group Presentation (15
Group Presentation
Topic 2: Transfer 12 %) & Video Project
(15 %)
5 function and impulse Topic 3: Block Diagram Preparation (15%)
response
13 Raya Haji Topic 9 & Revisions
Topic 3 and
6 Test 1
revisions
Industrial Visit (Air
Video Project
14 Asia/MAS)
Topic 4: Signal Flow Topic 4 and Submission (15%)
7
Graph presentation discussion
Chapter 4

Signal Flow Graph

PowerPoint® Lectures for


University Physics, 14th Edition, Global Edition
– Hugh D. Young and Roger A. Freedman Lectures by Jason Harlow
© 2016 Pearson Education, Ltd.
Outline
• Introduction to Signal Flow Graphs
– Definitions
– Terminologies

• Mason’s Gain Formula


– Examples

• Signal Flow Graph from Block Diagrams

• Design Examples
Signal Flow Graph (SFG)
• Alternative method to block diagram
representation, developed by Samuel Jefferson
Mason.

• Advantage: the availability of a flow graph gain


formula, also called Mason’s gain formula.

• A signal-flow graph consists of a network in which


nodes are connected by directed branches.

• It depicts the flow of signals from one point of a


system to another and gives the relationships
among the signals.
Important terminology :
• Branches :-
line joining two nodes is called branch.

a y
x

Branch
• Dummy Nodes:-
A branch having one can be added at i/p as well as o/p.

Dummy Nodes
Input & output node
• Input node:-
It is node that has only outgoing branches.

• Output node:-
It is a node that has incoming branches.

f
c
x0 a x1 d x2 g x3 h x4

b e

Input node

Output node
Forward path:-
• Any path from i/p node to o/p node.

Forward path
Loop :-
• A closed path from a node to the same node is
called loop.
Self loop:-

• A feedback loop that contains of only one node is


called self loop.

Self loop
Loop gain:-

The product of all the gains forming a loop

Loop gain = A32 A23


Path & path gain

Path:-
A path is a traversal of connected branches in the direction of
branch arrow.

Path gain:-
The product of all branch gains while going through the forward
path it is called as path gain.
Feedback path or loop :-

• it is a path to o/p node to i/p node.


Touching loops:-
• when the loops are having the common node that
the loops are called touching loops.
Non touching loops:-

• when the loops are not having any common node


between them that are called as non- touching
loops.
Non-touching loops for forward paths
Chain Node :-

• it is a node that has incoming as well as outgoing


branches.

Chain node
SFG terms representation

branch transmittance
input
x4 node (source)
Chain node
Chain node
node d
x1 a b path x3
1
forward
x2 path
loop x3
c

input node (source) Output node


Mason’s Rule (Mason, 1953)
• The block diagram reduction technique requires
successive application of fundamental relationships
in order to arrive at the system transfer function.

• On the other hand, Mason’s rule for reducing a


signal-flow graph to a single transfer function
requires the application of one formula.

• The formula was derived by S. J. Mason when he


related the signal-flow graph to the simultaneous
equations that can be written from the graph.
Mason’s Rule :-

• The transfer function, C(s)/R(s), of a system represented by


a signal-flow graph is;

n
 Pi  i
C( s ) i 1

R( s ) 

• Where

• n = number of forward paths.


• Pi = the i th forward-path gain.
• ∆ = Determinant of the system
• ∆i = Determinant of the ith forward path
∆ is called the signal flow graph determinant or characteristic
function. Since ∆=0 is the system characteristic equation.
n
 Pi  i
C( s ) i 1

R( s ) 
∆ = 1- (sum of all individual loop gains) + (sum of the products of
the gains of all possible two loops that do not touch each other) –
(sum of the products of the gains of all possible three loops that
do not touch each other) + … and so forth with sums of higher
number of non-touching loop gains

∆i = value of Δ for the part of the block diagram that does not
touch the i-th forward path (Δi = 1 if there are no non-touching
loops to the i-th path.)
Systematic approach

1. Calculate forward path gain Pi for each


forward path i.
2. Calculate all loop transfer functions
3. Consider non-touching loops 2 at a time
4. Consider non-touching loops 3 at a time
5. etc
6. Calculate Δ from steps 2,3,4 and 5
7. Calculate Δi as portion of Δ not touching
forward path i

22
Example1: Apply Mason’s Rule to calculate the transfer function
of the system represented by following Signal Flow Graph

Therefore, C P11  P2  2

R 
There are three feedback loops

L1  G1G4 H1 , L2  G1G2G4 H 2 , L3  G1G3G4 H 2

Continue……
There are no non-touching loops, therefore

∆ = 1- (sum of all individual loop gains)

  1  L1  L2  L3 

  1  G1G4 H 1  G1G2 G4 H 2  G1G3G4 H 2 

Continue……
Eliminate forward path-1

∆1 = 1- (sum of all individual loop gains)+...


∆1 = 1

Eliminate forward path-2

∆2 = 1- (sum of all individual loop gains)+...


∆2 = 1

Continue……
From Block Diagram to Signal-Flow Graph Models
• Example2
H1

R(s) E(s) X － X3 C(s)


G1 G2 G3 G4
－
－
1 X
2
H2

H3

－ H1
R(s) 1 E(s) G1 X1 G 2 X2 G 3 G4 X3 1 C(s)

－ H2

－ H3

Continue……
－ H1
R(s) 1 E(s) G1 X1 G 2 X2 G 3 G4 X3 1 C(s)

－ H2

－ H3

  1  ( G 1G 2 G 3 G 4 H 3  G 2 G 3 H 2  G 3 G 4 H 1 )
P1  G 1G 2 G 3 G 4 ; 1  1

C (s) G 1G 2 G 3 G 4
G 
R ( s ) 1  G 1G 2 G 3 G 4 H 3  G 2 G 3 H 2  G 3 G 4 H 1
Revision

You might also like