0% found this document useful (0 votes)
52 views24 pages

Chapter 4 - System Representation

This document discusses system representation using block diagrams and signal flow graphs. It describes how to represent systems, components, and signal flow using block diagrams in cascade, parallel and feedback forms. It also explains how to represent systems using signal flow graphs and convert between block diagrams and signal flow graphs. Mason's gain formula for obtaining the transfer function from a signal flow graph is presented, along with an example of its application.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views24 pages

Chapter 4 - System Representation

This document discusses system representation using block diagrams and signal flow graphs. It describes how to represent systems, components, and signal flow using block diagrams in cascade, parallel and feedback forms. It also explains how to represent systems using signal flow graphs and convert between block diagrams and signal flow graphs. Mason's gain formula for obtaining the transfer function from a signal flow graph is presented, along with an example of its application.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

DMT 354

CONTROL PRINCIPLE
CHAPTER 4
System Representation
Block Diagram
Signal Flow Graph
Block Diagram
 A block diagram of a system is a practical representation of the
functions performed by each component and of the flow of
signals.
 Components of a block diagram:
Cascade Form

 Intermediate signal values are shown at the output of each


subsystem.
 Each signal is derived from the product of the input times the
transfer function.
Parallel Form
Feedback Form
Block Diagram
 Feedback Control System
The negative feedback of
the control system is
given by:
Ea(s) = R(s) – H(s)Y(s)
Y(s) = G(s)Ea(s)

Therefore,
Y ( s ) = G ( s )[ R( s ) − H ( s )Y ( s )]
Y (s) G (s)
=
R( s) 1 + G ( s) H ( s)
Block Diagram Reduction
 Reduction Rules
Block Diagram Reduction
 Reduction Rules
Block Diagram Reduction
 Rules:
1. Rearrange summing junction for loops.
2. Simplified loops and combine any cascade block.
3. Get transfer function.
Example 1:
Example 2:

3
C (s) s +1
= 4 2
R( s) 2s + s + 2s
Problem
 Find transfer function Y(s)/U(s)

 Solution:
U(s) G1G2G3G4 Y(s)
1 − G3G4 H1 + G2G3 H 2 + G1G2G3G4 H 3
Signal Flow Graph Models
 A signal flow graph is a graphical representation of the
relationships between the variables of a set of linear algebraic
equations.
 The basic element of a signal-flow graph is a unidirectional
path segment called a branch.
 The input and output points or junctions are called nodes.
 A path is a branch or continuous sequence of branches that can
be traversed from one signal (node) to another signal (node).
 A loop is a closed path that originates and terminates on the
same node, and along the path no node is met twice.
 Two loops are said to be nontouching if they do not have a
same common node.
Signal Flow Graph Models

System Signal Interconnection of systems and signals


(branch) (node)
Signal Flow Graph Models
Convert Block Diagram to
Signal Flow Graph
Signal Flow Graph Models
Mason’s Gain Formula for Signal Flow Graphs
Mason’s gain formula is given by:

∑P ∆ k k
T= k

Where,

k = Number of forward path
Pk = The kth forward-path gain

∆ = 1 − ∑ loop gains + ∑ nontouching-loop gains taken two at a time


− ∑ nontouching-loop gains taken three at a time + ∑ gains
nontouching-loop
taken four at
a time +….
∆k = Cofactor of the kth forward path determinant of the graph.
Mason’s Rule Method
Obtain transfer function:
 Identify the forward-path gains.
 Identify the loop gains.
 Identify the nontouching loops taken 2 at a time.
 The nontouching loops taken 3 at a time.
1. Form Δ
2. Form Δk by eliminating from Δ the loop gains that
touch the kth forward path.
3. Use Mason’s gain formula to find transfer function.
Signal Flow Graph Models
Example 1: Transfer function of interacting system

The paths connecting the input R(s) and output Y(s) are

Path 1: P1 = G1G2G3G4
Path 2: P2 = G5G6G7 G8
Signal Flow Graph Models
There are four individual loops:
L1 = G2 H 2
L2 = G3 H 3
L3 = G6 H 6
L4 = G7 H 7
Loops L1 and L2 do no touch L3 and L4 . Therefore the determinant is
∆ = 1 − ( L1 + L2 + L3 + L4 ) + ( L1 L3 + L1 L4 + L2 L3 + L2 L4 )
The cofactor of the determinant along path 1 is evaluated by removing
the loops that touch path 1 from ∆ . Therefore we have

L1 = L2 = 0 and ∆1 = 1 − ( L3 + L4 )

Similarly , the cofactor for path 2 is ∆ 2 = 1 − ( L1 + L2 )


Signal Flow Graph Models
Continue…

Y ( s) P1∆1 + P2 ∆ 2
= T (s) =
R( s) ∆

G1G2G3G4 (1 − L3 − L4 ) + G5G6G7G8 (1 − L1 − L2 )
=
1 − L1 − L2 − L3 − L4 + L1 L3 + L1 L4 + L2 L3 + L2 L4
Signal Flow Graph Models
Problem: Obtain closed-loop transfer function by use of Mason’s gain forward
Further Reading

 Dorf, Modern Control System


 Chapter 2

 Nise, Control Engineering


 Chapter 5

You might also like