CONTROL SYSTEMS

(L11)
Signal Flow Graph: The overall system is
represented by signal flow graph where
individual TFs are represented by gains
Signal-flow graph components:
a. system;

b. Nodes: inputs, outputs

and junctions(summing points and takeoff points)

c. Forward paths (moving from input node to output node)

Path:
1 Paths: 3
 d. Loops;

e. Summing and pickoff points as one node if

summing point precedes pickoff point

f. Summing and pickoff points as separate nodes if

pickoff point precedes summing point

g. Gain in negative feedback is considered as

negative
 Converting a block diagram to a signal-flow graph

take off take off

point point output

No of
nodes=7 input Summing Summing Summi
point and take ng
off points point
Converting a block diagram to a signal-flow graph

No of nodes=6

1 1
TF by Masons Rule: The Transfer function. C(s)/ R(s),
of a system represented by a signal-flow graph is
 Example1: Transfer function using
Masons rule

Forward path (1) :

P1 =
G1(s)G2(s)GL
Loops(4): 3(s)G 4(s)G5(s)
1= G2(s)H1(s), L2=G4(s)H2(s), L3=G7(s)H4(s),
L4=G
Two 2(s)G3(s)G4(s)G
nontouching 5(s)G6(s)G
loops(3 ): L712(s)G
= G82(s)
(s)H1(s)G4(s)H2(s), L13=G2(s)H1(s)G7(s)H4(s),
LThree
23=G4(s)H 2(s)G7(s)H4(s)
nontouching loops(1): L123=G2(s)H1(s)G4(s)H2(s)G7(s)H4(s)

= 1-[G2(s)H1(s)+G4(s)H2(s)+G7(s)H4(s)+ G2(s)G3(s)G4(s)G5(s)G6(s)G7(s)G8(s)] +
[G2(s)H1(s)G4(s)H2(s) + G2(s)H1(s)G7(s)H4(s) + G4(s)H2(s)G7(s)H4(s)]
[G2(s)H1(s)G4(s)H2(s)G7(s)H4(s)]
Example2: Transfer function using
Masons rule
Forward
paths(2):

Individual
loops(3):
Example3: Transfer function using
Masons rule
Forward paths
(6)

Individual
Loops(3):

Two nontouching
loops (2):
Example4: Transfer function using
Masons rule
 Forward paths
(2):
Individual
Loops(3):