[go: up one dir, main page]

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

Signal Flow Graph Analysis

The document outlines signal flow graphs and Mason's rule for determining overall transfer functions. Signal flow graphs represent systems as nodes and edges to model how variables are related by transfer functions. Mason's rule gives the overall transfer function in terms of forward path gains, loop gains, and products of non-touching loop gains. It eliminates the effect of any loops that touch the forward path. The example shows applying Mason's rule to find the transfer function of a feedback control system.

Uploaded by

G Munhu
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)
89 views5 pages

Signal Flow Graph Analysis

The document outlines signal flow graphs and Mason's rule for determining overall transfer functions. Signal flow graphs represent systems as nodes and edges to model how variables are related by transfer functions. Mason's rule gives the overall transfer function in terms of forward path gains, loop gains, and products of non-touching loop gains. It eliminates the effect of any loops that touch the forward path. The example shows applying Mason's rule to find the transfer function of a feedback control system.

Uploaded by

G Munhu
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

Outline

• Signal flow graph notation.


Signal Flow Graphs • Signal flow graph from block diagram.
• Mason’s rule.
M. Sami Fadali • Transfer function.
EBME Dept.
University of Nevada

1 2

Notation Nise’s Approach


R(s) V1(s) V2(s) C(s) R(s) V1(s) V2(s) C(s)
• Node variable = sum of flows into the node G1(s) G2(s) G3(s)
G1(s) G2(s) G3(s)
(no subtraction) R(s) V1(s) V2(s) C(s)
• Node for each variable.
• Line for each transfer function. V1(s)
G1(s) 1
G1(s)
C(s) V1(s) C(s) R(s)
R(s) R(s) G2(s) 1 G2(s)
R(s) C(s) R(s) C(s) V2(s) C(s)
V2(s)
G(s) G3(s) 1
G(s) V3(s) G3(s)
V3(s)
R(s) E(s) R(s) E(s)
1 R(s) E(s) R(s) E(s) C(s) C(s)
C(s) +
+ G(s) G(s)
G(s) R(s) 1
1 E(s) C(s)

C(s)   H(s) H(s)
3 4
SFG from Block Diagram Ex. SFG from Block Diagram
1. Draw a node for each input (source) and output
(sink).
2. Draw a node for each summing junction output.
3. Draw a node for each additional pickoff point.
4. Move minus to each block preceding subtraction. 1
= − ⇔ =
5. Draw edges to connect the nodes and label them +
with transfer functions.

5 6

Ex. SFG from Block Diagram


Feedback Control System

Not a loop
1
=
+3
100 100 1/
= =
+2 1 + 2/
= +5
7 8
Mason’s Rule Forward Path Gains
Gives overall transfer function in terms of:
• Forward path gains (no vertices repeat).
• Loop gains (path starts and ends at same node).
• Products of loop gains for nontouching loops. T1  G7 G5G 4 G3G 2 G1
• Nontouching loops: no common nodes.
T2  G7 G6 G 4 G3G 2 G1
• Two nontouching loops, three nontouching
loops, …. or T  G 7 (G5  G 6 )G 4 G3G 2 G1
9 10

Loop Gains Mason’s Rule


• The overall transfer function is

(i ) G 2 H 1 , G 4 H 2 , G 4 (G5  G 6 ) H 3
(ii ) G2 H1G4 H 2 , G2 H1G4 (G5  G6 ) H 3 i.e. eliminate all loops touching path
11 12
Example Forward Path Gains
• Find the overall transfer function using
Mason’s rule

T1  G5G 4 G3G 2 G1
13 14

Loop Gains Calculation


(1) G2 H1 , G4 H 2 , G7 H 4 , G2G3G4G5G6G7G8
(2) G2 H1G4 H 2 , G2 H1G7 H 4 , G4 H 2G7 H 4
(3) G2 H1G4 H 2G7 H 4
Δ = 1 − ∑loop gains + 2 non−touching loop gains

− 3 non−touching loop gains


(1) G2 H1 , G4 H 2 , G7 H 4 , G2G3G4G5G6G7G8
  1  G 2 H 1  G 4 H 2  G7 H 4  G 2 G3G 4 G5G6 G7 G8 
(2) G2 H1G4 H 2 , G2 H1G7 H 4 , G4 H 2G7 H 4
 G 2 H 1G 4 H 2  G 2 H 1G7 H 4  G 4 H 2 G7 H 4 
(3) G2 H1G4 H 2G7 H 4 15  G 2 H 1G 4 H 2 G7 H 4 16
Ex. Mason’s Rule
Apply Mason’s Rule
T1  G3G2G1 T2  G3G1
(1)  H1G2G1 , H 2G2 , H 3G3
1
(2) H1G2G1 H 3G3 , H 2G2 H 3G3

C (s) 
Tk  k
  1  H1G2G1  H 2G2  H 3G3 G (s)   k
R(s) 
 H1G2G1 H 3G3  H 2G2 H 3G3
T1  G5G 4 G3G 2 G1 G G G  G3G1
 3 2 1

1  1  G7 H 4
C ( s ) T1 1 G5 G 4 G3G 2 G1 1
G (s)   
R(s)   17 18

You might also like