Download presentation

Presentation is loading. Please wait.

Published byMaia Key Modified over 2 years ago

1
Signal Flow Graph Lecture On Signal Flow Graph Submitted By: Submitted By: Ms. Anupam Mittal A.P., EE Deptt SBSSTC, Ferozepur SBSSTC, Ferozepur

2
Flow of PPT What is Signal Flow Graph (SFG)? Definitions of terms used in SFG Rules for drawing of SFG Masons Gain formula SFG from simultaneous eqns SFG from differential eqns Examples Solution of a problem by Block diagram reduction technique and SFG SFG from a given Transfer function Examples

3
What is Signal Flow Graph? SFG is a diagram which represents a set of simultaneous equations. This method was developed by S.J.Mason. This method does nt require any reduction technique. It consists of nodes and these nodes are connected by a directed line called branches. Every branch has an arrow which represents the flow of signal. For complicated systems, when Block Diagram (BD) reduction method becomes tedious and time consuming then SFG is a good choice.

4
Comparison of BD and SFG block diagram:signal flow graph: In this case at each step block diagram is to be redrawn. Thats why it is tedious method. So wastage of time and space. Only one time SFG is to be drawn and then Masons gain formula is to be evaluated. So time and space is saved.

5
SFG

6
Node: It is a point representing a variable. x 2 = t 12 x 1 +t 32 x 3 X2X2 X1X1 X2X2 X3X3 t 12 t 32 X1X1 Branch : A line joining two nodes. Input Node : Node which has only outgoing branches. X 1 is input node. In this SFG there are 3 nodes. Definition of terms required in SFG

7
Output node/ sink node: Only incoming branches. Mixed nodes: Has both incoming and outgoing branches. Transmittance : It is the gain between two nodes. It is generally written on the branch near the arrow. t 12 X1X1 t 23 X3X3 X4X4 X2X2 t 34 t 43

8
Path : It is the traversal of connected branches in the direction of branch arrows, such that no node is traversed more than once. Forward path : A path which originates from the input node and terminates at the output node and along which no node is traversed more than once. Forward Path gain : It is the product of branch transmittances of a forward path. P 1 = G 1 G 2 G 3 G 4, P 2 = G 5 G 6 G 7 G 8

9
Loop : Path that originates and terminates at the same node and along which no other node is traversed more than once. Self loop: Path that originates and terminates at the same node. Loop gain: it is the product of branch transmittances of a loop. Non-touching loops: Loops that dont have any common node or branch. L 1 = G 2 H 2 L 2 = H 3 L 3 = G 7 H 7 Non-touching loops are L1 & L2, L1 & L3, L2 &L3

10
SFG terms representation input node (source) mixed node forward path path loop branch node transmittance input node (source)

11
Rules for drawing of SFG from Block diagram All variables, summing points and take off points are represented by nodes. If a summing point is placed before a take off point in the direction of signal flow, in such a case the summing point and take off point shall be represented by a single node. If a summing point is placed after a take off point in the direction of signal flow, in such a case the summing point and take off point shall be represented by separate nodes connected by a branch having transmittance unity.

12
A technique to reduce a signal-flow graph to a single transfer function requires the application of one formula. The transfer function, C(s)/R(s), of a system represented by a signal-flow graph is k = number of forward path P k = the kth forward path gain = 1 – (Σ loop gains) + (Σ non-touching loop gains taken two at a time) – (Σ non-touching loop gains taken three at a time)+ so on. k = 1 – (loop-gain which does not touch the forward path) Masons Gain Formula

13
Ex: SFG from BD

14
EX: To find T/F of the given block diagram

15
Identification of Forward Paths P 1 = 1.1.G 1.G 2. G 3. 1 = G 1 G 2 G 3 P 2 = 1.1.G 2. G 3. 1 = G 2 G 3

16
Individual Loops L 1 = G 1 G 2 H 1 L 2 = - G 2 G 3 H 2 L 3 = - G 4 H 2

17
L 4 = - G 1 G 4 L 5 = - G 1 G 2 G 3

18
Construction of SFG from simultaneous equations

19
t 21 t 23 t 31 t 32 t 33

21
After joining all SFG

22
SFG from Differential equations Consider the differential equation Step 2: Consider the left hand terms (highest derivative) as dependant variable and all other terms on right hand side as independent variables. Construct the branches of signal flow graph as shown below:- 1 -5 -2 -3 (a) Step 1: Solve the above eqn for highest order

23
1 -2 -5 -3 1/s Step 3: Connect the nodes of highest order derivatives to the lowest order der.node and so on. The flow of signal will be from higher node to lower node and transmittance will be 1/s as shown in fig (b) (b) Step 4: Reverse the sign of a branch connecting y to y, with condition no change in T/F fn.

24
Step5: Redraw the SFG as shown.

25
Problem: to find out loops from the given SFG

26
Ex: Signal-Flow Graph Models

27
P 1 = P 2 =

28
Individual loops L 1 = G 2 H 2 L 4 = G 7 H 7 L 3 = G 6 H 6 L 2 = G 3 H 3 Pair of Non-touching loops L 1 L 3 L 1 L 4 L 2 L 3 L 2 L 4

30
Ex:

31
Forward Paths

32
L 5 = -G 4 H 4 L 1 = -G 5 G 6 H 1 L 3 = -G 8 H 1 L 2 = -G 2 G 3 G 4 G 5 H 2 L 4 = - G 2 G 7 H 2 Loops

33
L 7 = - G 1 G 2 G 7 G 6 H 3 L 6 = - G 1 G 2 G 3 G 4 G 8 H 3 L 8 = - G 1 G 2 G 3 G 4 G 5 G 6 H 3

34
Pair of Non-touching loops L 4 L 5 L 3 L 7 L 4 L 5 L 7 L 4 L 5 L 3 L 4

35
Non-touching loops for paths 1 = 1 2 = -G 4 H 4 3 = 1

36
Signal-Flow Graph Models

37
Block Diagram Reduction Example _ + _ + + +

38
R

40
R

41
R

42
_ +

44
Solution for same problem by using SFG

45
Forward Path P 1 = G 1 G 2 G 3

46
Loops L 1 = G 1 G 2 H 1 L 2 = - G 2 G 3 H 2

47
L 3 = - G 1 G 2 G 3 P 1 = G 1 G 2 G 3 L 1 = G 1 G 2 H 1 L 2 = - G 2 G 3 H 2 L 3 = - G 1 G 2 G 3 1 = 1 = 1- (L 1 + L 2 +L 3 ) T.F= (G 1 G 2 G 3 )/ [1 -G 1 G 2 H 1 + G 1 G 2 G 3 + G 2 G 3 H 2 ]

48
SFG from given T/F

49
Ex:

56
Example of block diagram Step 1: Shift take off point from position before a block G 4 to position after block G 4

57
Step2 : Solve Yellow block. Step3: Solve pink block. Step4: Solve pink block.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google