CS - Unit I - Lec 05
CS - Unit I - Lec 05
}
MLRITM CS – Unit I
Presentation Outline:
Practice Problems.
• Node:
.
A point representing a variable or a signal.
There are three types of nodes — input node, output node
and mixed node.
• Mixed Node:
It is a node, which has both incoming and outgoing
branches.
.
• Branch: . G .
– Branch is a line segment which joins two nodes.
– It has both gain and direction. The signal passing through a
branch gets multiplied by its gain.
Example:
The nodes present in this signal flow graph are y1, y2,
y3 and y4.
y1 and y4 are the input node and output node respectively.
y2 and y3 are mixed nodes.
There are four branches in the above signal flow graph. These
branches have gains of a, b, c and -d.
Rupa Kumar Dhanavath@ Dept. of ECE 7
MLRITM
• Path:
It is the route of connected branches in the direction
of branch arrows.
• Open Path:
𝑈
. 𝐸
. 𝐺 𝑌
.
A path start at one node ends at another node.
• Forward Path:
A path start at input node ends at output node.
• Closed path/Loop:
A path which starts and ends at the same node.
• Loop Gain:
Loop gain is the product of branch gain which travels in
the loop.
• Non-touching loops:
Loops with no common nodes.
Rupa Kumar Dhanavath@ Dept. of ECE 9
MLRITM
R(s) C(s)
G(s) R(s) G(s) C(s)
1 G(s)
R(s) E(s) C(s) C(s)
G(s) R(s) E(s) H
+_
(s)
H (s)
Rupa Kumar Dhanavath@ Dept. of ECE 10
MLRITM
To get the overall signal flow graph, draw the signal flow
graph for each equation, then combine all these signal flow
graphs:
Step 1: Signal flow graph for 𝑦 2=𝑎 12 𝑦 1+𝑎 42 𝑦 4 is shown below:
Follow these steps for converting a block diagram into its equivalent
signal flow graph.
Represent the input signal R(s) and output signal C(s) of block
diagram as input node R(s) and output node C(s) in signal flow
graph.
Rupa Kumar Dhanavath@ Dept. of ECE 17
MLRITM
Example: 1
1. Calculate forward path transfer function Pk for each forward
path k.
P1 G1G2G3G4
P2
G5G6G7G8
L1 G 2 H L2 H 3 G 3 ,
2. Calculate all
2,
loop TF’s. L4 G7 H 7
3. Consider
L3 G6 H 6 nontouching
, loops 2 at a time.
Loops L1 do not touch Loops L3 and L4
Loops L2 do not touch Loops L3 and L4
Rupa Kumar Dhanavath@ Dept. of ECE 21
MLRITM
Example:
Y (s) P11
TF
P22
5. Calculate Δ.
R(s)
Δ = 1 L1 L2 L3 L4 L1 L3 L1 L4 L2 L3 L2
L4
6. Calculate Δk for each forward
path.
1 1 L3 L4
2 1 L1 L2
G1G2G3G4 1 L3 - L4 G5G6G7G8 1 L1 - L2
L1 L2 L3 L4 L1 L3 L1 L4 L2 L3 L2
7. Therefore, TF is 1
Rupa Kumar Dhanavath@ Dept. of ECE 22
MLRITM
Example:
P1
P2
Example:
Δ =1− ( 𝐿1+ 𝐿2 + 𝐿3 + 𝐿4 ) + ( 𝐿1 𝐿3 + 𝐿1 𝐿4 + 𝐿2 𝐿3 + 𝐿2 𝐿4 )
Example:
Eliminate forward path-1
Δ 1=1 − ( 𝐿3+ 𝐿4 )
Δ 1=1 − ( 𝐺6 𝐻 6 + 𝐺7 𝐻 7 )
Δ 2=1− ( 𝐿1+ 𝐿2 )
Δ 2=1− ( 𝐺 2 𝐻 2 + 𝐺3 𝐻 3 )
Example:
𝑌 (𝑠) 𝑃 1 Δ1 +𝑃 2 Δ 2
=
𝑅(𝑠) Δ
𝑌 ( 𝑠) 𝐺1 𝐺2 𝐺3 𝐺4 [ 1 − ( 𝐺6 𝐻 6 + 𝐺7 𝐻 7 ) ] + 𝐺5 𝐺6 𝐺7 𝐺8 [ 1− ( 𝐺 2 𝐻 2 + 𝐺3 𝐻 3 ) ]
=
𝑅( 𝑠) 1− ( 𝐺2 𝐻 2 + 𝐻 3 𝐺3 +𝐺 6 𝐻 6 +𝐺7 𝐻 7 ) + ( 𝐺2 𝐻 2 𝐺6 𝐻 6 +𝐺 2 𝐻 2 𝐺7 𝐻 7 + 𝐻 3 𝐺3 𝐺6 𝐻 6 + 𝐻 3 𝐺3 𝐺7 𝐻 7 )
Example:2
𝐺5
𝑈 1 𝐴 𝐺1 𝐵 𝐺2 𝐶 𝐺3 𝐷 𝐺4 𝐸 1 𝑌
−𝐻1
−𝐻2 −𝐻3
Forward paths: Loops:
Two non-touchingloops:
𝐿1 = −H1
𝑝1 = 𝐺1𝐺2𝐺3𝐺4
𝐿2 = −𝐺3𝐻2 𝐿1𝐿2 = 𝐻1𝐻2𝐺3
𝑝2 = 𝐺5
𝐿3 = −𝐺4𝐻3 𝐿1𝐿3 = 𝐻1𝐻3𝐺4
( )
𝑝 𝑘 Δ 𝑘 𝑝1 Δ 1+𝑝 2 Δ2 𝐺1 𝐺2 𝐺3 𝐺4 ( Δ 1 ) +𝐺5 ( Δ 2 )
2
¿∑ = =
𝑇𝐹 𝐾=1 Δ Δ Δ
Rupa Kumar Dhanavath@ Dept. of ECE 27
MLRITM
Example:
𝐺5
𝑈 1 𝐴 𝐺1 𝐵 𝐺2 𝐶 𝐺3 𝐷 𝐺4 𝐸 1 𝑌
−𝐻1
−𝐻2 −𝐻3
Δ =1− [ 𝐿1 + 𝐿2 + 𝐿3 ] + [ 𝐿1 𝐿2+ 𝐿1 𝐿3 ]
∆= 1 + 𝐻1 + 𝐺3𝐻2 + 𝐺4𝐻3 + 𝐻1𝐻2𝐺3 + 𝐻1𝐻3𝐺4 ∆1= 1 ∆2= 1 + 𝐻1 + 𝐺3𝐻2
Example: 3
Example:
• In this system there is only one forward path between the input R(s) and the
output C(s). The forward path gain is
𝑃1 = 𝐺1𝐺2𝐺3
• we see that there are three individual loops. The gains of these loops are
𝐿1 = 𝐺1𝐺2𝐻1
𝐿2 = −𝐺2𝐺3𝐻2
𝐿3 = −𝐺1𝐺2𝐺3
• Note that since all three loops have a common branch, there are no non-touching
loops. Hence, the determinant ∆ is given by
∆= 1 − (𝐿1+ 𝐿2 + 𝐿3 )
Therefore,
T C(s) P P
1 1 2 2
1 L1 L 2 L3
Example:05
Example:05
Example:05
Example:05
Example:05
Example:05
∑𝑃 Δ
𝐶 ( 𝑠) 𝑖=1 𝑖 𝑖 𝑃 1 Δ1 + 𝑃 2 Δ 2 + 𝑃 3 Δ 3
= =
𝑅( 𝑠) Δ Δ
Rupa Kumar Dhanavath@ Dept. of ECE 42 42
MLRITM
Example:06
Forward Paths
Example:06
Loop Gains of the Feedback Loops
𝐿1 𝐿3 𝐿2 𝐿4 𝐿3 𝐿5 𝐿4 𝐿6 𝐿5 𝐿7 L6
𝐿1 𝐿4 𝐿2 𝐿5 𝐿3 𝐿6 𝐿4 𝐿7
𝐿1 𝐿5 𝐿2 𝐿6
𝐿1 𝐿6 𝐿2 𝐿8
𝐿1 𝐿8
Rupa Kumar Dhanavath@ Dept. of ECE 45 45
MLRITM
𝐿1 𝐿3
𝐿1 𝐿4 𝐿2 𝐿4
𝐿1 𝐿5 𝐿2 𝐿5 𝐿3 𝐿5 𝐿4 𝐿6
𝐿1 𝐿6 𝐿2 𝐿6 𝐿3 𝐿6 𝐿4 𝐿7 𝐿5 𝐿7 𝐿7 𝐿8
𝐿1 𝐿8 𝐿2 𝐿8
Rupa Kumar Dhanavath@ Dept. of ECE 46 46
MLRITM
H1
H3
- H1
R(s) 1 E(s) G1 X1 G2 X2 G3 X3 G4 C(s)
- H2
- H3
Rupa Kumar Dhanavath@ Dept. of ECE 47 47
MLRITM
Example:07
- H1
R(s) 1 E(s) G1 X1 G2 X2 G3 G4 X3 1 C(s)
- H2
- H3
R(s) + + C(s)
E(s)
- - +
X2
G2
- Y2
-1
X1 G1 Y1
-1
-1 1
R(s) 1 E(s) C(s)
1 1 1
X2 G2 Y2
-1
-1
Example:08
-1
-1 X1
G Y1
-1
1
R(s) 1 E(s) 1 C(s)
1 1 1
X2 G Y2
2
-1 -1
7 loops:
[𝐺1 ⋅(−1)]; [𝐺2 ⋅(− 1)]; [𝐺1 ⋅(−1)⋅𝐺2 ⋅1]; [(− 1)⋅𝐺1 ⋅1⋅(−1)];
[(− 1)⋅𝐺1 ⋅(− 1)⋅𝐺 2 ⋅1⋅(− 1)]; [1⋅ 𝐺2 ⋅1⋅(−1)]; [1⋅ 𝐺2 ⋅1⋅𝐺1 ⋅1⋅(−1)].
3 ‘2 non-touching loops’ :
[𝐺1 ⋅(−1)]⋅[𝐺2 ⋅(−1)]; [(− 1)⋅𝐺1 ⋅1⋅(−1)]⋅[𝐺2 ⋅(−1)];
[1⋅ 𝐺2 ⋅1 ⋅(−1)]⋅[𝐺1 ⋅(− 1)].
Rupa Kumar Dhanavath@ Dept. of ECE 50 50
MLRITM
Example:08
-1
X G Y
-1 1
R(s) 1 E(s) 1
1
-1 1 C(s)
1 X 1 Y 1
G
2 2
2
-1 -1
Then: Δ =1+2 𝐺2 + 4 𝐺1 𝐺 2
4 forward paths:
𝑝 1=(−1)⋅ 𝐺1 ⋅1 Δ1 =1+𝐺 2
𝑝 2=(−1)⋅𝐺1 ⋅(−1)⋅𝐺2 ⋅1 Δ 2=1
𝑝 3=1⋅ 𝐺2 ⋅1 Δ3 =1+ 𝐺1
𝑝 4 =1 ⋅𝐺2 ⋅1⋅ 𝐺1 ⋅1 Δ 4=1
Rupa Kumar Dhanavath@ Dept. of ECE 51 51
MLRITM
Example:08
We have
𝐶 (𝑠) ∑ 𝑝 Δ 𝑘
❑
𝑘
=
𝑅(𝑠) Δ
52
Rupa Kumar Dhanavath@ Dept. of ECE 52
MLRITM
• The signal flow graph of the above block diagram is shown below.
• Because the loops touch the nodes of P1, • Hence the control ratio T = C/R is
hence
1
𝑉 1 (𝑠)= 𝐼 1 (𝑠)+ 𝐼 1 (𝑠) 𝑅
𝐶𝑠
𝐶𝑠 𝑉 1(𝑠)− 𝐶𝑠𝑉 2 (𝑠)=𝐼 1 (𝑠)
𝑉 2 (𝑠)=𝐼 1 (𝑠)𝑅 − 𝐶𝑠
𝐶𝑠 𝑅
Example:12
Example:12
Presentation Outline:
END OF UNIT-I