Download as pdf or txt
Download as pdf or txt
You are on page 1of 41

Signal

Signal Flow
Flow Graphs
Graphs

4
5
Block Diagram

6
Block Diagram

7
Signal
Signal Flow
Flow Graphs
Graphs

8
Signal
Signal Flow
Flow Graphs
Graphs

9
SIGNAL FLOW DIAGRAMS: MASON’S
GAIN FORMULA

Instead of a Block diagram as shown below:

+
R(s) C(s) G1(s) G2(s) Y(s)
-

We can represent the system as a signal flow graph:

1 C(s) G1(s) G2(s) 1


R(s) Y(s)

-1 10
Signal
Signal Flow
Flow Graphs
Graphs

A signal flow graph and a block diagram


contain exactly the same information ( there
is no advantage to one over the other; there
is only personal preference)

11
Why SFG?
Block Diagrams are adequate for
representation, but cumbersome.
SFG provides the relation between system
variables without requiring any reduction
procedure.

12
Basic Elements of Signal Flow Graph

n A Signal flow graph is a diagram


consisting of nodes that are connected
by several directed branches.

branch branch

node node

13
Basic Elements of Signal Flow Graph
n A node is used to represent a variable
(inputs, outputs, other signals)
n A branch shows the dependence of one
variable ( node) on another variable
(node)
n Each branch has GAIN and DIRECTION
n A signal can transmit through a branch only in
the direction of the arrow
n If gain is not specified gain =1

G
B=GA
A B
14
Nodes
n A node is used to represent a variable
n Source node (input node)
n All braches connected to the node are leaving the node

n Input signal is not affected by other signals

n Sink node (output node)


n All braches connected to the node are entering the node

n output signal is not affecting other signals

D
Source node A B C Sink node
X Y Z V
U

15
Relationship Between Variables
Source node A B C Sink node
X Y Z V
U
Gain is not
shown means
gain=1

U (input)
X=AU+Y
Y=BX
Z=CY+DX
V=Z (output)
16
Another Example
D
Source node
A B Y C Sink node

U X Z V
3 K
H
W

X=AU+Y
Y=BX+KZ
Z=CY+DX+HW
W=3U
V=Z
17
Basic Properties

n Signal flow graphs applies to linear systems only


n Nodes are used to represent variables
n A branch from node X to node Y means that Y depends on
X
n Value of the variable (node) is the sum of gain of branch
* value of node
n Non-input node cannot be converted to an input node
n We can create an output node by connecting unit branch
to any node

18
Terminology: Paths
n A path: is a branch or a continuous sequence of branches that
can be traversed from one node to another node

A B Y C
U Z V
X
3 K
H
W Z

U A X B U
Y C Z 3
H
Paths from U to Z W 19
Terminology: Paths
n A path: is a branch or a continuous sequence of branches that
can be traversed from one node to another node
n Forward path: path from a source to a sink
n Path gain: product of gains of the braches that make the path

A B Y C
U X Z V
3 K
H
W

20
Terminology: loop
n A loop: is a closed path that originates and terminates
on the same node, and along the path no node is met
twice.
n Non-touching loops: two loops are said to be non-
touching if they do not have a common node.

B Y
A B Y C
Z X
U X V
3 K Y C
H
W K
21
An example

22
An example…

This have the solution

23
An example

n Self loops a11 , a22 , a12 a21


n Product of non-touching loops a22 a11

24
SGF : in general
n The linear dependence (Tij) between the independent
variable xi (input) and the dependent variable (output) xj
is given by Mason’s SF gain formula

25
The determinant D

n Or
D= is the determinant of the graph = 1 - (sum of all individual loop
gains) + ( sum of gain products of all possible combinations of
two non-touching loops) - (sum of gain products of all possible
combinations of three non-touching loops) + - . . .
n The cofactor is the determinant with loops touching
the kth path removed

26
Example
Determine the transfer function between V and U

A B Y C
U X Z V
3 K
H
W
n The number of forward paths from U to V = ?
n Path Gains ?

27
Example
Determine the transfer function between V and U

A B Y C
U X Z V
3 K
H
W

n The number of forward paths from U to V = 2


n Path Gains ABC, 3H
n Loop Gains B, CK

28
Block Diagram and its corresponding
Signal Flow Graph

29
An example:

n Two paths :P1, P2


n Four loops
n P1 = G1G2G3G4, P2= G5G6G7G8
n L1=G2H2 L2=G3H3 L3=G6H6 L4=G7H7
n D= 1 - (L1+L2+L3+L4)+(L1L3+L1L4+L2L3+L2L4)
n For path 1 is L1=L2 =0 and For Path 2 L3=L4 =0
n Cofactor for path 1: D1= 1- (L3+L4)
n Cofactor for path 2: D2= 1-(L1+L2)
n T(s) = (P1D1 + P2D2)/D
30
Another example

3 Paths
8 loops 31
Another example:

32
33
34
35
36
37
38
39
Block diagram and its equivalent signal-flow graph


- -

-1

1 1 1

-1 -1

40
Example : Find the transfer function for the following block diagram

b1
+ + ⑥ Y(s)
b2
+
① + ② ③ ④ ⑤
U(s) _ 1/s 1/s 1/s b3
_
_
a1
a2
Solution. a3

1236

12346

123456
41
Example : Find the transfer function for the following block diagram

b1
+ + ⑥ Y(s)
b2
+
① + ② ③ ④ ⑤
U(s) _ 1/s 1/s 1/s b3
_
_
a1
a2
a3
Solution.
Applying Mason’s rule, we find the transfer function to be

42
Example : Find the transfer function for the following SFG

① ② ③ ④ ⑤ 1 ⑥
1

Solution.

43
Example: Find the transfer function for the following SFG

① ② ③ ④ ⑤ 1 ⑥
1

Solution.
Applying Mason’s rule, we find the transfer function to be

44

You might also like