Control System Engineering

TOPIC
BLOCK DIAGRAM REPRESENTATION

Kuntumal Sagar M.
B.TECH (E.E)
UID-U41000000484
Email-skuntmal@yahoo.com
Mno. +917600941450
 Introduction
• A Block Diagram is a shorthand pictorial representation of
the cause-and-effect relationship of a system.

• The interior of the rectangle representing the block usually

contains a description of or the name of the element, or the
symbol for the mathematical operation to be performed on
the input to yield the output.

• The arrows represent the direction of information or signal

flow.

d
x y
dt
 Introduction
• The output is the algebraic sum of the inputs.
• Any number of inputs may enter a summing point.
• Some books put a cross in the circle.
 Introduction
• Take Off point permits the signal to proceed unaltered
along several different paths to several destinations.
 Example-1
• Consider the following equations in which x1, x2, x3, are variables,
and a1, a2 are general coefficients or mathematical operators.

x3  a1 x1  a2 x2  5
 Example-1
• Consider the following equations in which x1, x2, x3, are variables,
and a1, a2 are general coefficients or mathematical operators.

x3  a1 x1  a2 x2  5
Canonical Form of A Feedback Control System
 Characteristic Equation
• The control ratio is the closed loop transfer function of the system.

C( s ) G( s )

R( s ) 1  G( s )H ( s )

• The denominator of closed loop transfer function determines the

characteristic equation of the system.

• Which is usually determined as:

1  G( s )H ( s )  0
 Example-4
B( s )
1. Open loop transfer function  G( s )H ( s )
E( s )
C( s )
2. Feed Forward Transfer function  G( s )
E( s )
C( s ) G( s ) G(s )
3. control ratio 
R( s ) 1  G( s )H ( s )

B( s ) G( s )H ( s )
4. feedback ratio 
R( s ) 1  G( s )H ( s )
E( s ) 1 H (s )
5. error ratio 
R( s ) 1  G( s )H ( s )
C( s ) G( s )
6. closed loop transfer function 
R( s ) 1  G( s )H ( s )

7. characteristic equation 1  G( s )H ( s )  0

8. closed loop poles and zeros if K=10.

Reduction techniques

1. Combining blocks in cascade

G1 G2 G1G2

2. Combining blocks in parallel

G1
G1  G2
G2
Example-5: Reduce the Block Diagram to Canonical Form.
 Example-5: Continue.

However in this example step-4 does not apply.

However in this example step-6 does not apply.

Reduction techniques

3. Moving a summing point behind a block

G G
G
3. Moving a summing point ahead of a block

G G
1
G

4. Moving a pickoff point behind a block

G G
1
G

5. Moving a pickoff point ahead of a block

G G
G
6. Eliminating a feedback loop

G
G
1  GH
H

G
G
1 G

H 1

7. Swap with two neighboring summing points

A B B A
 Example-8

H2

R _ C
+_ + G1 + G2 G3
+

H1
 Example-8
H2
G1
R _ C
+_ + + G1 G2 G3
+

H1
 Example-8
H2
G1
R _ C
+_ + + G1G2 G3
+

H1
 Example-8
H2
G1
R _ C
+_ + + G1G2 G3
+

H1
 block diagram: reduction example
H2
G1
R _ C
G1G2
+_ + G3
1  G1G2 H1
 block diagram: reduction example
H2
G1
R _ C
G1G2G3
+_ +
1  G1G2 H1
 block diagram: reduction example

R G1G2G3 C
+_ 1  G1G2 H1  G2G3 H 2
 Example-8

R G1G2G3 C
1  G1G2 H1  G2G3 H 2  G1G2G3