Software Engineering/Mechatronics 3DX4. Slides 3: Reduction of Multiple Subsystems

Similar documents
Unit 4: Block Diagram Reduction

Module 04 Block Diagrams and Graphical Representations of Intertwined Dynamic Systems

Automation Systems. Lecture 4 - Block Diagram Models. Jakub Mozaryn. Institute of Automatic Control and Robotics, Department of Mechatronics, WUT

Shortcut Method for Implementation of BDRT

Software Engineering 2DA4. Slides 2: Introduction to Logic Circuits

Digital Signal Processing. Soma Biswas

Let denote the number of partitions of with at most parts each less than or equal to. By comparing the definitions of and it is clear that ( ) ( )

NPTEL >> Mechanical Engineering >> Modeling and Control of Dynamic electro-mechanical System Module 1- Lecture 3. Dr. Bishakh Bhattacharya

Warm Up Problem. Write any equivalent MIPS program corresponding to the following code: int wain ( int a, int b){ int c = a + b; return c*a; }

DLD VIDYA SAGAR P. potharajuvidyasagar.wordpress.com. Vignana Bharathi Institute of Technology UNIT 3 DLD P VIDYA SAGAR

EC-333 Microprocessor and Interfacing Techniques

4 KARNAUGH MAP MINIMIZATION

Circuit simplification examples


Computer Sc. & IT. Digital Logic. Computer Sciencee & Information Technology. 20 Rank under AIR 100. Postal Correspondence

E-BOOK // CONVERT TO RECTANGULAR COORDINATES DOCUMENT

CS122 Lecture 4 Winter Term,


Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #23 Loops: Precedence of Operators

First-Order Translation Checklist

2.4. A LIBRARY OF PARENT FUNCTIONS

A Method for the Construction of Minimum-Redundancy Codes*

Group B Assignment 8. Title of Assignment: Problem Definition: Code optimization using DAG Perquisite: Lex, Yacc, Compiler Construction

Advanced Algorithms and Data Structures

High Performance Computing Course Notes Course Administration

CS1114 Assignment 5, Part 1

EECS 140 Laboratory Exercise 5 Prime Number Recognition

How to Give a Bad Talk

Introduction to Simulink

Linear Arrays. Chapter 7

2 SIMULATING A MODEL Simulink Tutorial

DIGITAL ARITHMETIC: OPERATIONS AND CIRCUITS

CS 101 Computer Programming and utilization. Dr Deepak B Phatak Subrao Nilekani Chair Professor Department of CSE, Kanwal Rekhi Building IIT Bombay

Create an external reference (link) to a cell range in another workbook

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

2. ADDRESSING METHODS

POWR IP PZ1/17

CS5371 Theory of Computation. Lecture 8: Automata Theory VI (PDA, PDA = CFG)

Correctness of specifications. Correctness. Correctness of specifications (2) Example of a Correctness Proof. Testing versus Correctness Proofs

6.001 Notes: Section 4.1

Linear Equations in Linear Algebra

CS254 Network Technologies. Lecture 2: Network Models & Error Detection and Correction. Dr Nikos Antonopoulos

Set 5, Total points: 100 Issued: week of

INTERNETWORKING: CONCEPTS, ARCHITECTURE AND PROTOCOL

60-265: Winter ANSWERS Exercise 4 Combinational Circuit Design

Digital Circuits ECS 371

Divide and Conquer Algorithms

COMS W4115 Programming Languages and Translators Lecture 21: Code Optimization April 15, 2013

E40M. Solving Circuits using Nodal Analysis, Part II and EveryCircuit TM. M. Horowitz, J. Plummer, R. Howe 1

3.4 Deduction and Evaluation: Tools Conditional-Equational Logic

Xuan Guo. Lecture XIX: Subroutines (2) CSC 3210 Computer Organization and Programming Georgia State University. March 31, 2015.

Low Level Programming Lecture 2. International Faculty of Engineerig, Technical University of Łódź

Embedded Systems Entry Test

CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey

Parallel Programming Patterns Overview CS 472 Concurrent & Parallel Programming University of Evansville

Chapter 2. Network Classifications (Cont.)

Session 4.2. Network Planning Strategy for evolving Network Architectures Session Subscriber zones / subscriber grid model = >

UNIT-III REGISTER TRANSFER LANGUAGE AND DESIGN OF CONTROL UNIT

CS321. Introduction to Numerical Methods

Redundancy in Substation LANs with the Rapid Spanning Tree Protocol (IEEE 802.1w)

Lecture 5. Partial Redundancy Elimination

CSC Design and Analysis of Algorithms

Action Table for CSX-Lite. LALR Parser Driver. Example of LALR(1) Parsing. GoTo Table for CSX-Lite

6. NEURAL NETWORK BASED PATH PLANNING ALGORITHM 6.1 INTRODUCTION

09 STACK APPLICATION DATA STRUCTURES AND ALGORITHMS REVERSE POLISH NOTATION

Lecture 5 - Axiomatic semantics

Lecture 3: Conditional Independence - Undirected

Fundamentals of Programming CS-110. Lecture 3

8.2. ARITHMETIC SEQUENCES AND PARTIAL SUMS

Arguing for program correctness and writing correct programs

Global Optimization. Lecture Outline. Global flow analysis. Global constant propagation. Liveness analysis. Local Optimization. Global Optimization

To Do. Outline. Translation. Homogeneous Coordinates. Foundations of Computer Graphics. Representation of Points (4-Vectors) Start doing HW 1

Advanced Algorithms and Data Structures

American International University- Bangladesh Faculty of Engineering (EEE) Control Systems Laboratory

Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore

CS 204 Lecture Notes on Elementary Network Analysis

Bottom-Up Parsing. Lecture 11-12

CS137: Electronic Design Automation

CS Data Structures and Algorithm Analysis

19 Much that I bound, I could not free; Much that I freed returned to me. Lee Wilson Dodd

Spatial Analysis (Vector) II

CSC Design and Analysis of Algorithms. Lecture 7. Transform and Conquer I Algorithm Design Technique. Transform and Conquer

Postfix Notation is a notation in which the operator follows its operands in the expression (e.g ).

1010 2?= ?= CS 64 Lecture 2 Data Representation. Decimal Numbers: Base 10. Reading: FLD Digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9

Special Section: Building Your Own Compiler

EC 333 Microprocessor and Interfacing Techniques (3+1)

Binomial Coefficient Identities and Encoding/Decoding

7. The Gauss-Bonnet theorem

Encoding Scheme for Power Reduction in Network on Chip Links

CS 252: Fundamentals of Relational Databases: SQL5

Today s class. Roots of equation Finish up incremental search Open methods. Numerical Methods, Fall 2011 Lecture 5. Prof. Jinbo Bi CSE, UConn

Discovery Tool For Generation 3 Sas Controllers

ECE260B CSE241A Winter Logic Synthesis

Pipelined Computations

Chapter 4. MARIE: An Introduction to a Simple Computer. Chapter 4 Objectives. 4.1 Introduction. 4.2 CPU Basics

Nesting. Abstraction & Nesting. Example. if x is less than y output x is smaller else output y is smaller. CS256 Computer Science I Kevin Sahr, PhD

FOR Loops. Last Modified: 01 June / 1

AQA Computer Science A-Level Boolean algebra Advanced Notes

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

ITE 115 Introduction to Computer Applications

Transcription:

Software Engineering/Mechatronics 3DX4 Slides 3: Reduction of Multiple Subsystems Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on lecture notes by P. Taylor and M. Lawford, and Control Systems Engineering by N. Nise. c 2006-2012 R.J. Leduc 1

Introduction So far we have represented systems as a single block (transfer function), with its inputs and outputs. Many systems are much more complicated and represented by many interconnected subsystems. As its straightforward to calculate the response of a single transfer function, we want to be able to convert multiple subsystems into an equivalent single transfer function. We will use block diagram algebra to do the reduction. This then allows us to apply the techniques we have already developed to the resulting single subsystem. c 2006-2012 R.J. Leduc 2

Block Diagrams When interconnecting multiple subsystems, we need more elements than just a single block with inputs and outputs. We add the elements: Summing Junctions: they combine two or more signals, producing the algebraic sum as output. Pickoff Points: it breaks input signal into multiple copies to be sent to different destinations. Figure 5.2 c 2006-2012 R.J. Leduc 3

Cascade Form First common interconnection method we look at is called the cascade form. Consists of two or more subsystems connected in a serial fashion. Equivalent to a single block with transfer function equal to product of the individual block s transfer functions. Figure 5.3. c 2006-2012 R.J. Leduc 4

Loading in Cascaded Subsystems Formula for combining cascaded subsystems is invalid when a given subsystem loads its preceding subsystem. A given subsystem is not loaded by the next subsystem if its output is unchanged by connecting the following subsystem. c 2006-2012 R.J. Leduc Figure 5.4. 5

Parallel Form For subsystems connected in parallel: They all have same input. The output of the group is the sum of each individual subsystem s output. The equivalent transfer function is the sum of the individual transfer functions. Figure 5.5. c 2006-2012 R.J. Leduc 6

Feedback Form Feedback topology is basis of control systems theory. In Simplified model (Fig. 5.6(b)), we see that: E(s) = R(s) C(s)H(s) We also see C(s) = E(s)G(s) thus E(s) = C(s) G(s). Substituting in above gives: G e (s) = C(s) R(s) = G(s) 1±G(s)H(s) We call G(s)H(s) the open loop transfer function or loop gain. Figure 5.6. c 2006-2012 R.J. Leduc 7

Moving Blocks to Create Familiar Forms Have examined three different topologies so far. In physical systems, we will find them combined into complex arrangements. Recognizing these structures will be key to reducing more complex systems to a single transfer function. Unfortunately, these forms may be present, but not always obvious. We will learn how to move blocks forward or backwards past summing junctions and pickoff points. c 2006-2012 R.J. Leduc 8

Moving Blocks Through Summing Junctions Top figure shows the equivalent diagram when block moved to the left of junction. Can see they are equivalent by noting that on left, C(s) = [R(s) X(s)]G(s) = R(s)G(s) X(s)G(s). Bottom figure shows equivalent system when moving block to the right of junction. Can see equivalent since on right, C(s) = [R(s) X(s) G(s) ]G(s) = R(s)G(s) X(s) Figure 5.7. c 2006-2012 R.J. Leduc 9

Moving Blocks Through Pickoff Points Top figure shows the equivalent diagram when block moved to the left of pickoff point. Bottom figure shows equivalent system when moving block to the right of pickoff point. Figure 5.8. c 2006-2012 R.J. Leduc 10

Reduction Via Familiar Forms eg. Reduce block diagram to a single transfer function. Figure 5.9. We start by noting that the three summations are just doing algebraical sums and can be combined c 2006-2012 R.J. Leduc 11

Reduction Via Familiar Forms eg. - II Combining the summations gives Fig. (a). Applying parallel and cascade rule gives Fig. (b). Applying feedback rule, followed by cascade rule to combine with G 1 (s), gives Fig. (c). Figure 5.10. c 2006-2012 R.J. Leduc 12

Reduction by Moving Block eg. Reduce block diagram to a single transfer function. Figure 5.11. 1. Move G 2 to left of pickoff point creating parallel form. 2. Reduce feedback system (G 3, H 3 ). Figure 5.12. c 2006-2012 R.J. Leduc 13

Reduction by Moving Block eg. - II 1 3. Reduce parallel form containing G 2 (s) and unity. 4. Push G 1 (s) to the right past summing junction. Creates parallel form (H 1 and [ 1 G 1, H 2 ]). 5. Combine serial forms (G 1, G 2 ) and ( 1 G 1, H 2 ). Figure 5.12. 6. Collapse summing junctions, and combine parallel form. 7. Combine serial form on right. c 2006-2012 R.J. Leduc 14

Reduction by Moving Block eg. - III 8. Collapse feedback form. Figure 5.12. 9. Combine the two cascade blocks. Figure 5.12. c 2006-2012 R.J. Leduc 15