0% found this document useful (0 votes)
14 views13 pages

Module 13

This document discusses signal flow graph analysis, which uses signal flow graphs to represent systems for control analysis. It defines key terms related to signal flow graphs such as nodes, branches, transmittance, and paths. Rules are provided for constructing a signal flow graph from a block diagram. Mason's gain formula is also introduced as a method to determine a system's transfer function from its signal flow graph.

Uploaded by

SAUMYAJIT SABUI
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)
14 views13 pages

Module 13

This document discusses signal flow graph analysis, which uses signal flow graphs to represent systems for control analysis. It defines key terms related to signal flow graphs such as nodes, branches, transmittance, and paths. Rules are provided for constructing a signal flow graph from a block diagram. Mason's gain formula is also introduced as a method to determine a system's transfer function from its signal flow graph.

Uploaded by

SAUMYAJIT SABUI
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/ 13

MODULE-13

SIGNAL CONTROLLING ANALYSIS


13.1) Introduction: Basically this section of the paper deals with the continuation of module-8.
Here we will see the behavioral activity of a signal in the field of system control. This very part or
section mainly focuses the controlling of signal by judging its flow path. So the other name of this
section is called as “Signal Flow Graph Analysis” or (SFG). A signal flow graph is another graphical
representation of system control analysis. SFG mainly consists of a network graph in which nodes
represent system components. The nodes are connected by directed branches. Each of the directed
branches represent block in the system controlling analysis, which we have already studied. So in other
words a signal flow graph is one in which system components are represented by the nodes of the graph,
while relationship between the components are represented by the branches connecting the nodes. For
example, the signal flow representation whose block diagram representation, for the equation y=mx as
shown in the figure below is as:-

FIG-13.1: SFG & BLOCK DIAGRAM OF A SYSTEM

13.2) Construction of SFG from Block Diagram : Let us consider the block diagram
representation of a system is shown below and its equivalent SFG is also represented below as:-

FIG-13.2 (a): BLOCK DIAGRAM OF A SYSTEM

FIG-13.2 (b): SIGNAL FLOW GRAPH OF THE ABOVE SYSTEM

Page 1 of 13
Now from the above figure, input and output signals have to be named as nodes (here, ). Name the
summing points as one of the nodes (here say . Name the takeoff point as another node (here say .
If there is no block between the summing point and takeoff point, name it as single node (here say
The blocks with gain are represented as branches connecting the nodes from as input
through as output. Here represents the gain of a feedback branch connecting . represents
the gain of a special branch known as “Self Loop” connecting the node itself.

13.3) Basic Terminologies Associated with SFG : By considering the SFG shown below, the
different terms used in SFG are explained below as:-

FIG-13.3: SIGNAL FLOW GRAPH OF A SYSTEM

(i) Node: It is a system component which is equal to the sum of all incoming signals at a point. Outgoing
signals from the node do not affect the value of the node component. For example considering the SFG
shown above, here is all defined as “Nodes”. The value of the selected nodes as:-

Similarly, the value of other selected node as:-

In these two above cases the nodes are acting as summing point. The value of another selected node
can be expressed as:-

Thus, the node value is transmitted through the branch from the node . In this case the node acts
as a transmitting point. Here, the signal is times amplified.

(ii) Branches: It is defined as a directed line between nodes.

(iii) Transmittance: It is defined as the gain between nodes or branch gain. Such gains are expressed in
terms of transfer function.

(iv) Input Node / Source Node: It is defined as the node which has only outgoing branches. For example
node in the above figure is defined as a source node.

Page 2 of 13
(v) Output Node / Sink Node: It is defined as a node which has only incoming branches. For example node
in the above figure is defined as a sink node.

(vi) Chain Node / Mixed Node: It is defined as the node which has both incoming and outgoing branches.
For example node in the above figure, have both incoming as well as outgoing signals,
hence they are known as chain / mixed nodes.

(vii) Path: It is defined as the traversal way from one node to another node in the direction of the signal
(branch arrow), such that no same node traversed more than once.

(viii) Forward Path: It is defined as the path from the input node to the output node. For example path
in the above figure, is defined as a forward path.

(ix) Closed Loop: This is defined as a circular path which starts from a particular node and ends in the
same node from where the signal first starts its journey. For example in the above figure,
forms a closed path having two branches and hence it is known as closed loop.

(x) Self Loop: It is also defined as a circular path which starts from a particular node and ends in the same
node from where the signal first starts its journey, but having only one branch. For example in the
above figure have only one branch, so it is known as Self Loop.

(xi) Path Gain: It is defined as the product of all the branch gains in a path. For example, the path gains
for the path as shown in the above figure.

(xii) Loop Gain: It is defined as the product of branch gains in a closed loop. For example, loop gains of
the loop as shown in the above figure.

(xiii) Non-Touching Loop: It is defined as a sub-graph forming loop (especially closed loop) but does not
touch its neighbouring loops and nodes of the forward path.

13.4) Rules for Construction of SFG from Block Diagram : The rules for construction of
SFG from Block Diagram are as follows:

RULE-1: Replace the input signal and output signal by its respective nodes.

RULE-2: Replace all the summing points by its individual nodes.

RULE-3: Replace all the takeoff point if present by its respective nodes.

RULE-4: If the branch connecting a summing point and takeoff point has unity value gain, then the

Summing point and the takeoff point both can be combined and represented as a single

Node. This operation is shown below as:-

Page 3 of 13
FIG-13.4 (a): OPERATION OF RULE-4

RULE-5: If there are more takeoff points from the same signal, then all the takeoff points can be

Combined and replaced by a single node. This operation is shown below as:-

FIG-13.4 (b): OPERATION OF RULE-5

RULE-6: If the gain of the link connecting two summing points as one, then these two summing points

Can be combined and replaced by a single node. This operation is shown below as:-

FIG-13.4 (c): OPERATION OF RULE-6

RULE-7: In the summing point if the gain is represented as negative unity, then subtract a signal instead

Of adding and then multiply the transmittance by -1 while representing in SFG. This operation

Is shown below as:-

Page 4 of 13
FIG-13.4 (d): OPERATION OF RULE-7 (TO SOME EXTENT SAME AS RULE-6)

13.5) Mason’s Gain Formula: Mason’s Gain Formula is used for determining the overall response
function/ transfer function (gain) of a system. It is a convenient and easy way of finding the relation
between the input and the output components from the SFG. The number of steps involved in the Block
Diagram Reduction technique as we have already covered, is high and it is time consuming process. On
the other hand, any complex Block Diagram can be converted into SFG by following the rules of
conversion and its response function can be easily obtained using Mason’s Gain Formula. Mason’s Gain
Formula can be represented as:-

Where, k = Total number of forward path with its path gain present in the SFG.

= Individual path gain of forward path.

= Determinant of the SGF.

= 1- (sum of all individual loop gains) + {(sum of gain products of all possible combinations

Of two non-touching loops at a time - sum of gain products of all possible combinations

Of three non-touching loops at a time + ……………)}

= part of the graph which is not touching to the forward path. Generally all the

Time its value is unity, but exceptionality also there.

Page 5 of 13
Example-1: Construct an equivalent SFG for the Block Diagram shown below and also evaluate the
overall response function for the system using Mason’s Gain Technique.

Solution:

The SFG for the above Block Diagram is shown below can be obtained by using the rules given in the
section (13.4). So the resultant SFG is as follows:-

From the above SFG we will now compute the overall response function by using Mason’s Gain
formula and for that we have to calculate the following:-

1} Forward Path: There are 2 forward Path as shown below as:

Page 6 of 13
(i) Forward path number 1 with path gain as;

(ii) Forward path number 2 with path gain as;

2} Closed Loops: There are 5 closed loops as shown below as:

(i) Closed Loop number 1 with loop gain as; (

(ii) Closed Loop number 2 with loop gain as; (

(iii) Closed Loop number 3 with loop gain as; (

Page 7 of 13
(iv) Closed Loop number 4 with loop gain as; (

(v) Closed Loop number 5 with loop gain as; (

3} Two Non-touching Loops: There are 0 number of two non-touching loop present at a time.

So the mason’s gain formula is:-

( ∑

1- (Sum of all individual loop gains) + {(sum of gain products of all possible combinations

Of two non-touching loops at a time - sum of gain products of all possible combinations

Of three non-touching loops at a time + ……………)}

= 1- { ( ( ( ( +( }

= 1+

Thus:-
(
( ( ( {As the value of .
(

Page 8 of 13
Example-2: Compute the overall transfer function for the given system shown below by using SFG
technique.

Solution:

The SFG for the above Block Diagram is shown below can be obtained by using the rules given in the
section (13.4). So the resultant SFG is as follows:-

From the above SFG we will now compute the overall response function by using Mason’s Gain
formula and for that we have to calculate the following:-

1} Forward Path: There are 2 forward Path as shown below as:

(i) Forward path number 1 with path gain as;

Page 9 of 13
(ii) Forward path number 2 with path gain as;

2} Closed Loops: There are 6 closed loops as shown below as:

(i) Closed Loop number 1 with loop gain as; (

(ii) Closed Loop number 2 with loop gain as; (

(iii) Closed Loop number 3 with loop gain as; (

Page 10 of 13
(iv) Closed Loop number 4 with loop gain as; (

(v) Closed Loop number 5 with loop gain as; (

(vi) Closed Loop number 6 with loop gain as; (

3} Two Non-touching Loops: There is 1 number of two non-touching loop present at a time.

(i) Two non-touching loop number 1 with loop gain as; (

Page 11 of 13
So the mason’s gain formula is:-

( ∑

1- (Sum of all individual loop gains) + {(sum of gain products of all possible combinations

Of two non-touching loops at a time - sum of gain products of all possible combinations

Of three non-touching loops at a time + ……………)}

= 1- { ( ( ( ( +( ( ( }

= 1+ ( ( ( ( -( ( (

Thus:-

( ( ( {As the value of .

(
=
( ( ( ( ( ( (

HOME WORK

Exercise-1: Compute the overall transfer function for the given system shown below by using SFG
technique.

Page 12 of 13
Exercise-2: Compute the overall transfer function for the given system shown below by using SFG
technique.

Exercise-3: Construct an equivalent SFG for the Block Diagram shown below and also evaluate the
overall response function for the system using Mason’s Gain Technique

*************************************

Page 13 of 13

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