CHAPTER-3

PART-1
BLOCK DIAGRAM REDUCTION

14
DEFINITION OF BASIC ELEMENTS OF BLOCK
DIAGRAM

1. BLOCK DIAGRAM: The shorthand pictorial

representation of the cause-and-effect
relationship between the input and
output of a physical system.

15
2. OUTPUT: The value of input multiplied by
the block gain
C(s) = G(s)R(s)
3. SUMMING POINT: A point at which two or
more signals can be added or subtracted.

16
4. TAKE - OFF POINT: Thepoint at which the
output signal of any block can be applied
to two or more points.

17
5. FORWARED PATH: The direction of flow of
signal from input to output.
6. FEEDBACK PATH: The direction of flow
signal from output to input .

18
RULES FOR BLOCK DIAGRAM REDUCTION

RULE-1: ASSOCIATIVE LAW

19
RULE-2: FOR BLOCKS IN
CASCADE(SERIES)

20
RULE 3: FOR BLOCKS IN PARALLEL

21
RULE 4: ELIMINATING FEEDBACK LOOP

22
RULE 5: SHIFFTING A SUMMING POINT
BEFORE A BLOCK

23
RULE 6: SHIFTING OF SUMMING POINT
AFTER A BLOCK

24
RULE 7: SHIFTIN OF TAKE-OFF POINT BEFORE
A BLOCK

25
RULE 8: SHIFTING OF TAKE-OFF POINT AFTER
A BLOCK

26
Exp1: Find the transfer function Y(s)/R(s)

29
 Exp 2: find C/R

H2

R _ C
+_ + G1 + G2 G3
+

H1

30
 Soln

H2
G1
R _ C
+_ + + G1 G2 G3
+

H1

31
 Cont’

H2
G1
R _ C
+_ + + G1G 2 G3
+

H1

32
 Cont’

H2
G1
R _ C
+_ + + G1G 2 G3
+

H1

33
 Cont’

H2
G1
R _ C
+_ + + G1G 2 G3
+

H1

34
 Cont’

H2
G1
R _
G1G 2 C
+_ + G3
1 − G1G 2 H 1

35
 Cont’

H2
G1
R _
G1G 2 G 3 C
+_ +
1 − G1G 2 H 1

36
 Cont’

R G1G 2 G 3 C
+_ 1 − G1G 2 H 1 + G 2 G 3 H 2

37
 Cont’

R G1G 2 G3 C
1 − G1G 2 H 1 + G 2 G3 H 2 + G1G 2 G 3

38
Exp 3: Find the transfer function Y(s)/R(s)

39
Soln

40
Exp 4: Find the o/p of the system shown in the fig. below

42
 CHAPTER-3
PART-2
SIGNAL FLOW DIAGRAM (SFG)

43
 SFG
SFG: pictorial representation of a system
which displays graphically the transmission
of signals
-Simplified version of a block diagram
-In SFG all variables are represented by the
nods, and the lines joining the nods are called
branches.
y2 = a12y1

44
BASIC DEFINITIONS IN SFG

45
 FROM THE ABOVE FIGURE

INPUT/SOURCE NODE: The node having only

outgoing branches is called input or source node.
y1 is the input or source node.
SINK NODE: The node having only incoming
branches. Y7 is the sink or output node.
CHAIN NODE: The node having both incoming and
outgoing branches. Y2 , y3 , y4 , y5 and y6 are all
chain nodes.

46
FORWARD PATH: A path from input to output.
Y1 – Y2 – Y3 – Y4 – Y5 – Y6 – Y7 : First forward path
Y1 – Y2 – Y3 – Y6 – Y7 : Second forward path

Any node should not be repeated twice.

FEEDBACK LOOP/FEEDBACK PATH: A loop that

originates and terminates at the same node.
• Y2- y3 – y2 : First feedback loop
• Y2 –y3 – y4 – y5 – y2 : Second feedback loop
• Y4 – y5 – y4 : third feedback loop

47
SELF LOOP: A loop that consists of only one node.
In determining forward path or feedback path, the
self-loop should not be taken into account.
-H4, at y6, is the self loop.

PATH GAIN: The product of gains going through a

forward path .
The path gain for the first forward path is
P1 = 1*G1*G2*G3*G4*1 and
The path gain for the second path is
P2 = 1*G1*G5*1
48
LOOP GAIN: The product of all gains of the
branches forming a loop.

The loop gain for the first feedback loop is

L1 = -G1*H1

The loop gain for the second feedback loop is

L2 = -G1*G2*G3*H3

The loop gain for the third feedback loop is

L3 = -G3*H2
L4 = -H4 (self-loop)
49
NON-TOUCHING LOOPS: If there is no node
common between two or more loops.
L1 and L3 are non-touching loops.
But L2 is touching to L1 and L3

If no node is common between a forward path and a

feedback loop, this loop is non-touching to the
forward path.
L3 is non-touching to P2

50
 RULES FOR SFG

1. ADDITION RULE
y1 = a21y2 + a31y3 + a41y4 + a51y5

51
2. TRANSMISSION RULE
y6 = a16y1 , y7 = a17y1 , y1 = a18y1

52
3. MULTIPLICATION RULE

53
Exp 1: Construct the signal flow graph of the following set of
simultaneous equations making X4 as output node

x1 = ax 0 + bx1 + cx 2
x 2 = dx1 + ex 3
x 3 = fx0 + gx 2
x 4 = hx 3

54
Exp 2: Construct the signal flow graph for the network
shown in the Fig. (a), making V3 as output node.

55
 MASON’S GAIN FORMULA
The Mason gain formula can be used to obtain the
transfer function between input variable R(s) and
output variable C(s) as :

56
pk → k-th forward path gain
∆ k → cofactor of pk : make the b ranch gains, which
touch the k-th forward path, are zero in ∆.
∑ L1 → sum of all different loop gains.
∑ L2 → sum of the gain products of all combinat ion of
2 non-touching loops.
∑ L3 → sum of th e gain products of all combina tion of
3 non-touching loops.
•••
57
Exp 1: Find the tf of the system shown in the Fig.
using Mason’s gain formula.

58
Solution

59
Exp 2: Using Mason’s gain formula determine the gain
Y(s)/R(s) in the SFG shown

60
Exp 3: Using Mason’s gain formula determine the gain
Y(s)/R(s) in the SFG shown

61
 CONSTRUCTION OF SFG FROM BLOCK
DIAGRAM
1. Variables, summing and take-off points are
represented by nodes
2. If a summing point is placed before a take-off
point, represent summing and take-off point by a
single node.
3. If a summing point is placed after a take-off point,
represent summing and take-off point by a
separate nodes connected with a line having unity
transmittance.
4. TF is represented by line

62
Exp 1: From the system block diagram obtain system SFG

63
Exp 2: From the system block diagram obtain system SFG

64