University of California Department of Mechanical Engineering ECE230A/ME243A Linear Systems Fall 1999 (B. Bamieh ) Lecture 3: Simulation/Realization 1
|
|
- Quentin Montgomery
- 5 years ago
- Views:
Transcription
1 University of alifornia Department of Mechanical Engineering EE/ME Linear Systems Fall 999 ( amieh ) Lecture : Simulation/Realization Given an nthorder statespace description of the form _x(t) f (x(t) u(t) t) (state evolution equations) () y(t) g (x(t) u(t) t) (instantaneous output equations) : () (whichmay be T or DT, depending on howweinterpret the symbol _x), howdowe simulate the model, ie, how do we implement it or realize it in hardware or software In the DT case, where _x(t) x(t ), this is easy if we have available: (i) storage registers that can be updated at each time step (or \clock cycle") these will store the state variables and (ii) a means of evaluating the functions f( )andg( ) that appear in the statespace description in the linear case, all that we need for this are multipliers and adders straightforward realization is then obtained as shown in the gure below The storage registers are labeled D for (onestep) delay, because the output of the block represents the data currently stored in the register while the input of such a block represents the data waiting to be read into the register at the next clock pulse In the T case, where _x(t) dx(t)dt, the only dierence is that the delay elements are replaced by integrators The outputs of the integrators are then the state variables u[t] x[t ] x[t] y[t] f(: :) D g(: :) Figure : Simulation Diagram Realization from I/O Representations In this section, we will describe how a state space realization can be obtained for a causal inputoutput dynamic system described in terms of convolution onvolution with an Exponential onsider a causal DT LTI system with impulse response h[n] (which is for n<): These notes are part of a set under development by Mohammed Dahleh (U Santa arbara), Munther Dahleh (MIT), and George Verghese (MIT) omments and corrections would be greatly appreciated Please do not copy for or distribute to people not enrolled in without permission from one of the coauthors
2 The rst term above, namely n h[n ; k]u[k] ; n; ; h[n ; k]u[k] x[n] n; ; h[]u[n] () h[n ; k]u[k] () represents the eect of the past on the present This expression shows that, in general (ie if h[n] has no special form), the number x[n] has to be recomputed from scratch for each n When we move from n to n, none of the past input, ie u[k] for k n, can be discarded, because all of the past will again be needed to compute x[n ] In other words, the memory of the system is innite Now look at an instance where special structure in h[n] makes the situation much better Suppose h[n] n for n, and otherwise () Then and x[n ] n; x[n] ; n;k u[k] () n ; n;k u[k] n; u[n] ; n;k u[k] x[n]u[n] () (You will nd it instructive to graphically represent the convolutions that are involved here, in order to understand more visually why the relationship () holds) Gathering () and () with (), we obtain a pair of equations that together constitute a statespace description for this system: x[n ] x[n]u[n] (8) x[n]u[n] (9) To realize this model in hardware, or to simulate it, we can use a delayaddergain system that is obtained as follows We start with a delay element, whose output will be x[n] when its input is x[n ] Now the state evolution equation tells us how tocombine the present output of the delay element, x[n], with the present input to the system, u[n], in order to obtain the present input to the delay element, x[n ] This leads to the following block diagram, in which wehave used the output equation to determine how to obtain from the present state and input of the system: u[n] m D x[n] x[n ]
3 onvolution with a Sum of Exponentials onsider a more complicated causal impulse response than the previous example, namely h[n] [n]( n n L n L ) () with the i being constants The following block diagram shows that this system can be considered as being obtained through the parallel interconnection of causal subsystems that are as simple as the one treated earlier, plus a direct feedthrough of the input through the gain (each block is labeled with its impulse response, with causality implying that these responses are for n<): [n] u[n] n L n L N i Motivated by theabove structure and the treatment of the earlier, let us dene a state variable for each of the L subsystems: x i [n] n; ; n;k i u[k] i ::: L () With this, we immediately obtain the following stateevolution equations for the subsystems: lso, after a little algebra, we directly nd x i [n ] i x i [n] i u[n] i ::: L () x [n] x [n] L x L [n]( L i ) u[n] () We have thus arrived at an Lthorder statespace description of the given system To write the above statespace description in matrix form, dene the state vector at time n to be x[n] x [n] x [n] x L [n] () lso dene the diagonal matrix, column vector b, androwvector c as follows: c b L L L () ()
4 Then our statespace model takes the desired matrix form, as you can easily verify: x[n ] x[n]bu[n] () cx[n]du[n] (8) where d L i (9) Realization from an LTI Dierential/Dierence equation In this section, we describe how a realization can be obtained from a dierence or a dierential equation We begin with an example Example (StateSpace Models for an LTI Dierence Equation) Let us examine some ways of representing the following inputoutput dierence equation in statespace form: a y[n ; ] a y[n ; ] b u[n ; ] b u[n ; ] () For a rst attempt, consider using as state vector the quantity x[n] y[n ; ] y[n ; ] u[n ; ] u[n ; ] () The corresponding thorder statespace model would take the form x[n ] y[n ; ] u[n] u[n ; ] ;a ;a b b ;a ;a b b y[n ; ] y[n ; ] u[n ; ] u[n ; ] y[n ; ] y[n ; ] u[n ; ] u[n ; ] u[n] ()u[n] () If we are somewhat more careful about our choice of state variables, it is possible to get more economical models For a rdorder model, suppose we pick as state vector x[n] y[n ; ] u[n ; ] The corresponding rdorder statespace model takes the form x[n ] y[n ] u[n] ;a ;a b () y[n ; ] u[n ; ] y[n ; ] u[n ; ] b u[n] ()u[n] ()
5 still more clever/devious choice of state variables yields a ndorder statespace model For this, pick x[n] ;a y[n ; ] b u[n ; ] The corresponding ndorder statespace model takes the form y[n ] ;a b u[n] ;a ;a ;a y[n ; ] b u[n ; ] ;a y[n ; ] b u[n ; ] () b b u[n] ()u[n] () It turns out to be impossible in general to get a statespace description of order lower than in this case This should not be surprising, in view of the fact that we started with a ndorder dierence equation, which we know (from earlier courses) requires two initial conditions in order to solve forwards in time Notice how, in each of the above cases, we have incorporated the information contained in the original dierence equation that we started with This example was built around a secondorder dierence equation, but has natural generalizations to the nthorder case, and natural parallels in the case of T dierential equations Next, we will present two realizations of an nthorder LTI dierential equation While realizations are not unique, these two have certain nice properties that will be discussed in the future Observability anonical Form Suppose we are given the LTI dierential equation which can be rearranged as y (n) a n;y (n;) a y b u b _u b n;u (n;) y (n) (b n;u (n;) ; b n;y (n;) )(b n;u (n;) ; a n;y (n;) )(b u ; a y): Integrated n times, this becomes y Z (b n;u ; a n;y) Z Z Z (b n;u ; a n;y) n Z (b u ; a y): () The block diagram given in Figure then follows directly from () This particular realization is called the observability canonical form realization \canonical" in the sense of \simple" (but there is actually a strict mathematical denition as well), and \observability" for reasons that will emerge later in the course
6 u b b b n; b n; Z Z Z Z _x n x n _x n; x n; _x x _x x y ;a ;a ;a n; ;a n; Figure : Observability anonical Form We can now read the state equations directly from Figure, once we recognize that the natural state variables are the outputs of the integrators: _x ;a n;x x b n;u _x ;a n;x x b n;u _x n ;a x b u y x : If this is written in our usual matrix form, we would have c ;a n; ;a n; ;a h i : b b n; b n; b The matrix is said to be in companion form, a term used to refer to any one of four matrices whose pattern of 's and 's is, or resembles, the pattern seen above The characteristic polynomial of such a matrix can be directly read o from the remaining coecients, as we shall see when we talk about these polynomials, so this matrix is a \companion" to its characteristic polynomial Reachability anonical Form There is a \dual" realization to the one presented in the previous section for the LTI dierential equation y (n) a n;y (n;) a y c u c _u c n;u (n;) : (8) First, consider a special case of this, namely the dierential equation w (n) a n;w (n;) a w u (9)
7 To obtain an nthorder statespace realization of this system, dene x x x x x n; x n w _w w d n; w dt n; d n; w dt n; Then it is easy to verify that the following statespace description represents the given model: d dt x x x x n; x n w h ::: ::: ::: ::: ;a (t) ;a (t) ;a (t) ::: ;a n;(t) ;a n;(t) ::: i x x x x n; x n : : x x x x n; x n u (The matrix here is again in one of the companion forms the two remaining companion forms are the transposes of the one here and the transpose of the one in the previous section) Suppose now that we want to realize another special case, namely the dierential equation r (n) a n;r (n;) a r _u () which is the same equation as (9), except that the RHS is _u rather than u y linearity, the response of () will r _w(t), and this response can be obtained from the above realization by simply taking the output to be x rather than x, since x _w r Superposing special cases of the preceding form, we see that if we have the dierential equation (8), with an RHS of c u c _u c n;u (n;) then the above realization suces, provided we take the output to be y c x c x c n;x n : () ie, we just change the output equation to have c h c c c c n; i : () block diagram of the nal realization is shown below in This is called the reachability or controllability canonical form Finally, for the obvious DT dierence equation that is analogous to the T dierential equation that we used in this example, the same scheme will work, with derivatives replaced by dierences
8 Z Z Z Z u _x n x n x n; _x x _x x I M c n; y ;a n; ;a n; ;a ;a c c Exercises Figure : Reachability anonical Form Exercise Suppose we wish to realize a twoinput dierential equation of the form y (n) a n;y (n;) a y b u b _u b n; u (n;) b u b _u b n; u (n;) Show how you would modify the observability canonical realization to accomplish this, still using only n integrators Exercise How would reachability canonical realization be modied if the linear differential equation that we started with was time varying rather than time invariant Exercise Show how to modify the reachability canonical realization but still using only n integrators toobtain a realization of a twooutput system of the form y (n) a n;y (n;) a y c u c _u c n;u (n;) y (n) a n;y (n;) a y c u c _u c n;u (n;) : Exercise Let the state space representations of two given systems be x i (k ) i x i (k) i u i (k) y i (k) i x i (k) i Determine a statespace representation in the form x(k ) x(k)u(k) y(k) x(k) for the new system obtained when systems and are interconnected as follows: a) In series: 8
9 b) In parallel: c) In a feedback loop: (ssume that the numbers of inputs and outputs in each case are conformable for the connection being considered) Exercise onsider a causal continuoustime system with inputoutput representation y(t) h u(t), where denotes convolution and h(t) is the impulse response of the system: Here c denotes a constant h(t) e ;t ; ce ;t for t a) Suppose c Use only the inputoutput representation of the system to show that the variables x (t) y(t) and x (t) _y(t) qualify as state variables of th e system at time t b) ompute the transfer function of the system, and use it to describe wh at may be special about the case c Exercise onsider the nonlinear dierence equation (a) (b) form y(k) F [y(k ; ) ::: y(k ; n) u(k ; ) ::: u(k ; n) k; n] Find a statespace representation of order n ; for this dierence equation Find an nthorder statespace representation in the case where F [:] has the special F [:] n i f i [y(k ; i) u(k ; i)] (c) If f i ( ) a i b i nd a linear statespace representation of the form x(k) x(k ; ) u(k ; ), y(k ; ) x(k ; ) Exercise The input u(t) and output y(t) of a system are related by the equation dy(t) dt a (t)y(t) b (t)u(t)b (t) du(t) Find a linear, time varying statespace representation of this system dt 9
hapter 8 Simulation/Realization 8 Introduction Given an nth-order state-space description of the form x_ (t) = f (x(t) u(t) t) (state evolution equati
Lectures on Dynamic Systems and ontrol Mohammed Dahleh Munther Dahleh George Verghese Department of Electrical Engineering and omputer Science Massachuasetts Institute of Technology c hapter 8 Simulation/Realization
More informationChapter 30 Minimality and Stability of Interconnected Systems 30.1 Introduction: Relating I/O and State-Space Properties We have already seen in Chapt
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter
More informationExamples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:
Discrete-Time s - I Time-Domain Representation CHAPTER 4 These lecture slides are based on "Digital Signal Processing: A Computer-Based Approach, 4th ed." textbook by S.K. Mitra and its instructor materials.
More informationLecture 11 FIR Filters
Lecture 11 FIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/4/12 1 The Unit Impulse Sequence Any sequence can be represented in this way. The equation is true if k ranges
More informationDifferential and Difference LTI systems
Signals and Systems Lecture: 6 Differential and Difference LTI systems Differential and difference linear time-invariant (LTI) systems constitute an extremely important class of systems in engineering.
More informationNotice the minus sign on the adder: it indicates that the lower input is subtracted rather than added.
6.003 Homework Due at the beginning of recitation on Wednesday, February 17, 010. Problems 1. Black s Equation Consider the general form of a feedback problem: + F G Notice the minus sign on the adder:
More informationChapter 3 Least Squares Solution of y = A x 3.1 Introduction We turn to a problem that is dual to the overconstrained estimation problems considered s
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter
More informationChapter 9 Observers, Model-based Controllers 9. Introduction In here we deal with the general case where only a subset of the states, or linear combin
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 9 Observers,
More informationLECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)
LECTURE NOTES ON DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13) FACULTY : B.V.S.RENUKA DEVI (Asst.Prof) / Dr. K. SRINIVASA RAO (Assoc. Prof) DEPARTMENT OF ELECTRONICS AND COMMUNICATIONS
More informationChapter 7 Interconnected Systems and Feedback: Well-Posedness, Stability, and Performance 7. Introduction Feedback control is a powerful approach to o
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 7 Interconnected
More informationModule 1: Signals & System
Module 1: Signals & System Lecture 6: Basic Signals in Detail Basic Signals in detail We now introduce formally some of the basic signals namely 1) The Unit Impulse function. 2) The Unit Step function
More informationDEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010
[E2.5] IMPERIAL COLLEGE LONDON DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010 EEE/ISE PART II MEng. BEng and ACGI SIGNALS AND LINEAR SYSTEMS Time allowed: 2:00 hours There are FOUR
More informationLecture 19 IIR Filters
Lecture 19 IIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/5/10 1 General IIR Difference Equation IIR system: infinite-impulse response system The most general class
More informationCh 2: Linear Time-Invariant System
Ch 2: Linear Time-Invariant System A system is said to be Linear Time-Invariant (LTI) if it possesses the basic system properties of linearity and time-invariance. Consider a system with an output signal
More informationThe Convolution Sum for Discrete-Time LTI Systems
The Convolution Sum for Discrete-Time LTI Systems Andrew W. H. House 01 June 004 1 The Basics of the Convolution Sum Consider a DT LTI system, L. x(n) L y(n) DT convolution is based on an earlier result
More informationDiscrete-Time Systems
FIR Filters With this chapter we turn to systems as opposed to signals. The systems discussed in this chapter are finite impulse response (FIR) digital filters. The term digital filter arises because these
More informationCosc 3451 Signals and Systems. What is a system? Systems Terminology and Properties of Systems
Cosc 3451 Signals and Systems Systems Terminology and Properties of Systems What is a system? an entity that manipulates one or more signals to yield new signals (often to accomplish a function) can be
More informationChapter 2 Time-Domain Representations of LTI Systems
Chapter 2 Time-Domain Representations of LTI Systems 1 Introduction Impulse responses of LTI systems Linear constant-coefficients differential or difference equations of LTI systems Block diagram representations
More informationECE 301 Division 1 Exam 1 Solutions, 10/6/2011, 8-9:45pm in ME 1061.
ECE 301 Division 1 Exam 1 Solutions, 10/6/011, 8-9:45pm in ME 1061. Your ID will be checked during the exam. Please bring a No. pencil to fill out the answer sheet. This is a closed-book exam. No calculators
More informationThe objective of this LabVIEW Mini Project was to understand the following concepts:
1. Objective The objective of this LabVIEW Mini Project was to understand the following concepts: The convolution of two functions Creating LABVIEW Virtual Instruments see the visual representation of
More informationEE 210. Signals and Systems Solutions of homework 2
EE 2. Signals and Systems Solutions of homework 2 Spring 2 Exercise Due Date Week of 22 nd Feb. Problems Q Compute and sketch the output y[n] of each discrete-time LTI system below with impulse response
More information2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal
2. CONVOLUTION Convolution sum. Response of d.t. LTI systems at a certain input signal Any signal multiplied by the unit impulse = the unit impulse weighted by the value of the signal in 0: xn [ ] δ [
More informationDigital Signal Processing Lecture 5
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 5 Begüm Demir E-mail:
More information06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1
IV. Continuous-Time Signals & LTI Systems [p. 3] Analog signal definition [p. 4] Periodic signal [p. 5] One-sided signal [p. 6] Finite length signal [p. 7] Impulse function [p. 9] Sampling property [p.11]
More informationUniversity Question Paper Solution
Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=
More informationIntroduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year
Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year 2017-2018 1 Outline Systems modeling: input/output approach of LTI systems. Convolution
More information信號與系統 Signals and Systems
Spring 2010 信號與系統 Signals and Systems Chapter SS-2 Linear Time-Invariant Systems Feng-Li Lian NTU-EE Feb10 Jun10 Figures and images used in these lecture notes are adopted from Signals & Systems by Alan
More informationInterconnection of LTI Systems
EENG226 Signals and Systems Chapter 2 Time-Domain Representations of Linear Time-Invariant Systems Interconnection of LTI Systems Prof. Dr. Hasan AMCA Electrical and Electronic Engineering Department (ee.emu.edu.tr)
More informationLecture 1 From Continuous-Time to Discrete-Time
Lecture From Continuous-Time to Discrete-Time Outline. Continuous and Discrete-Time Signals and Systems................. What is a signal?................................2 What is a system?.............................
More informationDigital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung
Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. The input
More informationChapter Stability Robustness Introduction Last chapter showed how the Nyquist stability criterion provides conditions for the stability robustness of
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter Stability
More informationSignals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions
8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether
More informationNAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet
NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet Test Duration: 75 minutes Coverage: Chaps 1,2 Open Book but Closed Notes One 85 in x 11 in crib sheet Calculators NOT allowed DO NOT
More informationChapter 8 Stabilization: State Feedback 8. Introduction: Stabilization One reason feedback control systems are designed is to stabilize systems that m
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of echnology c Chapter 8 Stabilization:
More informationObservability. It was the property in Lyapunov stability which allowed us to resolve that
Observability We have seen observability twice already It was the property which permitted us to retrieve the initial state from the initial data {u(0),y(0),u(1),y(1),...,u(n 1),y(n 1)} It was the property
More informationNAME: 13 February 2013 EE301 Signals and Systems Exam 1 Cover Sheet
NAME: February EE Signals and Systems Exam Cover Sheet Test Duration: 75 minutes. Coverage: Chaps., Open Book but Closed Notes. One 8.5 in. x in. crib sheet Calculators NOT allowed. This test contains
More information信號與系統 Signals and Systems
Spring 2015 信號與系統 Signals and Systems Chapter SS-2 Linear Time-Invariant Systems Feng-Li Lian NTU-EE Feb15 Jun15 Figures and images used in these lecture notes are adopted from Signals & Systems by Alan
More informationOur goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always
October 5 Relevant reading: Section 2.1, 2.2, 2.3 and 2.4 Our goal is to solve a general constant coecient linear second order ODE a d2 y dt + bdy + cy = g (t) 2 dt where a, b, c are constants and a 0.
More informationChap 4. State-Space Solutions and
Chap 4. State-Space Solutions and Realizations Outlines 1. Introduction 2. Solution of LTI State Equation 3. Equivalent State Equations 4. Realizations 5. Solution of Linear Time-Varying (LTV) Equations
More informationSignals and Systems Chapter 2
Signals and Systems Chapter 2 Continuous-Time Systems Prof. Yasser Mostafa Kadah Overview of Chapter 2 Systems and their classification Linear time-invariant systems System Concept Mathematical transformation
More informationIII. Time Domain Analysis of systems
1 III. Time Domain Analysis of systems Here, we adapt properties of continuous time systems to discrete time systems Section 2.2-2.5, pp 17-39 System Notation y(n) = T[ x(n) ] A. Types of Systems Memoryless
More informationUNIT 1. SIGNALS AND SYSTEM
Page no: 1 UNIT 1. SIGNALS AND SYSTEM INTRODUCTION A SIGNAL is defined as any physical quantity that changes with time, distance, speed, position, pressure, temperature or some other quantity. A SIGNAL
More informationECE504: Lecture 8. D. Richard Brown III. Worcester Polytechnic Institute. 28-Oct-2008
ECE504: Lecture 8 D. Richard Brown III Worcester Polytechnic Institute 28-Oct-2008 Worcester Polytechnic Institute D. Richard Brown III 28-Oct-2008 1 / 30 Lecture 8 Major Topics ECE504: Lecture 8 We are
More informationDigital Filter Structures. Basic IIR Digital Filter Structures. of an LTI digital filter is given by the convolution sum or, by the linear constant
Digital Filter Chapter 8 Digital Filter Block Diagram Representation Equivalent Basic FIR Digital Filter Basic IIR Digital Filter. Block Diagram Representation In the time domain, the input-output relations
More informationIntroduction to Modern Control MT 2016
CDT Autonomous and Intelligent Machines & Systems Introduction to Modern Control MT 2016 Alessandro Abate Lecture 2 First-order ordinary differential equations (ODE) Solution of a linear ODE Hints to nonlinear
More informationECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52
1/52 ECEN 420 LINEAR CONTROL SYSTEMS Lecture 2 Laplace Transform I Linear Time Invariant Systems A general LTI system may be described by the linear constant coefficient differential equation: a n d n
More informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
More informationThe z-transform Part 2
http://faculty.kfupm.edu.sa/ee/muqaibel/ The z-transform Part 2 Dr. Ali Hussein Muqaibel The material to be covered in this lecture is as follows: Properties of the z-transform Linearity Initial and final
More informationThis homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted.
6.003 Homework #14 This homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted. Problems 1. Neural signals The following figure illustrates
More informationModeling and Analysis of Systems Lecture #3 - Linear, Time-Invariant (LTI) Systems. Guillaume Drion Academic year
Modeling and Analysis of Systems Lecture #3 - Linear, Time-Invariant (LTI) Systems Guillaume Drion Academic year 2015-2016 1 Outline Systems modeling: input/output approach and LTI systems. Convolution
More informationChapter 3 Convolution Representation
Chapter 3 Convolution Representation DT Unit-Impulse Response Consider the DT SISO system: xn [ ] System yn [ ] xn [ ] = δ[ n] If the input signal is and the system has no energy at n = 0, the output yn
More informationDigital Signal Processing Lecture 4
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 4 Begüm Demir E-mail:
More informationFinal Exam 14 May LAST Name FIRST Name Lab Time
EECS 20n: Structure and Interpretation of Signals and Systems Department of Electrical Engineering and Computer Sciences UNIVERSITY OF CALIFORNIA BERKELEY Final Exam 14 May 2005 LAST Name FIRST Name Lab
More informationProperties of LTI Systems
Properties of LTI Systems Properties of Continuous Time LTI Systems Systems with or without memory: A system is memory less if its output at any time depends only on the value of the input at that same
More informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
More informationMassachusetts Institute of Technology
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.11: Introduction to Communication, Control and Signal Processing QUIZ 1, March 16, 21 QUESTION BOOKLET
More informationAnalog vs. discrete signals
Analog vs. discrete signals Continuous-time signals are also known as analog signals because their amplitude is analogous (i.e., proportional) to the physical quantity they represent. Discrete-time signals
More informationNew Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam
New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Name: Solve problems 1 3 and two from problems 4 7. Circle below which two of problems 4 7 you
More informationLecture 2. Introduction to Systems (Lathi )
Lecture 2 Introduction to Systems (Lathi 1.6-1.8) Pier Luigi Dragotti Department of Electrical & Electronic Engineering Imperial College London URL: www.commsp.ee.ic.ac.uk/~pld/teaching/ E-mail: p.dragotti@imperial.ac.uk
More informationQUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)
QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier
More informationEE Control Systems LECTURE 9
Updated: Sunday, February, 999 EE - Control Systems LECTURE 9 Copyright FL Lewis 998 All rights reserved STABILITY OF LINEAR SYSTEMS We discuss the stability of input/output systems and of state-space
More information6.241 Dynamic Systems and Control
6.241 Dynamic Systems and Control Lecture 7: State-space Models Readings: DDV, Chapters 7,8 Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology February 25, 2011 E. Frazzoli
More informationLecture 5 - Assembly Programming(II), Intro to Digital Filters
GoBack Lecture 5 - Assembly Programming(II), Intro to Digital Filters James Barnes (James.Barnes@colostate.edu) Spring 2009 Colorado State University Dept of Electrical and Computer Engineering ECE423
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 1: Course Overview; Discrete-Time Signals & Systems Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E.
More informationShift Property of z-transform. Lecture 16. More z-transform (Lathi 5.2, ) More Properties of z-transform. Convolution property of z-transform
Shift Property of -Transform If Lecture 6 More -Transform (Lathi 5.2,5.4-5.5) then which is delay causal signal by sample period. If we delay x[n] first: Peter Cheung Department of Electrical & Electronic
More informationNew Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Spring 2018 Exam #1
New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Spring 2018 Exam #1 Name: Prob. 1 Prob. 2 Prob. 3 Prob. 4 Total / 30 points / 20 points / 25 points /
More informationCh. 7: Z-transform Reading
c J. Fessler, June 9, 3, 6:3 (student version) 7. Ch. 7: Z-transform Definition Properties linearity / superposition time shift convolution: y[n] =h[n] x[n] Y (z) =H(z) X(z) Inverse z-transform by coefficient
More informationIntroduction to DSP Time Domain Representation of Signals and Systems
Introduction to DSP Time Domain Representation of Signals and Systems Dr. Waleed Al-Hanafy waleed alhanafy@yahoo.com Faculty of Electronic Engineering, Menoufia Univ., Egypt Digital Signal Processing (ECE407)
More informationNORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS
page 1 of 5 (+ appendix) NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS Contact during examination: Name: Magne H. Johnsen Tel.: 73 59 26 78/930 25 534
More information1 Continuous-time Systems
Observability Completely controllable systems can be restructured by means of state feedback to have many desirable properties. But what if the state is not available for feedback? What if only the output
More informationTherefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1
Module 2 : Signals in Frequency Domain Problem Set 2 Problem 1 Let be a periodic signal with fundamental period T and Fourier series coefficients. Derive the Fourier series coefficients of each of the
More informationChapter 6 Balanced Realization 6. Introduction One popular approach for obtaining a minimal realization is known as Balanced Realization. In this appr
Lectures on ynamic Systems and Control Mohammed ahleh Munther A. ahleh George Verghese epartment of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 6 Balanced
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationModule 4 : Laplace and Z Transform Problem Set 4
Module 4 : Laplace and Z Transform Problem Set 4 Problem 1 The input x(t) and output y(t) of a causal LTI system are related to the block diagram representation shown in the figure. (a) Determine a differential
More informationProfessor Fearing EECS120/Problem Set 2 v 1.01 Fall 2016 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2.
Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 20 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2. Note: Π(t) = u(t + 1) u(t 1 ), and r(t) = tu(t) where u(t)
More informationModule 07 Controllability and Controller Design of Dynamical LTI Systems
Module 07 Controllability and Controller Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha October
More informationNew Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Fall 2017 Exam #1
New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2017 Exam #1 Name: Prob. 1 Prob. 2 Prob. 3 Prob. 4 Total / 30 points / 20 points / 25 points / 25
More informationBackground LTI Systems (4A) Young Won Lim 4/20/15
Background LTI Systems (4A) Copyright (c) 2014-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2
More informationSystems and Control Theory Lecture Notes. Laura Giarré
Systems and Control Theory Lecture Notes Laura Giarré L. Giarré 2017-2018 Lesson 5: State Space Systems State Dimension Infinite-Dimensional systems State-space model (nonlinear) LTI State Space model
More informationProblem Value Score No/Wrong Rec 3
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING QUIZ #3 DATE: 21-Nov-11 COURSE: ECE-2025 NAME: GT username: LAST, FIRST (ex: gpburdell3) 3 points 3 points 3 points Recitation
More informationChapter 2: Time-Domain Representations of Linear Time-Invariant Systems. Chih-Wei Liu
Chapter : Time-Domain Representations of Linear Time-Invariant Systems Chih-Wei Liu Outline Characteristics of Systems Described by Differential and Difference Equations Block Diagram Representations State-Variable
More informationSolution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet
Solution 10 July 2015 ECE301 Signals and Systems: Midterm Cover Sheet Test Duration: 60 minutes Coverage: Chap. 1,2,3,4 One 8.5" x 11" crib sheet is allowed. Calculators, textbooks, notes are not allowed.
More information# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.
[ ] = h k M [ ] = b k x[ n " k] FIR k= M [ ]x[ n " k] convolution k= x[ n] = Ae j" e j ˆ n Complex exponential input [ ] = h k M % k= [ ]Ae j" e j ˆ % M = ' h[ k]e " j ˆ & k= k = H (" ˆ )Ae j e j ˆ ( )
More informationNon-uniform acceleration *
OpenStax-CNX module: m14547 1 Non-uniform acceleration * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 Non-uniform acceleration
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationLecture 1: Introduction Introduction
Module 1: Signals in Natural Domain Lecture 1: Introduction Introduction The intent of this introduction is to give the reader an idea about Signals and Systems as a field of study and its applications.
More informationLTI Systems (Continuous & Discrete) - Basics
LTI Systems (Continuous & Discrete) - Basics 1. A system with an input x(t) and output y(t) is described by the relation: y(t) = t. x(t). This system is (a) linear and time-invariant (b) linear and time-varying
More informationGrades will be determined by the correctness of your answers (explanations are not required).
6.00 (Fall 2011) Final Examination December 19, 2011 Name: Kerberos Username: Please circle your section number: Section Time 2 11 am 1 pm 4 2 pm Grades will be determined by the correctness of your answers
More informationEE 224 Signals and Systems I Review 1/10
EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS
More informationLecture V: Linear difference and differential equations
Lecture V: Linear difference and differential equations BME 171: Signals and Systems Duke University September 10, 2008 This lecture Plan for the lecture: 1 Discrete-time systems linear difference equations
More informationDIGITAL SIGNAL PROCESSING UNIT 1 SIGNALS AND SYSTEMS 1. What is a continuous and discrete time signal? Continuous time signal: A signal x(t) is said to be continuous if it is defined for all time t. Continuous
More informationCLTI System Response (4A) Young Won Lim 4/11/15
CLTI System Response (4A) Copyright (c) 2011-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2
More informationx(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]
ECE30 Summer II, 2006 Exam, Blue Version July 2, 2006 Name: Solution Score: 00/00 You must show all of your work for full credit. Calculators may NOT be used.. (5 points) x(t) = tu(t ) + ( t)u(t 2) u(t
More informationVU Signal and Image Processing
052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/18s/
More informationLecture 2 Discrete-Time LTI Systems: Introduction
Lecture 2 Discrete-Time LTI Systems: Introduction Outline 2.1 Classification of Systems.............................. 1 2.1.1 Memoryless................................. 1 2.1.2 Causal....................................
More informationControl Systems I. Lecture 7: Feedback and the Root Locus method. Readings: Jacopo Tani. Institute for Dynamic Systems and Control D-MAVT ETH Zürich
Control Systems I Lecture 7: Feedback and the Root Locus method Readings: Jacopo Tani Institute for Dynamic Systems and Control D-MAVT ETH Zürich November 2, 2018 J. Tani, E. Frazzoli (ETH) Lecture 7:
More informationNAME: 20 February 2014 EE301 Signals and Systems Exam 1 Cover Sheet
NAME: February 4 EE Signals and Systems Exam Cover Sheet Test Duration: 75 minutes. Coverage: Chaps., Open Book but Closed Notes. One 8.5 in. x in. crib sheet Calculators NOT allowed. This test contains
More informationLet H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )
Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:
More informationGrades will be determined by the correctness of your answers (explanations are not required).
6.00 (Fall 20) Final Examination December 9, 20 Name: Kerberos Username: Please circle your section number: Section Time 2 am pm 4 2 pm Grades will be determined by the correctness of your answers (explanations
More informationNAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.
University of California at Berkeley Department of Electrical Engineering and Computer Sciences Professor J. M. Kahn, EECS 120, Fall 1998 Final Examination, Wednesday, December 16, 1998, 5-8 pm NAME: 1.
More information