Download - Signal flow graph Mason’s Gain Formula
![Page 1: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/1.jpg)
TopicSignal Flow Graph
![Page 2: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/2.jpg)
What is Signal Flow Graph? SFG is a diagram which represents a set of simultaneous equations. This method was developed by S.J.Mason. This method does n’t require any reduction technique. It consists of nodes and these nodes are connected by a directed line called branches. Every branch has an arrow which represents the flow of signal. For complicated systems, when Block Diagram (BD) reduction method becomes tedious and time consuming then SFG is a good choice.
![Page 3: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/3.jpg)
Comparison of BD and SFG
)(sR)(sG
)(sC )(sG
)(sR )(sC
block diagram: signal flow graph:
In this case at each step block diagram is to be redrawn. That’s why it is tedious method.So wastage of time and space.
Only one time SFG is to be drawn and then Mason’s gain formula is to be evaluated.So time and space is saved.
![Page 4: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/4.jpg)
SFG
![Page 5: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/5.jpg)
Node: It is a point representing a variable. x2 = t 12 x1 +t32 x3
X2
X1 X2
X3
t12
t32
X1
Branch : A line joining two nodes.
Input Node : Node which has only outgoing branches.
X1 is input node.
In this SFG there are 3 nodes.
Definition of terms required in SFG
![Page 6: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/6.jpg)
Output node/ sink node: Only incoming branches.
Mixed nodes: Has both incoming and outgoing branches.
Transmittance : It is the gain between two nodes. It is generally written on the branch near the arrow.
t12
X1
t23
X3
X4
X2
t34
t43
![Page 7: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/7.jpg)
• Path : It is the traversal of connected branches in the direction of branch arrows, such that no node is traversed more than once.• Forward path : A path which originates from the input node and terminates at the output node and along which no node is traversed more than once.• Forward Path gain : It is the product of branch transmittances of a forward path.
P 1 = G1 G2 G3 G4, P 2 = G5 G6 G7 G8
![Page 8: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/8.jpg)
Loop : Path that originates and terminates at the same node and along which no other node is traversed more than once.
Self loop: Path that originates and terminates at the same node.
Loop gain: it is the product of branch transmittances of a loop. Non-touching loops: Loops that don’t have any common node
or branch.
L 1 = G2 H2 L 2 = H3
L3= G7 H7
Non-touching loops are L1 & L2, L1 & L3,
L2 &L3
![Page 9: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/9.jpg)
SFG terms representation
input node (source)
b1x a
2x c
4x
d13x
3x
mixed node mixed node
forward path
path
loop
branch
node
transmittance input node (source)
![Page 10: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/10.jpg)
Mason’s Gain Formula
• A technique to reduce a signal-flow graph to a single transfer function requires the application of one formula.
• The transfer function, C(s)/R(s), of a system represented by a signal-flow graph is
k = number of forward path Pk = the kth forward path gain∆ = 1 – (Σ loop gains) + (Σ non-touching loop gains taken two at a
time) – (Σ non-touching loop gains taken three at a time)+ so on .
∆ k = 1 – (loop-gain which does not touch the forward path)
![Page 11: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/11.jpg)
Ex: SFG from BD
![Page 12: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/12.jpg)
Construction of SFG from simultaneous equations
![Page 13: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/13.jpg)
t21 t 23
t31
t32 t33
![Page 14: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/14.jpg)
![Page 15: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/15.jpg)
After joining all SFG
![Page 16: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/16.jpg)
SFG from Differential equations
xyyyy 253Consider the differential equation
Step 2: Consider the left hand terms (highest derivative) as dependant variable and all other terms on right hand side as independent variables.Construct the branches of signal flow graph as shown below:-
1
-5-2
-3
y
y
y y
x
(a)
Step 1: Solve the above eqn for highest order
yyyxy 253
![Page 17: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/17.jpg)
y
x
y
y
y
1-2
-5
-31/s
1/s
1/s
Step 3: Connect the nodes of highest order derivatives to the lowest order der.node and so on. The flow of signal will be from higher node to lower node and transmittance will be 1/s as shown in fig (b)
(b)
Step 4: Reverse the sign of a branch connecting y’’’ to y’’, with condition no change in T/F fn.
![Page 18: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/18.jpg)
Step5: Redraw the SFG as shown.
![Page 19: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/19.jpg)
Problem: to find out loops from the given SFG
![Page 20: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/20.jpg)
Ex: Signal-Flow Graph Models
![Page 21: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/21.jpg)
P 1 =
P 2 =
![Page 22: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/22.jpg)
Individual loops
L 1 = G2 H2
L 4 = G7 H7
L 3 = G6 H6
L 2= G3 H3
Pair of Non-touching loops L 1L 3 L 1L 4
L2 L3 L 2L 4
![Page 23: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/23.jpg)
..)21(1( LiLjLkiLjLLL
PRY kk
Y s( )R s( )
G 1 G 2 G 3 G 4 1 L 3 L 4 G 5 G 6 G 7 G 8 1 L 1 L 2
1 L 1 L 2 L 3 L 4 L 1 L 3 L 1 L 4 L 2 L 3 L 2 L 4
![Page 24: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/24.jpg)
Block Diagram Reduction Example
R_+
_+1G 2G 3G
1H
2H
+ +
C
![Page 25: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/25.jpg)
![Page 26: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/26.jpg)
R
R
![Page 27: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/27.jpg)
R
![Page 28: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/28.jpg)
R_+
232121
321
1 HGGHGGGGG
C
R
321232121
321
1 GGGHGGHGGGGG
C
![Page 29: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/29.jpg)
Solution for same problem by using SFG
![Page 30: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/30.jpg)
Forward Path
P 1 = G 1 G 2 G3
![Page 31: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/31.jpg)
Loops
L 1 = G 1 G 2 H1 L 2 = - G 2 G3 H2
![Page 32: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/32.jpg)
L 3 = - G 1 G 2 G3
P 1 = G 1 G 2 G3
L 1 = G 1 G 2 H1
L 2 = - G 2 G3 H2
L 3 = - G 1 G 2 G3
∆1 = 1
∆ = 1- (L1 + L 2 +L 3 )
T.F= (G 1 G 2 G3 )/ [1 -G 1 G 2 H1 + G 1 G 2 G3 + G 2 G3 H2 ]
![Page 33: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/33.jpg)
SFG from given T/F
( ) 24( ) ( 2)( 3)( 4)
C sR s s s s
)21()2(1
1
1
ss
s
![Page 34: Signal flow graph Mason’s Gain Formula](https://reader033.vdocuments.site/reader033/viewer/2022061617/5878ee1c1a28abfa038b7203/html5/thumbnails/34.jpg)
Thanks ……….