Topics

•Need of Block diagram

•Transfer Function from block diagram
•How to reduce Block diagram
(8 Rules to reduce block diagrams)
Need of Block Diagram Algebra

 If the system is simple & has limited parameters then it

is easy to analyze such systems using the methods

discussed earlier i.e. transfer function, if the system is

complicated and also have number of parameters then

it is very difficult to analyze it.

.. .. 2
Need of Block Diagram Algebra

 To overcome this block diagram

problem representation method is
 used.
It is a simple way to represent any practically
complicated system. In this each component of the
system is represented by a separate block known as
functional block.
 These blocks are interconnected in a proper sequence.

.. .. 3
Block Diagram Fundamentals

 Block Diagram: It is shorthand, pictorial representation

of the cause and effect relationship between input and

output of a physical system.

Inpu Outpu
t
BLOCK t

.. .. 4
Block Diagram Fundamentals

 Output: The value of the input is multiplied to

the value of block gain to get the output.

X(s Y(s
)
3s )

Outpu Y(s)= 3s.

.. t .. X(s) 5
Block Diagram Fundamentals

 Summing Point: Two or more signals can be

added/ substracted at summing point.

y
+
x outpu
+ t Output
=x+y-z
-
z

.. .. 6
Block Diagram Fundamentals

 Take off Point: The output signal can be applied to two

or more points from a take off point.

Z Z

Take off
.. Z point 10
3
Block Diagram Fundamentals
 Forward Path: The direction of flow of signal is from input
to output
Forward Path

G1 G2
C(s
R(s)
)
+ -

H1

Feedback Path
 Feedback Path: The direction of flow of signal is from
output to input
.. .. 8
 Block Diagram Reduction Techniques

Rule 1: For blocks in cascade

Gain of blocks connected in cascade gets
multiplied with each other.

R(s C(s
R(s G1 R1(s) G2 C(s G1G2
) ) ) )

R1(s)=G1R(
s) C(s)=
C(s) =G2R1(s) G1G2R(s)
=G1G2R(
s)
.. .. 9
 R(s G1 G2 G3 C(s
) )
Find
Equivalent

R(s G1G2G3 C(s

) )

.. .. 10
 R(s G1 G2 G3 C(s
) )

R1(s)

Find
Equivalent

R(s
G1G2G3
C(s R(s G1G2 G3 C(s
) ) ) )

R1(s
.. .. 10
) 7
 Block Diagram Reduction Techniques
Rule 2: For blocks in Parallel
Gain of blocks connected in parallel gets added
algebraically.
G1 R1(s
)

+
R(s C(s R(s G1-G2+G3 C(s
)
G2 R2(s) -
) ) )
+
G3 R3(s
)

C(s)= R1(s)-R2(s) C(s)= (G1-G2+G3)

+R3(s) R(s)
= G1R(s)-G2R(s)
+G3R(s)
.. .. 12
C(s)=(G1-G2+G3)
 Block Diagram Reduction Techniques

Rule 3: Eliminate Feedback Loop

R(s)
E(s G C(s
+ ) )
R(s G C(s
+ ) )
1  GH
-
B(s H
)

C(s) G
 In
R(s) 1  General
GH
.. .. 13
 From Shown
Figure,
E(s)  R(s)  B(s)
an
R(s d C(s)  G.E(s)
E(s C(s
)
+- )
G )
 G[R(s) 
B(s)]
Bu  GR(s)  GB(s)
B(s t B(s)  H.C(s)
)
H
C(s)  G.R(s) 
G.H.C(s)
C(s)  G.H.C(s  GR(s)

C(s){1 G.H}  G.R(s)

For Negative C(s)

 
.. Feedback .. 14
 From Shown Figure,
E(s)  R(s) 
an B(s)
R(s d C(s)  G.E(s)
E(s C(s
) +
)
G )  G[R(s) 
+
B(s)]
B(s
Bu  GR(s) 
)
H t GB(s)
B(s)  H.C(s)
C(s)  G.H.C(s)  GR(s)
C(s)  G.R(s) 
G.H.C(s)
C(s){1 G.H}  G.R(s)

For Positive C(s) G

 
.. Feedback .. R(s) 11
1
 Block Diagram Reduction Techniques

Rule 4: Associative Law for Summing Points

The order of summing points can be changed if two or more
summing points are in series

C(s R(s) C(s

R(s) + X
) + X
)
+ +
- -
B1 B B2 B
2 1
X=R(s)- X=R(s)-
B1 B2
C(s)=X-B1
C(s)=X-
C(s)=R(s)-B1- C(s)=R(s)-B2-
..
B2 ..
B1 16
 Block Diagram Reduction Techniques

Rule 5: Shift summing point before block

+ C(s
R(s G )
R(s)
G C(s
) + )
+ +
X 1/G

C(s)=R(s)G
C(s)=G{R(s)
+X
+X/G}
=GR(s)+X
.. .. 17
 Block Diagram Reduction Techniques

Rule 6: Shift summing point after block

R(s) C(s + C(s

+ G )
R(s
)
G )
+ +

X G
X

C(s)=G{R(s) C(s)=GR(s)
+X} +XG
.. =GR(s) .. =GR(s)+XG 18
 Block Diagram Reduction Techniques

Rule 7: Shift a take off point before block

C(s
R(s
)
G )
R(s
)
G C(s
)

G
X
X

C(s)=GR(s) C(s)=GR(
and s)
X=C(s)=GR( and
s) X=GR( 19
.. ..
s)
 Block Diagram Reduction Techniques

Rule 8: Shift a take off point after block

R(s C(s
R(s
)
G C(s
) )
G )

1/G
X

C(s)=GR(s)
C(s)=GR( and
s) X=C(s).
an {1/G}
d .. =GR(s) 11
X=R(s) 6
Block Diagram Reduction Techniques

 While solving block diagram for getting single

block

equivalent, the said rules need to be applied. After

each simplification a decision needs to be taken. For

each decision we suggest preferences as

.. .. 21
Block Diagram Reduction Techniques

First Choice

First Preference: Rule 1 (For series)

Second Preference: Rule 2 (For parallel)

Third Preference: Rule 3 (For FB loop)

.. .. 22
Block Diagram Reduction Techniques

Second Choice
(Equal Preference)

Rule 4 Adjusting summing order

Rule 5/6 Shifting summing point before/after

block Rule7/8

Shifting take off point before/after block

.. .. 23