signal flow graph
TRANSCRIPT
![Page 1: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/1.jpg)
GANDHINAGAR INSTITUTE OF TECHNOLOGY
CONTROL ENGINEERING (2151908)Active learning assignment
On SIGNAL FLOW GRAPH
Prepared by:-
1). Sonani Manav 140120119223
2). Suthar Chandresh 140120119229
3). Tade Govind 140120119230
Guided by :-Asst. Prof. Kashyap Ramaiya
![Page 2: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/2.jpg)
2
Outline
• Introduction to Signal Flow Graphs Definitions Terminologies
• Signal-Flow Graph Models• BD to SFG
Example• Mason’s Gain Formula
Example
6/09/2016
![Page 3: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/3.jpg)
Introduction
3
• Definition:-
“ A signal flow graph is a graphical representation of the relationship between variables of a set of linear algebraic equation.”
• A signal-flow graph consists of a network in which nodes are connected by directed branches.
• It depicts the flow of signals from one point of a system to another and gives the relationships among the signals.
6/09/2016
![Page 4: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/4.jpg)
4
Fundamentals of Signal Flow Graphs
• Consider a simple equation below and draw its signal flow graph:
• The signal flow graph of the equation is shown below;
• Every variable in a signal flow graph is designed by a Node.• Every transmission function in a signal flow graph is designed by a
Branch. • Branches are always unidirectional.• The arrow in the branch denotes the direction of the signal flow.
axy
x ya
6/09/2016
![Page 5: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/5.jpg)
5
Terminologies
• An input node or source contain only the outgoing branches. i.e., X1
• An output node or sink contain only the incoming branches. i.e., X4
• A path is a continuous, unidirectional succession of branches along which no
node is passed more than ones. i.e.,
• A forward path is a path from the input node to the output node. i.e.,
X1 to X2 to X3 to X4 , and X1 to X2 to X4 , are forward paths.
• A feedback path or feedback loop is a path which originates and terminates on
the same node. i.e.; X2 to X3 and back to X2 is a feedback path.
X1 to X2 to X3 to X4 X2 to X3 to X4 X1 to X2 to X4
6/09/2016
![Page 6: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/6.jpg)
6
Terminologies
• A self-loop is a feedback loop consisting of a single branch. i.e.; A33 is a self
loop.
• The gain of a branch is the transmission function of that branch.
• The path gain is the product of branch gains encountered in traversing a path.
i.e. the gain of forwards path X1 to X2 to X3 to X4 is A21A32A43
• The loop gain is the product of the branch gains of the loop. i.e., the loop gain
of the feedback loop from X2 to X3 and back to X2 is A32A23.
• Two loops, paths, or loop and a path are said to be non-touching if they have no nodes in common.
6/09/2016
![Page 7: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/7.jpg)
7
SFG terms representation
input node (source)
b1x a
2x c
4x
d1
3x3x
mixed node mixed node
forward path
path
loop
branch
node
transmittance input node (source)
6/09/2016
![Page 8: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/8.jpg)
Signal-Flow Graph Models
34
203
312
2101
hxxgxfxxexdxx
cxbxaxx
b
x4x3x2x1x0 h
f
g
e
d
c
a
xo is input and x4 is output
![Page 9: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/9.jpg)
Construct the signal flow graph for the following set of simultaneous equations.
• There are four variables in the equations (i.e., x1,x2,x3,and x4) therefore four nodes are required to construct the signal flow graph.
• Arrange these four nodes from left to right and connect them with the associated branches.
• Another way to arrange this graph is shown in the figure.
![Page 10: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/10.jpg)
10
BD to SFG
6/09/2016
Block Diagram Signal Flow Graph
![Page 11: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/11.jpg)
11
BD to SFG
6/09/2016
Block DiagramBlock Diagram
Signal Flow Graph
![Page 12: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/12.jpg)
12
Example:-
6/09/2016
![Page 13: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/13.jpg)
13
Mason’s Rule (Mason, 1953)
• The block diagram reduction technique requires successive
application of fundamental relationships in order to arrive at the
system transfer function.
• On the other hand, Mason’s rule for reducing a signal-flow graph
to a single transfer function requires the application of one
formula.
• The formula was derived by S. J. Mason when he related the
signal-flow graph to the simultaneous equations that can be
written from the graph.6/09/2016
![Page 14: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/14.jpg)
14
Mason’s Rule:• The transfer function T, of a system represented by a signal-flow graph is;
Where,
n = number of forward paths.Pi = the i th forward-path gain.∆ = Determinant of the system∆i = Determinant of the ith forward path
• ∆ is called the signal flow graph determinant or characteristic function. Since ∆=0 is the system characteristic equation.
n
iiiP
sRsCT 1
)()(
6/09/2016
![Page 15: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/15.jpg)
15
Mason’s Rule:
∆ = 1- (sum of all individual loop transmittance) + (sum of the products of loop transmittance of all possible pairs of Non Touching loops) – (sum of the products of loop transmittance of Triple of Non Touching loop) + …
∆i = Calculate ∆ for i th path =1- All the loops that do not touch the i th forward path
n
iiiP
sRsCT 1
)()(
6/09/2016
![Page 16: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/16.jpg)
Systematic approach
1. Calculate forward path gain Pi for each forward path i.2. Calculate all loop transfer functions.3. Consider non-touching loops 2 at a time.4. Consider non-touching loops 3 at a time.5. etc6. Calculate Δ from steps 2,3,4 and 57. Calculate Δi as portion of Δ not touching forward path i
166/09/2016
![Page 17: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/17.jpg)
176/09/2016
Example 1:Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph
![Page 18: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/18.jpg)
18
Continued…..• In this system there is only one forward path between the input R(s) and the output
C(s). The forward path gain is
• we see that there are three individual loops. The gains of these loops are
• Note that since all three loops have a common branch, there are no non-touching loops. Hence, the determinant is given by
• There is no any non touching loop so we get,
• Therefore, the overall gain between the input and the output or the closed loop transfer function, is given by
6/09/2016
𝑃1=𝐺1𝐺2𝐺3
![Page 19: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/19.jpg)
19
2211
)()( PPsRsCTTherefore,
24313242121411 HGGGLHGGGLHGGL ,,
There are three feedback loops
Example 2 :Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph
6/09/2016
![Page 20: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/20.jpg)
20
∆ = 1- (sum of all individual loop gains)
There are no non-touching loops, therefore
3211 LLL
243124211411 HGGGHGGGHGG
Example2:Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph
6/09/2016
![Page 21: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/21.jpg)
21
∆1 = 1- (sum of all individual loop gains)+...
Eliminate forward path-1
∆1 = 1
∆2 = 1- (sum of all individual loop gains)+...
Eliminate forward path-2
∆2 = 1
Example2 :Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph
6/09/2016
![Page 22: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/22.jpg)
22
Example 2: Continue
6/09/2016
![Page 23: Signal flow graph](https://reader033.vdocument.in/reader033/viewer/2022042707/58cf5e1a1a28ab01358b4ea9/html5/thumbnails/23.jpg)
23
THANK YOU
6/09/2016