Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lec 4 . Graphical System Representations

Similar presentations


Presentation on theme: "Lec 4 . Graphical System Representations"— Presentation transcript:

1 Lec 4 . Graphical System Representations
Block Diagrams Signal Flow Graphs and Mason’s Formula TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA

2 Block Diagrams Graphical representation of interconnected systems
A system often consist of multiple subsystems Each subsystem represented by a functional block Blocks are connected by arrows indicating signal flows Advantage Easy for visualization Can represent a class of similar systems

3 Basic Components of Block Diagrams
Signal flow (Functional) block Summing point + Branch point

4 Cascaded/Parallel Connected Systems
Cascaded (serial connected) systems: Parallel connected systems: +

5 (Negative) Feedback Connected Systems
+ Feedforward transfer function (FTF): Open-loop transfer function (OTF): Closed-loop transfer function (CTF):

6 Positive Feedback Connected Systems
+ Closed-loop transfer function: Remark: can be thought of as negative feedback connected system with feedback element –H(s)

7 Unity Feedback System Unit feedback connected systems: H(s)=1
+ Closed-loop transfer function:

8 Feedback Control System
controller plant + Closed-loop transfer function: Remark: by adjusting the controller C(s), one can change the close-loop transfer function to achieve desired properties.

9 Block Diagram Reduction
Often times the block diagram under study is complicated Use previous basic steps to reduce the complexity of block diagram Example: + +

10 Another Example + +

11 Operations for Simplifying Block Diagrams
“Slide a branch point past a functional block (forward)”

12 Application to Previous Example
+ +

13 Another Operation for Simplifying Block Diagrams
“Slide a summation point past a functional block (backward)” + +

14 Application to Previous Example
+ +

15 Signal Flow Graphs An alternative graphical representation of interconnections of subsystems Advantage compared with block diagrams A systematic way to compute the transfer function from any input to any output

16 A Simple Example Block diagram: Signal flow graph:
+ Basic component of a signal flow graph: Node: represents a signal Each node is labeled with the corresponding signal Branch: directed line segment connecting two nodes Signal can only flow along the specified direction Each branch is associated with a transmittance or gain

17 Type of Nodes Input nodes: nodes with only outgoing branches
Block diagram: Signal flow graph: + Input nodes: nodes with only outgoing branches Output nodes: nodes with only incoming branches can be made from an arbitrary node by adding an outgoing branch of unit gain Mixed nodes: both incoming and outgoing branches

18 What Happen at Mixed Nodes?
At a mixed node, signals of all incoming branches are added and the result is transmitted to all outgoing branches At node Z: At node U: At node W: At node W:

19 More Complicated Example
Block diagram: + + Signal flow graph:

20 Simplifying Signal Flow Graphs
Cascaded systems: Parallel connected systems: Feedback connected systems:

21 However, In General Transfer function from U to Y?

22 Mason’s Formula: Direct Approach
Path: a sequence of connected branches (following arrow directions) Forward path: start from an input node and end at an output node Forward path gain: product of all branch gains along a forward path Loop: a closed path (starts and ends at the same node) Loop gain: product of all branch gains along a loop Notouching loops: loops that do not have shared nodes

23 Determinant of Graph =1- (sum of all individual loop gains)
+ (sum of gain products of all two nontouching loops) - (sum of gain products of all three nontouching loops) + … Determinant of a graph without any loop is 1 Example:

24 Mason’s Formula Transfer function from an input node to an output node
Compute the determinant  of the signal flow graph Find all forward paths with path gains P1,…,Pk For each forward path Pi, find its cofactor i , i.e., the determinant of the sub-graph with all the loops touching Pi removed Transfer function from input node to the output node is given by

25 Application to Previous Example
Forward path Forward path gain Pi i

26 Another Example

27 Systems with Multiple Inputs and Outputs
MIMO system m inputs u1,…,um n outputs y1,…,yn Laplace transform of the k-th output is where is the transfer function from ui to yk Transfer matrix:

28 Example I One input: F Two outputs: x and y
Transfer matrix H(s)=[H1(s), H2(s)]

29 Example II Two inputs: u1, u2 Two outputs: y1, y2
Transfer matrix H(s)? + +


Download ppt "Lec 4 . Graphical System Representations"

Similar presentations


Ads by Google