SFG and Mason s Rule : A revision

Similar documents
Control Systems (CS)

J א א J א א א F א א א א

CHAPTER 5 : REDUCTION OF MULTIPLE SUBSYSTEMS

Control Systems, Lecture 05

SECTION 2: BLOCK DIAGRAMS & SIGNAL FLOW GRAPHS

Chapter 3: Block Diagrams and Signal Flow Graphs

CHAPTER 1 Basic Concepts of Control System. CHAPTER 6 Hydraulic Control System

MATHEMATICAL MODELING OF DYNAMIC SYSTEMS

Chap. 3 Laplace Transforms and Applications

Signal Flow Graphs. Roger Woods Programmable Systems Lab ECIT, Queen s University Belfast

CONTROL SYSTEMS LECTURE NOTES B.TECH (II YEAR II SEM) ( ) Prepared by: Mrs.P.ANITHA, Associate Professor Mr.V.KIRAN KUMAR, Assistant Professor

Lecture 13. Vector Network Analyzers and Signal Flow Graphs

directed weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time

Integer Programming. Wolfram Wiesemann. December 6, 2007

Karadeniz Technical University Department of Electrical and Electronics Engineering Trabzon, Turkey

Using Mason's Rule to Analyze DSP Networks

ECE382/ME482 Spring 2005 Homework 1 Solution February 10,

Max Flow: Algorithms and Applications

MATHEMATICAL MODELING OF CONTROL SYSTEMS


High-Order Inductorless Elliptic Filter with Reduced Number of Capacitors Using Signal- Flow Graphs

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

MODELING OF CONTROL SYSTEMS

Outline. Week 5: Circuits. Course Notes: 3.5. Goals: Use linear algebra to determine voltage drops and branch currents.

7.4 STEP BY STEP PROCEDURE TO DRAW THE ROOT LOCUS DIAGRAM

Scattering Parameters

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Circuits & Electronics Problem Set #1 Solution

y k = (a)synaptic f(x j ) link linear i/p o/p relation (b) Activation link linear i/p o/p relation

Study Material. CONTROL SYSTEM ENGINEERING (As per SCTE&VT,Odisha new syllabus) 4th Semester Electronics & Telecom Engineering

EE40 KVL KCL. Prof. Nathan Cheung 09/01/2009. Reading: Hambley Chapter 1

Lecture 13 Date:

Example of Convolutional Codec

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

Control Systems. University Questions

Chapter10 Convolutional Codes. Dr. Chih-Peng Li ( 李 )

SECTION 4: STEADY STATE ERROR


b. Write an equation that represents the revenue (income). c. A set of two (or more) linear equations is called a system of linear

Maximum flow problem CE 377K. February 26, 2015

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad ELECTRICAL AND ELECTRONICS ENGINEERING TUTORIAL QUESTION BANK

Decision Diagrams and Dynamic Programming

EDEXCEL NATIONALS UNIT 5 - ELECTRICAL AND ELECTRONIC PRINCIPLES. ASSIGNMENT No. 3 - ELECTRO MAGNETIC INDUCTION

Solutions to Problems in Chapter 5

2. In words, what is electrical current? 3. Try measuring the current at various points of the circuit using an ammeter.

Engineering Fundamentals and Problem Solving, 6e

Name: pd. 7B Work and Energy

UNIT 4 DC EQUIVALENT CIRCUIT AND NETWORK THEOREMS

Path Testing and Test Coverage. Chapter 9

Table of Laplacetransform

Path Testing and Test Coverage. Chapter 9

(b). Identify all basic blocks in your three address code. B1: 1; B2: 2; B3: 3,4,5,6; B4: 7,8,9; B5: 10; B6: 11; B7: 12,13,14; B8: 15;

Power Management Circuits and Systems. Basic Concepts: Amplifiers and Feedback. Jose Silva-Martinez

Introduction to Binary Convolutional Codes [1]

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

Chapter 2. Polynomial and Rational Functions. 2.3 Polynomial Functions and Their Graphs. Copyright 2014, 2010, 2007 Pearson Education, Inc.

Optimal Control Theory SF 2852

Direct-Current Circuits. Physics 231 Lecture 6-1

Solution to Homework Assignment 1

Homework 1 solutions

ECE2262 Electric Circuits

1 S = G R R = G. Enzo Paterno

On the Average Path Length of Complete m-ary Trees

Physics 7B-1 (A/B) Professor Cebra. Winter 2010 Lecture 2. Simple Circuits. Slide 1 of 20

1 Locally computable randomized encodings

Extensive games (with perfect information)

The equivalent model of a certain op amp is shown in the figure given below, where R 1 = 2.8 MΩ, R 2 = 39 Ω, and A =

Control Systems. CONTROL SYSTEMS (Common to EC/TC/EE/IT/BM/ML) Sub Code: 10ES43 IA Marks : 25 Hrs/ Week: 04 Exam Hours : 03 Total Hrs: 52 Marks : 100

DC Circuit Analysis + 1 R 3 = 1 R R 2

Intermediate Algebra. 7.6 Quadratic Inequalities. Name. Problem Set 7.6 Solutions to Every Odd-Numbered Problem. Date

BEE501- CONTROL SYSTEM UNIT 1 SYSTEMS AND THEIR REPRESENTATION Definition of Control System A control system is a system of devices or set of

ECE2262 Electric Circuits. Chapter 5: Circuit Theorems

Written Exam 15 December Course name: Introduction to Systems Biology Course no

Course roadmap. ME451: Control Systems. What is Root Locus? (Review) Characteristic equation & root locus. Lecture 18 Root locus: Sketch of proofs

U1 is zero based because its noninverting terminal is connected to circuit common. Therefore, the circuit reference voltage is 0 V.

Traffic Management and Control (ENGC 6340) Dr. Essam almasri. 8. Macroscopic

Adjoint networks and other elements of circuit theory. E416 4.Adjoint networks

EC Control Systems- Question bank

Notes on Electricity (Circuits)

Mathematics for Decision Making: An Introduction. Lecture 13

CHAPTER # 9 ROOT LOCUS ANALYSES

Systematic methods for labeling circuits and finding a solvable set of equations, Operational Amplifiers. Kevin D. Donohue, University of Kentucky 1

30 Classification of States

Chapter 2. Engr228 Circuit Analysis. Dr Curtis Nelson

E1.1 Analysis of Circuits ( ) Revision Lecture 1 1 / 13

ECE 1311: Electric Circuits. Chapter 2: Basic laws

Graph Transformations T1 and T2

Lecture 1 Root Locus

Chapter 26 Direct-Current Circuits

CMSC 451: Max-Flow Extensions

Math 5490 Network Flows

Vulnerability Analysis of Feedback Systems

Two Applications of Maximum Flow

INTRODUCTION TO ELECTRONICS

Lecture 4: Feed Forward Neural Networks

Scientific Journal Impact Factor: (ISRA), Impact Factor: 2.114

Two Proofs of Commute Time being Proportional to Effective Resistance

QUIZ 1 SOLUTION. One way of labeling voltages and currents is shown below.

Series & Parallel Resistors 3/17/2015 1

CHAPTER 4. Circuit Theorems

Chapter 3 : Transfer Functions Block Diagrams Signal Flow Graphs

Transcription:

SFG and Mason s Rule : A revision Andersen Ang 2016-Nov-29 SFG and Mason s Rule Vu Pham

Review SFG: Signal-Flow Graph SFG is a directed graph SFG is used to model signal flow in a system SFG can be used to derive the transfer function of the system by Mason s Rule / Mason s Gain Formula. 2

SFG terminologies Node Edge Gain Input / Sources Output / Sinks Path Path gain Forward path Forward path gain Loop Self loop Loop Gain Non-touching loop 3

SFG terminologies Node: variables. e. g. X %, X ', X (, X ) Edge: directed branches. e. g. X % X ' Gain: transmission of that branch. e. g. A '% Input/Sources: nodes with out-going branches only e. g. X % Output/Sinks: nodes with incoming branches only e. g. X ) 4

SFG terminologies Path: successive branches without repeated nodes, e. g. X % X ' X ) Path gain: the gain of the path Forward path: path from input to output, e. g. X % X ' X ( X ) or X % X ' X ) Forward path gain: gain of forward path 5

SFG terminologies Loop / Feedback path: a closed path which originates and terminates on the same node, e. g. X ' X ( X ' Self loop: loop with only one branch, e.g. X ( X ( Loop gain: gain along the loop Non-touching loop: two loops are non-touching if they do not share any nodes nor branches 6

Some SFG simplifications Branch in parallel: Branch in series: Isolated loop: 7

SFG Example 1 Two forward path: G 1 G 2 G 3 G 4 G 5 G 7 & G 1 G 2 G 3 G 4 G 6 G 7 Four loops: G 2 H 1, G 4 H 2, G 4 G 5 H 3, G 4 G 6 H 3 Non-touching loops: G 2 H 1 & G 4 H 2, G 2 H 1 & G 4 G 5 H 3, G 2 H 1 & G 4 G 6 H 3 8

SFG Example 2 Three forward path: A 32 A 43 A 54 A 65 A 76 A 72 A 42 A 54 A 65 A 74 9

SFG Example 2 Loops A 32 A 33, A 43 A 34, A 54 A 45, A 65 A 56, A 76 A 67, A 77 A 42 A 34 A 23, A 65 A 76 A 57 * A 65 A 76 A 67 A 56 is not a loop since X 6 is repeated on the path! A 72 A 57 A 45 A 34 A 23 A 72 A 67 A 56 A 45 A 34 A 23 10

Mason s Rule How to derive transfer function: block diagram (BD) reduction or signal flow graph reduction. BD approach requires successive application of fundamental relationships in order to derive transfer function. SFG just applies one formula Mason s Rule 11

Mason s Rule Equation TF(s) = 1 Δ #789:;9< >;?@ 3 P 5 Δ 5 5A% P i = the i th forward-path gain. = Determinant of the system i = Determinant of the i th forward path = 1 - (sum of all individual loop gains) + (sum of products of gains of all 2 loops that do not touch each other) (sum of products of gains of all possible three loops that do not touch each other) + i = Δ for part of SFG that does not touch i-th forward path Δ i = 1 if no non-touching loops to the i-th path, or if taking out i-th path breaks all the loops 12

Example 1 X 2 X 3 X 4 X 5 X 6 Input: Output: X 6 Two Forward paths: paths along X 2 X 3 X 4 X 5 X 6 Two Forward path gains: P % = G % G ' G ) and P ' = G % G ( G ) Loops: X 2 X 3 X 2 and two loops along X 2 X 3 X 4 X 5 X 2 Loops gains: L % = G % G ) H %, L ' = G % G ' G ) H ' and L ( = G % G ( G ) H ' 13

Example 1 X 2 X 3 X 4 X 5 X 6 Δ = 1 - (sum of all individual loop gains) + (sum of products of gains of all 2 loops that do not touch each other) (sum of products of gains of all possible three loops that donot touch each other) Since no non-touching loop, thus Δ = 1 - (sum of all individual loop gains) Δ = 1 (L % + L ' + L ( ) 14

Example 1 X 2 X 3 X 4 X 5 X 6 i = Δ for part of SFG that does not touch i-th forward path (Δ i = 1 if no non-touching loops to the i-th path) Since no non-touching loop, thus Δ 1 = Δ 2 = 1 15

Example 1 X 2 X 3 X 4 X 5 X 6 #789:;9< >;?@ TF = 1 Δ 3 P 5 Δ 5 5A% = 1 Δ P %Δ % + P ' Δ % 1 = 1 (L % + L ' + L ( ) P % + P ' G % G ' G ) + G % G ( G ) = 1 G % G ) H % + G % G ' G ) H ' +G % G ( G ) H ' 16

Example 2 Input, Output X 8 Two Forward paths: X 5 X 6 X 7 X 2 X 3 X 4 X 8 and X 5 X 6 X 7 X 8 X 8 Two Forward paths gain: X 2 X 3 X 4 P % = G % G I G J G K P ' = G % G ' G ( G ) 17

Example 2 Loops: X 2 X 3 X 2, X 3 X 4 X 3, X 5 X 6 X 5, X 6 X 7 X 6 X 5 X 6 X 7 Individual Loop gains: X 8 L %% = G I H I L %' = G J H J, X 2 X 3 X 4 L %( = G ' H ' L %) = G ( H ( Two non-touching loops: L '% = L %% L %( L '' = L %% L %) L '( = L %' L %( L ') = L %' L %) Three non-touching loops: no Δ = 1 L %% + L %' + L %( + L %) + (L '% + L '' + L '( + L ') ) 18

Example 2 i = Δ for part of SFG that does not touch i-th forward path (Δ i = 1 if no nontouching loops to the i-th path.) X 5 X 6 X 7 X 2 X 3 X 4 X 8 Δ ' = Δ for part of SFG that does not touch 2nd forward path Δ % = Δ for part of SFG that does not touch 1 st forward path 19

Example 2 SFGs without the i-th forward path: X 8 X 8 For these SFGs, compute their Δ as: Δ = 1 - (sum of all individual loop gains) + (sum of products of gains of all 2 loops that do not touch each other) (sum of products of gains of all possible three loops that do not touch each other) 20

Example 2 Both SFGs do not havetwo/morenon-touching loops X 8 X 5 X 7 X 2 X 4 X 8 Δ ' = 1 L %% + L %' Δ% = 1 (L %( + L %) ) = 1 G I H I G J H J = 1 G ' H ' G ( H ( 21

Example 2 #789:;9< >;?@ X 5 X 6 X 7 TF = 1 Δ 3 P 5 Δ 5 X 8 5A% X 2 X 3 X 4 = P % Δ % + P ' Δ' 1 L %% + L %' + L %( + L %) + (L '% + L '' + L '( + L ') ) = G % G I G J G K 1 G ' H ' G ( H ( + G % G ' G ( G ) (1 G I H I G J H J ) 1 G ' H ' + G ( H ( + G I H I + G J H J + (G ' H ' G I H I + G ' H ' G J H J + G ( H ( G I H I + G ( H ( G J H J ) END 22