Semester –III / ECE / SSNCE

Course Instructor
 …..

1)Input (Controller Reference Digital signal  mathematical signal)

2)Error (Controller Computed Digital signals mathematical signal) t

3)Feedback (Sensors level reduced analog signals)

4)Output (actual analog signals)
5)Disturbance (external & internal sources analog signals)
6)Control Signal (Controller  generated Digital signal mathematical signal)

7)Manipulated Variable (actual analog signal)

a) Branch g
Gain in the path y= g x
x
Signal leaving the point Signal leaving the point c) Loop -h

b) Node y x
y g 1 g 1
i Loop path gain = -gh
z=i(gy- hx)
d) Forward path
-h -h
x g2
y x
Forward path 1 gain = g1g2 g1 1
Forward path 2 gain = g1g3
g3
Note : Every path that leads to the end is a beautiful path unless you don’t get struck
in a loop. I am talking about life not control systems.
Electrical System Signal flow graph
(a) Represent the given system as a signal flow
graph

Hint:  Problems disappear in the appearance of their solutions.

 𝟏 𝟏
− −
𝐑𝟏 𝐑𝟐
𝟏
V1 V2 𝐑𝟐 V3 V3
𝟏 R3 R4 𝟏
i1 i2
𝐑𝟏
-R3

Hint: why should problem be a problem if it was a toy to play with

(a) Represent the given two port network as a
signal flow graph

Hint:  Problems disappear in the appearance of their solutions.

Two port equations
Terminal equations

Equivalent signal flow graph

Hint: why should problem be a problem if it was a toy to play with

(a) Represent the closed loop armature controlled
DC motor system as a signal flow graph

Hint:  Problems disappear in the appearance of their solutions.

 Equivalent signal flow graph

Hint: why should problem be a problem if it was a toy to play with

 Block Diagram Signal flow graph
e = r-b
r c -H
+− G
c r
b = cH 1 c G e 1
H
(a) Represent the given block diagram as a signal
flow graph
𝐂(𝐒)
& Find the Transfer function
𝐑(𝐒)

Note: When blocks become signals then reduction becomes a

formula….
 g3

1 g1 1 g2 1 1
R C

-h1 -h2

Hint: Try to try it you cannot then try ZnTill [ ]

Oh when I was young I derived it

Don’t worry I have a formula

Mason’s Gain formula (graph theory)
𝑃𝑖 ∆𝑖 where

Samuel Jefferson Mason

T =
∆
∆ =1- (−1)𝑘:1 𝑘
𝑘<1
𝑗
𝑗<1 𝑃𝑗𝑘
(1921–1974)
where
𝑃𝑖 is the ith forward path
𝑃𝑗𝑘 is the jth possible product of k non touching loops
∆𝑖 is ∆ evaluated after eliminating all loops touching 𝑃𝑖

Oh my god now how do I find transfer function there is no clarity of where summing
point is and where take off point is…..
Mason’s Gain formula
(graph theory)
where
𝑗
𝑃𝑖 ∆𝑖 ∆ =1- (−1)𝑘:1 𝑘
𝑗<1 𝑃𝑗𝑘
T =
𝑘<1

∆
where
∆ = 1- { sum of all loop gains} + { sum of product of gains of all two non touching
loops}- {sum of product of gains of all three non touching loops} + ……….

where
𝑃𝑖 is the ith forward path
𝑃𝑗𝑘 is the jth possible product of k non touching loops
∆𝑖 is ∆ evaluated after eliminating all loops touching 𝑃𝑖

That is a beautiful formula mason thanks for that ……. ZnTill * +

 Forward path gains
P1 = G1 G2
Loop gains P2 = G1 G3
L1 = - G1 G2 H1 ∆ = 1- {L1 + L2 + L3 }
L2 = - G2 H2 ∆ = 1- (G1 G2 G3 H1 H2 - G1 G2 H1 - G2 H2 )
L3 = G1 G2 G3 H1 H2
∆1 = 1
∆2 = 1

∆𝑖 is ∆ evaluated after eliminating all loops touching 𝑃𝑖

∆ = 1- { sum of all loop gains} + { sum of product of gains of all two non touching loops}- {sum of
product of gains of all three non touching loops} + ……….
 Forward path gains
P1 = G1 G2
P2 = G1 G3
∆ = 1- (G1 G2 G3 H1 H2 - G1 G2 H1 - G2 H2 )
∆1 = 1
∆2 = 1
𝑃𝑖 ∆𝑖
T = ∆

C(S) G1 G2 :G1 G3
=
R(s) 1− (G1 G2G3H1 H2 − G1 G2H1 − G2 H2 )

The same problem in block diagram reduction technique involved interchanging of take off and
summing point that was a little twisty. In signal flow graph method it is achieved straight.
(a) Find the Transfer function of the system
represented in the signal flow graph
H2 H3

G1 G4
G2 G3
R C
G6 G7
G5 G8

H6 H7

Note: When blocks become signals then reduction becomes a

formula….
 𝑃𝑖 ∆𝑖
T = ∆

Forward path gains

P1 = G1 G2 G3 G4
P2 = G5 G6 G7 G8
∆ = 1- (𝐋𝟏 + 𝐋𝟐 + 𝐋𝟑 + 𝐋𝟒 )+(𝐋𝟏 𝐋𝟑 + 𝐋𝟏 𝐋𝟒 + 𝐋𝟐 𝐋𝟑 + 𝐋𝟐 𝐋𝟒)
∆ = 1- (𝐆𝟐 𝐇𝟐 + 𝐆𝟑 𝐇𝟑 +𝐆𝟔 𝐇𝟔 + 𝐆𝟕 𝐇𝟕 )+
Loop gains (𝐆𝟐 𝐇𝟐 𝐆𝟔 𝐇𝟔 +𝐆𝟐 𝐇𝟐 𝐆𝟕 𝐇𝟕 +𝐆𝟑 𝐇𝟑 𝐆𝟔 𝐇𝟔 +𝐆𝟑 𝐇𝟑 𝐆𝟕 𝐇𝟕 )
L1 = G2 H2 ∆ = 1- { 𝐆𝟐 𝐇𝟐 + 𝐆𝟑 𝐇𝟑 +𝐆𝟔 𝐇𝟔 + 𝐆𝟕 𝐇𝟕 }+
L2 = G3 H3 { 𝐆𝟐 𝐇𝟐 (𝐆𝟔 𝐇𝟔 +𝐆𝟕 𝐇𝟕 )+𝐆𝟑 𝐇𝟑 (𝐆𝟔 𝐇𝟔 +𝐆𝟕 𝐇𝟕 ) }
L3 = G6 H6 ∆ = 1- { 𝐆𝟐 𝐇𝟐 + 𝐆𝟑 𝐇𝟑 +𝐆𝟔 𝐇𝟔 + 𝐆𝟕 𝐇𝟕 }+{ (𝐆𝟐 𝐇𝟐 +𝐆𝟑 𝐇𝟑 ) (𝐆𝟔 𝐇𝟔 +𝐆𝟕 𝐇𝟕 ) }
L 4 = G 7 H7

∆1 = 1 − (L3 + L4 ) ∆1 = 1 − (G6 H6 + G7 H7 )
∆2 = 1 −(L1 + L2 ) ∆2 = 1 − (G2 H2 + G3 H3 )

The same problem in block diagram reduction technique involved interchanging of take off and
summing point that was a little twisty. In signal flow graph method it is achieved straight.
 𝑃𝑖 ∆𝑖
T = ∆
∆ = 1- { G2 H2 + G3 H3 +G6 H6 + G7 H7 }+{ (G2 H2 +G3 H3 ) (G6 H6 +G7 H7 ) }
P1 = G1 G2 G3 G4 ∆1 = 1 − (G6 H6 + G7 H7 )
P2 = G5 G6 G7 G8 ∆2 = 1 − (G2 H2 + G3 H3 )

C(S) G1 G2 G3 G4 (1;(G6 H6 :G7 H7 )):G5 G6 G7 G8 (1; G2 H2 :G3 H3 )

=
R(S) 1− , G2 H2 + G3 H3 +G6 H6 + G7 H7 }+, (G2 H2 +G3 H3 ) (G6 H6 +G7 H7 ) }

Mason you are a great man … thank you…..

(a) Find the Transfer function of the system
represented in the signal flow graph
-c
b
a d
R j i C

e h
f
-g

Note: beautiful problem to work out…….

 𝑃𝑖 ∆𝑖
T = ∆

Forward path gains

P1 =abd
P2 = efh
P3 = ajh
P4 = eid
Loop gains P5 = −eicjh
L1 =−bc P6 = −ajgid
L2 =−fg
∆ = 1- (−𝑓𝑔 − 𝑏𝑐 + 𝑖𝑐𝑗𝑔)+( −𝑏𝑐 ∗ *−𝑓𝑔+)
L3 =icjg

∆1 = 1 − (−𝑓𝑔)
∆2 = 1 − (−𝑏𝑐)
∆3 = ∆4 = ∆5 = ∆6 = 1

Mason you are a great man … thank you…..

 𝑃𝑖 ∆𝑖
T = ∆
∆ = 1- (−𝑓𝑔 − 𝑏𝑐 + 𝑖𝑐𝑗𝑔)+( −𝑏𝑐 ∗ *−𝑓𝑔+)
P1 =abd ∆1 = 1 − (−𝑓𝑔)
P2 = efh ∆2 = 1 − (−𝑏𝑐)
P3 = ajh ∆3 = 1
P4 = eid ∆4 = 1
P5 = −eicjh ∆5 = 1
P6 = −ajgid ∆6 = 1

𝐶(𝑆) 𝑎𝑏𝑑(1 + 𝑓𝑔) + 𝑒𝑓𝑔(1 + 𝑏𝑐) + 𝑎𝑗𝑕 + 𝑒𝑖𝑑 − 𝑒𝑖𝑐𝑗𝑕 − 𝑎𝑗𝑔𝑖𝑑

=
𝑅(𝑆) 1 + 𝑓𝑔 + 𝑏𝑐 − 𝑖𝑐𝑗𝑔 + bcfg

Mason you are a great man … thank you…..

 (a) Find the Transfer function of the system
represented in the signal flow graph
l m n

R C
a b c d e

j i h g f

Note: the most wonderful problem I ever worked out… ZnTill * +

 𝑃𝑖 ∆𝑖
T = ∆
L1 = aj P1 = abcde
L2 = bi P2 = lcde
L3 = ch P3 = k
L4 = dg
L5 = ef L8 = kmhij
L6 = n L9 = lij
L7 = kfghij L10 = mde
∆ = 1- (𝑎𝑗 + 𝑏𝑖 + 𝑐𝑕 + 𝑑𝑔 + 𝑒𝑓 + 𝑛 + 𝑘𝑓𝑔𝑕𝑖𝑗 + 𝑘𝑚𝑕𝑖𝑗 + 𝑙𝑖𝑗 + 𝑚𝑑𝑒) +
((𝑎𝑗𝑐𝑕)+(𝑎𝑗𝑑𝑔)+(𝑎𝑗𝑒𝑓)+(𝑎𝑗𝑛)+(𝑎𝑗𝑚𝑑𝑒) + (𝑖𝑗𝑙𝑑𝑔)+(𝑖𝑗𝑙𝑒𝑓)+(𝑖𝑗𝑙𝑛)+(𝑖𝑗𝑙𝑚𝑑𝑒)+(𝑏𝑖𝑑𝑔) +(𝑏𝑖𝑒𝑓)
+(𝑏𝑖𝑛)+(𝑏𝑖𝑚𝑑𝑒)+(𝑐𝑕𝑒𝑓)+(𝑐𝑕𝑛)+(𝑑𝑔𝑛)) + ((𝑎𝑗𝑐𝑕𝑒𝑓)+(𝑎𝑗𝑐𝑕𝑛)+(𝑎𝑗𝑑𝑔𝑛)+(𝑏𝑖𝑑𝑔𝑛))
∆1 = 1
∆2 = 1
∆3 = 1- (𝑏𝑖 + 𝑐𝑕 + 𝑑𝑔) +( 𝑏𝑖𝑑𝑔)
∆𝑖 is ∆ evaluated after eliminating all loops touching 𝑃𝑖
∆ = 1- { sum of all loop gains} + { sum of product of gains of all two non touching loops}- {sum of
product of gains of all three non touching loops} + ……….
 𝑃𝑖 ∆𝑖
T = ∆
P1 = abcde
P2 = lcde
P3 = k
∆1 = 1
∆2 = 1
∆3 = 1- (𝑏𝑖 + 𝑐𝑕 + 𝑑𝑔) +( 𝑏𝑖𝑑𝑔)

𝐶(𝑆) 𝑎𝑏𝑐𝑑𝑒 + 𝑙𝑐𝑑𝑒 + 𝑘(1 − 𝑏𝑖+𝑐𝑕 + 𝑑𝑔 + 𝑏𝑖𝑑𝑔)

=
𝑅(𝑆) 1− (𝑎𝑗 + 𝑏𝑖 + 𝑐𝑕 + 𝑑𝑔 + 𝑒𝑓 + 𝑛 + 𝑘𝑓𝑔𝑕𝑖𝑗 + 𝑘𝑚𝑕𝑖𝑗 + 𝑙𝑖𝑗 + 𝑚𝑑𝑒) +
((𝑎𝑗𝑐𝑕)+(𝑎𝑗𝑑𝑔)+(𝑎𝑗𝑒𝑓)+(𝑎𝑗𝑛)+(𝑎𝑗𝑚𝑑𝑒) + (𝑖𝑗𝑙𝑑𝑔)+(𝑖𝑗𝑙𝑒𝑓)+
(𝑖𝑗𝑙𝑛)+(𝑖𝑗𝑙𝑚𝑑𝑒)+(𝑏𝑖𝑑𝑔)+(𝑏𝑖𝑒𝑓) +(𝑏𝑖𝑛)+(𝑏𝑖𝑚𝑑𝑒)+(𝑐𝑕𝑒𝑓)
+(𝑐𝑕𝑛)+(𝑑𝑔𝑛)) +
((𝑎𝑗𝑐𝑕𝑒𝑓)+(𝑎𝑗𝑐𝑕𝑛)+(𝑎𝑗𝑑𝑔𝑛)+(𝑏𝑖𝑑𝑔𝑛))

Thanks a lot Samuel Jefferson Mason  ZnTill [ ]

(a) Find the Transfer function of the system
represented in the signal flow graph
b c

i j
a d
n
p
R C
m o
h e
l k

g f
Fish it yourself

Note: That is a nice fish… ZnTill * +

 Questions

There is no perfection to be attained, but

trying to attain it we grow…………..
 ZnTill [ ]