0% found this document useful (0 votes)
3 views

Module_2

The document provides an overview of block diagrams and signal flow graphs used in control systems, detailing the basic elements such as blocks, summing points, and take-off points. It explains series and parallel connections, feedback connections, and the rules for simplifying block diagrams. Additionally, it introduces signal flow graphs, their construction, and Mason's gain formula for calculating transfer functions.

Uploaded by

kirupans2k
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)
3 views

Module_2

The document provides an overview of block diagrams and signal flow graphs used in control systems, detailing the basic elements such as blocks, summing points, and take-off points. It explains series and parallel connections, feedback connections, and the rules for simplifying block diagrams. Additionally, it introduces signal flow graphs, their construction, and Mason's gain formula for calculating transfer functions.

Uploaded by

kirupans2k
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

06-01-2024

BLOCK DIAGRAM BLOCK


Block diagrams consist of a single block or a combination of The transfer function of a component is represented by a block.
blocks which are used to represent the control systems in Block has single input and single output.
pictorial form. The following figure shows ablock having input X(s), output Y(s) and
the transfer function G(s).
Basic elements of Block Diagram
Block
Summing Point
Take-off Point
Arrows indicate the
direction of the flow of
signals. Output of the block is obtained by multiplying transfer function of the block
with input.

Summing Point Summing Point


The following figure shows the summing point with two inputs (A, B) The following figure shows the summing point with two inputs (A, B)
and one output (Y). and one output (Y).
Here, the inputs A and B have a positive sign. Here, the inputs A and B are having opposite signs, i.e.,A is having
So, the summing point produces the output,Y as sum of A and B. positive sign and B is having negative sign.
[Y=A+B] So, the summing point produces the output Y as the difference of
A and B.[Y=A+(-B)=A-B]

1
06-01-2024

Summing Point Take-off Point


The following figure shows the summing point with In the following figure, the take-off point is used to connect the
three inputs (A, B, C) and one output(Y). same input, R(s) to two more blocks.
Here, the inputs A and B are having positive signs and C is
having a negative sign.
So, the summing point produces the output Y as
Y = A + B + (−C) = A + B − C.

Series Connection Series Connection


Series connection is also called cascade connection. Compare this equation with the standard form of the output
In the following figure, two blocks having transfer functions equation,
G1(s) and G2(s) are connected in
series.
That means we can represent the series connection of two blocks
with a single block.
The transfer function of this single block is the product of the
transfer functions of those two blocks.
The equivalent block diagram is shown below.

2
06-01-2024

Parallel Connection Parallel Connection


The blocks which are connected in parallel will have the same
input.
In the following figure, two blocks having transfer functions G1(s) and
G2(s) are connected in parallel.
The outputs of these two blocks are connected to the summing
point.

Parallel Connection Feedback Connection


Compare this equation with the standard form of the output The following figure shows negative feedback control system.
equation, Here, two blocks having transfer functions G(s) and H(s) form a
closed loop.

That means we can represent the parallel connection of two


blocks with asingle block.
The transfer function of this single block is the sum of the transfer
functions of those two blocks.
The equivalent block diagram is shown below.

3
06-01-2024

Feedback Connection Feedback Connection


This means we can represent the negative feedback connection of
two blocks with asingle block.
The transfer function of this single block is the closed loop transfer
function of the negative feedback.
The equivalent block diagram is shown below.

Similarly, you can represent the positive feedback connection of two blocks
with a single block.
The transfer function of this single block is the closed loop transfer function
of the positive feedback,

Shifting Summing Point After the Block Shifting Summing Point After the Block
Consider the block diagram shown in the following figure. Here, the Now, shift the summing point after the block.
summing point is present before the block.

Now the output of the block G(s) will be G(s)R(s).


Summing point has two inputs R(s) and X(s), giving an output of Out put of the summing point will be
{R(s)+X(s)}.
So the input to the block G(s) is {R(s)+X(s)} and the output will be, Comparing with equation (1)

There is adifference in the second term.

4
06-01-2024

Shifting Summing Point After the Block Shifting Summing Point After the Block
In order to get the second term also same, we require one more
block G(s).
This G(s) block will have X(s) as input giving G(s)X(s) as output
which in turn will be given to summing point.

Shifting Summing Point Before the Block Shifting Summing Point Before the Block
Consider the block diagram shown in the following figure. Now, shift the summing point before the block.

5
06-01-2024

Shifting Summing Point Before the Block Shifting Summing Point Before the Block
Compare Equation 3 and Equation 4,

In order to get the second term also same, we require one more
1
block 𝐺(𝑠) , which will be X(s).
having

Shifting Take-off Point After the Block Shifting Take-off Point After the Block
Consider the block diagram shown in the following figure. In this When you shift the take-off point after the block, the output Y(s)
case, the take-off point is present before the block. remains same.
But the value X(s) changes to G(s)X(s).
In order to get the same value X(s) we require one more block
1
𝐺(𝑠)
which will be having input as Y(s) and output as X(s)

6
06-01-2024

Shifting Take-off Point After the Block Shifting Take-off Point Before the Block
Consider the block diagram shown in the following figure.
Here, the take-off point is present after the block.

Shifting Take-off Point Before the Block Shifting Take-off Point Before the Block
When you shift the take-off point after the block, the output Y(s)
remains same.
But the value X(s) changes to G(s)X(s).
In order to get the same value X(s) we require one more block G(s)
which will be having input as Y(s) and output as X(s)

7
06-01-2024

Block Diagram Reduction Rules Example


Follow these rules for simplifying (reducing) the block diagram, which Consider the block diagram shown in the following figure.
is having many blocks, summing points and take-off points. Let us simplify (reduce) this block diagram using the block diagram
Rule 1 − Check for the blocks connected in series and simplify. reduction rules.
Rule 2 − Check for the blocks connected in parallel and simplify.
Rule 3 − Check for the blocks connected in feedback loop and simplify.
Rule 4 − If there is difficulty with take-off point whilesimplifying, shift it
towards right.
Rule 5 − If there is difficultywith summing point while simplifying,shift it
towards left.
Rule 6 − Repeat the above steps till you get the simplified form, i.e., single
block.
Note: The transferfunctionpresentinthissingleblockis thetransferfunctionofthe overall
blockdiagram.

Example Example

8
06-01-2024

Example Example

Example Example

9
06-01-2024

Example Example

Example Example

10
06-01-2024

Example Example

Try for Yourself Signal Flow Graph


Signal flow graph is a graphical representation of
algebraic equations.
Let us discuss the basic concepts related signal flow graph and
also learn how to draw signal flow graphs.
Nodes and branches are the basic elements of signal flow
graph.

11
06-01-2024

Node Node : Example


Node is a point which represents either a variable or a signal. Let us consider the following signal flow graph to identify these
nodes.
There are three types of nodes — input node, output node and
mixed node. The nodes present in this signal flow graph are y1, y2, y3, y4.
Input Node − It is a node, which has only outgoing branches.
y1 and y2 are the input nodeand output node respectively.
Output Node − It is a node, which has only incomingbranches.
y2 and y3 are mixed nodes
Mixed N ode − It is a node, which has both incoming and outgoing
branches.

Branch Construction of Signal Flow Graph


Branch is a line segment which joins two nodes. It has both Let us construct a signal flow graph by considering the following
gain and direction. algebraic equations,
For example, there are four branches in the above signal flow
graph.
These branches have gains of a, b, c and -d.

There will be six nodes (y1, y2, y3, y4, y5 and y6) and eight
branches
in this signal flow graph.
The gains of the branches are a12, a23, a34, a45, a56, a42, a53 and a35.

12
06-01-2024

Construction of Signal Flow Graph Construction of Signal Flow Graph


To get the overall signal flow graph,draw the signal flow graph for
each equation.
Then combine allthese signal flow graphs.

Construction of Signal Flow Graph Construction of Signal Flow Graph

13
06-01-2024

Construction of Signal Flow Graph Construction of Signal Flow Graph

Conversion of Block Diagrams into


Signal Flow Graphs : Steps Example
1. Represent all the signals, variables, summing points and take-off Let us convert the following block diagram into its equivalent
points of block diagram as nodes in signal flow graph. signal flow graph.
2. Represent the blocks of block diagram as branches in signal flow
graph.
3. Represent the transfer functions inside the blocks of block
diagram as gains of the branches in signal flow graph.
4. Connect the nodes as per the block diagram. If there is connection
between two nodes (but there is no block in between), then
represent the gain of the branch as one.
For example, between summing points, between summing
point and takeoff point, between input and summing point, between
take-off point and output.

14
06-01-2024

Example Example
Represent the input signal R(s) and output signal C(s) of block The following figure shows the equivalent signal flow graph.
diagram as input node R(s) and output node C(s) of signal flow
graph.
Just for reference, the remaining nodes (y1 to y9) are labelled in
the block diagram.
There are nine nodes other than input and output nodes.
Four nodes for four summing points,
Four nodes for four take-off points and
One node for the variable between blocks G1and G2.

Note: Mason’s gain formula


With the help of Mason’s gain formula (discussed in the next Suppose there are ‘N’ forward paths in asignal flow graph.
slide), you can calculate the transfer function of this signal flow The gain between the input and the output nodes of asignal flow
graph. graph is nothing but the transfer function of the system.
This is the advantageof signal flow graphs. It can be calculatedby using Mason’s gain formula.

Here, we no need to simplify (reduce) the signal flow graphs for


calculating the transfer function.
Where,
C(s) is the output node
R(s) is the input node
T is the transfer function or gain between R(s) and C(s)
Pi is the ith forward path gain

15
06-01-2024

Mason’s gain formula Terminologies


Consider the following signal flow graph in order to understand the
basic terminology involved here.

Δ=1−(sum of all individual loop gains)+(sum of gain products of


all possible two non touching loops)−(sum of gainproducts of
all possible three non touching loops)+...

Δi is obtained from Δ by removing the loops which are


touching
the ith forward path.

Terminologies Terminologies
Path Forward Path
It is atraversal of branches fromone node to any other node in the The path that exists from the input node to the output node is
direction of branch arrows. known as forw ard path.
It should not traverseany node more than once.
Examples:
Examples: y2→y3→y4→y5 and y5→y3→y2
y1→y2→y3→y4→y5→y6 and y1→y2→y3→y5→y6.

16
06-01-2024

Terminologies Terminologies
Forward Path Gain Loop
It is obtained by calculating the product of all branch gains of The path that starts from one node and ends at the same node
the forward path. is known as loop. Hence, it is a closedpath.
Examples: Examples: y2→y3→y2 and y3→y5→y3.
abcde is the forward path gain of y1→y2→y3→y4→y5→y6
abge is the forward path gain of y1→y2→y3→y5→y6.

Terminologies Terminologies
Loop Gain Non-touching Loops
It is obtained by calculating the product of all branch gains of a These are the loops, which should not haveany common node.
loop. Examples:
Examples: The loops, y2→y3→y2 and y4→y5→y4 are non-touching.
bj is the loop gain of y2→y3→y2 and
gh is the loop gain of y3→y5→y3.

17
06-01-2024

Calculation of Transfer Function using Mason’s Calculation of Transfer Function using Mason’s
Gain Formula Gain Formula
Let us consider the same signal flow graph for finding transfer
function.

Calculation of Transfer Function using Mason’s Calculation of Transfer Function using Mason’s
Gain Formula Gain Formula

18
06-01-2024

Calculation of Transfer Function using Mason’s Calculation of Transfer Function using Mason’s
Gain Formula Gain Formula

Calculation of Transfer Function using Mason’s


Gain Formula Example:

19
06-01-2024

Example: Example:

Example: Example:

20
06-01-2024

Example: Example:

Example: Example:

21
06-01-2024

Example: Example:

Example: Example:

22
06-01-2024

Example: Example:

Try For Yourself Example:

23
06-01-2024

Example:

24

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy