DOCSLIB.ORG

ECE4330 Lecture 21 Linear Discrete-Time Systems: Solution of Difference Equations by Iteration, by the Z-Transform and by Convolution Prof

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ECE4330 Lecture 21 Linear Discrete-Time Systems: Solution of Difference Equations by Iteration, by the Z-Transform and by Convolution Prof ECE4330 Lecture 21 Linear Discrete-Time Systems: Solution of Difference Equations by Iteration, by the Z-transform and by Convolution Prof. Mohamad Hassoun Linear Time-Invariant Discrete-Time (LTID) System Analysis Consider a linear discrete-time system. We are interested in solving for the complete response 푦[푘] given the difference equation governing the system, its associated initial conditions and the input 푓[푘]. It will be shown that 푦[푘] is a sequence of numbers that can be obtained explicitly by simple recursion (iteration). Alternatively, an analytic solution of the linear difference equation can be obtained based on the Z- transform method. The analytic solution can also be obtained based on a systematic time-domain method, as covered in the next lecture. There are two equivalent formulations for a difference equation: The advance operator formulation and the delay operator formulation. The following analysis illustrates how to convert one formulation to the other. Delay Operator Formulation The following is an example of a delay formulation, second-order linear difference equation. Here, the signal 푦[푘] appears right shifted, 푦[푘] − 5푦[푘 − 1] + 6푦[푘 − 2] = 푓[푘 − 1] − 5푓[푘 − 2] (1) with the initial conditions 푦[−1] = 2 and 푦[−2] = 1. Let the input signal be the causal signal 푓[푘] = (3푘 + 5)푢[푘]. Solve for 푦[푘], 푘 ≥ 0 Advance Operator Formulation The advance operator formulation for the above difference equation can be obtained by simply shifting the difference equation so that the largest difference term 푦[푘 − 2] becomes 푦[푘]. Which requires replacing 푘 by 푘 + 2 throughout the equation, to obtain: 푦[푘 + 2] − 5푦[푘 + 1] + 6푦[푘] = 푓[푘 + 1] − 5푓[푘] (2) Next, we need to establish a set of appropriate initial conditions, 푦[0] and 푦[1]. This can be done by setting 푘 to 0 and then to 1 in Equation (1) and solving for 푦[0] and 푦[1], respectively, as follows. Set 푘 = 0 in Eqn. (1) to obtain 푦[0], 푦[0] = 5푦[−1] − 6푦[−2] + 푓[−1] − 5푓[−2] 푦[0] = 5(2) − 6(1) + 0 − 0 = 10 − 6 → 푦[0] = 4 Set 푘 = 1 in Eqn. (1) to obtain 푦[1], 푦[1] = 5푦[0] − 6푦[−1] + 푓[0] − 5푓[−1] 푦[1] = 5(4) − 6(2) + 5 − 0 = 13 → 푦[1] = 13 It is important to note that when we derived the initial conditions for this system, one of them (푦[1]) depended on the input value 푓[0]. So we say that the initial conditions are tainted by the input. When that occurs, the advance formulation should be avoided if we are looking for decoupled solutions of the form 푦[푘] = 푦푧푠[푘] + 푦푧[푘]. This will be illustrated through an example later in this lecture. Analysis Methods for Computing 푦[푘] Iterative method (numerical solution; also works for non-linear systems) Z-transform method; allows for finding 푦푧푠[푘] and 푦푧[푘]. Time-domain convolution for finding 푦푧푠[푘]. (Refer to the last section.) Time-domain analysis. (Refer to the classical method of solution of difference equations covered in Lecture 22.) Solve the above advance-formulation, second-order linear difference equation using the iterative method. First, we solve for the highest delay term in the difference equation to arrive at the recursion formula 푦[푘 + 2] = 5푦[푘 + 1] − 6푦[푘] + [3(푘 + 1) + 5]푢[푘 + 1] −5(3푘 + 5)푢[푘] and then start iterating with 푦[0] = 4 and 푦[1] = 13, as is shown below. 푘 = 0: 푦[2] = 5푦[1] − 6푦[0] + (3 + 5)(1) − 5(0 + 5)(1) 푦[2] = 5(13) − 6(4) + 8 − 25 = 24 푘 = 1: 푦[3] = 5푦[2] − 6푦[1] + (6 + 5)(1) − 5(3 + 5)(1) 푦[3] = 5(24) − 6(13) + 11 − 40 = 13 Repeat for 푘 = 2, 3, 4, … to generate the solution sequence (푘 ≥ 0) 푦[푘] = 4, 13, 24, 13, −120, … Next, we illustrate the iterative solution applied to the delay formulation equation, Eqn. (1). First, we obtain the recursion formula for 푦[푘] as, 푦[푘] = 5푦[푘 − 1] − 6푦[푘 − 2] + (3푘 + 2)푢[푘 − 1] − 5(3푘 − 1)푢[푘 − 2] and start iterating with 푦[−1] = 2 and 푦[−2] = 1 as follows, 푘 = 0: 푦[0] = 5푦[−1] − 6푦[−2] + 2푢[−1] − 5(−1)푢[−2] 푦[0] = 5(2) − 6(1) + 0 + 0 푦[0] = 4 푘 = 1: 푦[1] = 5푦[0] − 6푦[−1] + 5푢[0] − 5(2)푢[−1] 푦[1] = 5(4) − 6(2) + 5 − 0 푦[1] = 13 Repeat for 푘 = 2, 3, 4, … to generate the solution sequence (푘 ≥ 0) 푦[푘] = 4, 13, 24, 13, −120, … This sequence is identical to the one obtained earlier using the advance formulation. Mathcad numerical solution for the advance operator difference equation (note: press ‘[‘ to input the subscript): Mathcad numerical solution for the delay operator difference equation Note how the above Mathcad solution automatically performs the required iterations to compute the sequence (vector) 푦. Mathcad allows the user to redefine the array origin. For the above delay operator recursion we had to set the origin at −2 in the Math Options menu, as illustrated below. (For the advance formulation solution the array origin has to be set to 0.) Solving for the Complete Response 푦[푘] = 푦푧푠[푘] + 푦푧[푘] using the Z-Transform Method The Z-transform method can be applied to the difference equation to (analytically) generate the complete response. However, if we intend to use it to generate the decoupled response 푦[푘] = 푦푧푠[푘] + 푦푧[푘], we have to make sure that the initial conditions we use are not dependent on the input signal. As pointed out earlier, one of the advance formulation initial conditions (for our example system) is dependent on the input. Therefore, for that advance formulation system the Z-transform method can be applied to generate 푦[푘], but not 푦푧푠[푘] and 푦푧[푘]. On the other hand, the Z- transform method can be used to generate 푦[푘] = 푦푧푠[푘] + 푦푧[푘] for the delay formulation system. Example. Z-transform analysis for the delay formulation system: 푦[푘] − 5푦[푘 − 1] + 6푦[푘 − 2] = 푓[푘 − 1] − 5푓[푘 − 2] 푦[−1] = 2 , 푦[−2] = 1 푓[푘] = (3푘 + 5)푢[푘] We will find 푦푧푠[푘] first by Z-transforming the difference equation, assuming zero initial conditions, to obtain 퐻(푧) and then employ the formula, −1 푦푧푠[푘] = 푍 {퐻(푧)퐹(푧)} But first, we must be clear about the meaning of the shifted signals 푦[푘 − 1] and 푦[푘 − 2]. Do they mean 푦[푘 − 1]푢[푘] and 푦[푘 − 2]푢[푘] or 푦[푘 − 1]푢[푘 − 1] and 푦[푘 − 2]푢[푘 − 2]? Well, since our Z-transform is one-sided it means that we are considering the situation for 푘 ≥ 0. So, every signal is assumed to be causal and is counted from 푘 = 0. Therefore, the terms 푦[푘 − 푚] mean 푦[푘 − 푚]푢[푘], for integer 푚. Transforming (and using the right-shift property) we obtain 1 1 1 푌(푧) − 5 ( 푌(푧) + 푦[−1]) + 6 ( 푌(푧) + 푦[−1] + 푦[−2]) 푧 푧2 푧 1 1 1 = ( 퐹(푧) + 푓[−1]) − 5 ( 퐹(푧) + 푓[−1] + 푓[−2]) 푧 푧2 푧 which, with the requirement that the initial conditions are zero (zero-state) and by noting that 푓[푘] is a causal signal {푓[−1] = 푓[−2] = 0}, reduces to 5 6 1 5 (1 − + ) 푌 (푧) = ( − ) 퐹(푧) 푧 푧2 푧푠 푧 푧2 Next, multiplying the above equation by 푧2, leads to 2 (푧 − 5푧 + 6)푌푧푠(푧) = (푧 − 5)퐹(푧) which has the form 푄(푧)푌푧푠(푧) = 푃(푧)퐹(푧). The transfer function is then, 푌 (푧) 푃(푧) 퐻(푧) ≜ 푧푠 = 퐹(푧) 푄(푧) which results in 푧−5 퐻(푧) = → The poles are at 푧 = 2 , 푧 = 3 (푧−2)(푧−3) 1 2 The system is unstable since |푧| > 1. Before we proceed to solve for 푦푧푠[푘], let us determine the unit-impulse response, ℎ[푘] = 푍−1{퐻(푧)} 퐻(푧) First, perform partial fraction expansion on (say, using Mathcad): 푧 z 5 5 3 2 convert parfrac z z(z 2) (z 3) 6z 2(z 2) 3(z 3) Next, multiply by z and use the table of Z-transforms to find the inverse Z- transform: 3 2 5 푧 푧 퐻(푧) = − + 2 − 3 6 푧 − 2 푧 − 3 5 3 2 ℎ[푘] = − 훿[푘] + (2)푘푢[푘] − (3)푘푢[푘] 6 2 3 The zero-state response 푦푧푠[푘] may now be obtained using convolution sums, 푦푧푠[푘] = ℎ[푘] ∗ 푓[푘] , where 푓[푘] = 3푘푢[푘] + 5푢[푘] [Your turn: Employ the Convolution Table for discrete-time signals, Page 590, to solve for 푦푧푠[푘]. Refer to the last section (last three slides of this lecture) for an example.] Alternatively, we may use the inverse Z-transform to obtain 푦푧푠[푘] as follows, −1 −1 푦푧푠[푘] = 푍 {푌푧푠(푧)} = 푍 {퐻(푧)퐹(푧)} 푧 − 5 푧(5푧 − 2) 푦 [푘] = 푍−1 { } 푧푠 (푧 − 2)(푧 − 3) (푧 − 1)2 where the following transform pair was used to obtain 퐹(푧), 3푧 5푧 푧(5푧 − 2) 푓[푘] = (3푘 + 5)푢[푘] ↔ 퐹(푧) = + = (푧 − 1)2 푧 − 1 (푧 − 1)2 푌 (푧) Your turn: Apply partial fraction expansion to 푧푠 , multiply the result 푧 by 푧, then employ the Z-transform Table to obtain the following result, 35 13 푦 [푘] = (− − 6푘 − (3)푘 + 24(2)푘) 푢[푘] 푧푠 2 2 Next, we solve for the zero-input response, 푦푧[푘].
Load more

Recommended publications
  • Closed Loop Transfer Function
    Lecture 4 Transfer Function and Block Diagram Approach to Modeling Dynamic Systems System Analysis Spring 2015 1 The Concept of Transfer Function Consider the linear time-invariant system defined by the following differential equation : ()nn ( 1) ay01 ay ann 1 y ay ()mm ( 1) bu01 bu bmm 1 u b u() n m Where y is the output of the system, and x is the input. And the Laplace transform of the equation is, nn1 ()()aS01 aS ann 1 S a Y s mm1 ()()bS01 bS bmm 1 S b U s System Analysis Spring 2015 2 The Concept of Transfer Function The ratio of the Laplace transform of the output (response function) to the Laplace Transform of the input (driving function) under the assumption that all initial conditions are Zero. mm1 Ys() bS01 bS bmm 1 S b Transfer Function G() s nn1 Us() aS01 aS ann 1 S a Ps() ()nm Qs() System Analysis Spring 2015 3 Comments on Transfer Function 1. A mathematical model. 2. Property of system itself. - Independent of the input function and initial condition - Denominator of the transfer function is the characteristic polynomial, - TF tells us something about the intrinsic behavior of the model. 3. ODE equivalence - TF is equivalent to the ODE. We can reconstruct ODE from TF. 4. One TF for one input-output pair. : Single Input Single Output system. - If multiple inputs affect Obtain TF for each input x 6207()3()xx f t g t -If multiple outputs xxy 32 yy xut 3() System Analysis Spring 2015 4 Comments on Transfer Function 5.
    [Show full text]
  • Digital Signal Processing Module 3 Z-Transforms Objective
    Digital Signal Processing Module 3 Z-Transforms Objective: 1. To have a review of z-transforms. 2. Solving LCCDE using Z-transforms. Introduction: The z-transform is a useful tool in the analysis of discrete-time signals and systems and is the discrete-time counterpart of the Laplace transform for continuous-time signals and systems. The z-transform may be used to solve constant coefficient difference equations, evaluate the response of a linear time-invariant system to a given input, and design linear filters. Description: Review of z-Transforms Bilateral z-Transform Consider applying a complex exponential input x(n)=zn to an LTI system with impulse response h(n). The system output is given by ∞ ∞ 푦 푛 = ℎ 푛 ∗ 푥 푛 = ℎ 푘 푥 푛 − 푘 = ℎ 푘 푧 푛−푘 푘=−∞ 푘=−∞ ∞ = 푧푛 ℎ 푘 푧−푘 = 푧푛 퐻(푧) 푘=−∞ ∞ −푘 ∞ −푛 Where 퐻 푧 = 푘=−∞ ℎ 푘 푧 or equivalently 퐻 푧 = 푛=−∞ ℎ 푛 푧 H(z) is known as the transfer function of the LTI system. We know that a signal for which the system output is a constant times, the input is referred to as an eigen function of the system and the amplitude factor is referred to as the system’s eigen value. Hence, we identify zn as an eigen function of the LTI system and H(z) is referred to as the Bilateral z-transform or simply z-transform of the impulse response h(n). 푍 The transform relationship between x(n) and X(z) is in general indicated as 푥 푛 푋(푧) Existence of z Transform In general, ∞ 푋 푧 = 푥 푛 푧−푛 푛=−∞ The ROC consists of those values of ‘z’ (i.e., those points in the z-plane) for which X(z) converges i.e., value of z for which ∞ −푛 푥 푛 푧 < ∞ 푛=−∞ 푗휔 Since 푧 = 푟푒 the condition for existence is ∞ −푛 −푗휔푛 푥 푛 푟 푒 < ∞ 푛=−∞ −푗휔푛 Since 푒 = 1 ∞ −푛 Therefore, the condition for which z-transform exists and converges is 푛=−∞ 푥 푛 푟 < ∞ Thus, ROC of the z transform of an x(n) consists of all values of z for which 푥 푛 푟−푛 is absolutely summable.
    [Show full text]
  • Modeling and Analysis of DC Microgrids As Stochastic Hybrid Systems Jacob A
    1 Modeling and Analysis of DC Microgrids as Stochastic Hybrid Systems Jacob A. Mueller, Member, IEEE and Jonathan W. Kimball, Senior Member, IEEE Abstract—This study proposes a method of predicting the influences is not necessary. Stability analyses, for example, influence of random load behavior on the dynamics of dc rarely include stochastic behavior. A typical approach to small- microgrids and distribution systems. This is accomplished by signal stability is to identify a steady-state operating point for combining stochastic load models and deterministic microgrid models. Together, these elements constitute a stochastic hybrid a deterministic loading condition, linearize a system model system. The resulting model enables straightforward calculation around that operating point, and inspect the locations of the of dynamic state moments, which are used to assess the proba- linearized model’s eigenvalues [5]. The analysis relies on an bility of desirable operating conditions. Specific consideration is approximation of loads as deterministic and constant in time, given to systems based on the dual active bridge (DAB) topology. and while real-world loads fit neither of these conditions, this Bounds are derived for the probability of zero voltage switching (ZVS) in DAB converters. A simple example is presented to approach is an effective tool for evaluating the stability of both demonstrate how these bounds may be used to improve ZVS microgrids and bulk power systems. performance as an optimization problem. Predictions of state However, deterministic models are unable to provide in- moment dynamics and ZVS probability assessments are verified sights into the performance and reliability of a system over through comparisons to Monte Carlo simulations.
    [Show full text]
  • Performance of Feedback Control Systems
    Performance of Feedback Control Systems 13.1 □ INTRODUCTION As we have learned, feedback control has some very good features and can be applied to many processes using control algorithms like the PID controller. We certainly anticipate that a process with feedback control will perform better than one without feedback control, but how well do feedback systems perform? There are both theoretical and practical reasons for investigating control performance at this point in the book. First, engineers should be able to predict the performance of control systems to ensure that all essential objectives, especially safety but also product quality and profitability, are satisfied. Second, performance estimates can be used to evaluate potential investments associated with control. Only those con trol strategies or process changes that provide sufficient benefits beyond their costs, as predicted by quantitative calculations, should be implemented. Third, an engi neer should have a clear understanding of how key aspects of process design and control algorithms contribute to good (or poor) performance. This understanding will be helpful in designing process equipment, selecting operating conditions, and choosing control algorithms. Finally, after understanding the strengths and weak nesses of feedback control, it will be possible to enhance the control approaches introduced to this point in the book to achieve even better performance. In fact, Part IV of this book presents enhancements that overcome some of the limitations covered in this chapter. Two quantitative methods for evaluating closed-loop control performance are presented in this chapter. The first is frequency response, which determines the 410 response of important variables in the control system to sine forcing of either the disturbance or the set point.
    [Show full text]
  • Control System Transfer Function Examples
    Control System Transfer Function Examples translucentlyAutoradiograph or fusing.Arne contradistinguishes If air or unreactive orPrasad gawps usually some oversimplifyinginchoations propitiously, his baddies however rices anteriorly filmed Gary or restaffsabjuring medically moronically!and penuriously, how naissant is Angelico? Dendritic Frederic sometimes eats his rationing insinuatingly and values so Dc motor is subtracted from the procedure for the total heat is transfer system function provides us to determine these systems is already linear fractional tranformation, under certain point The system controls class of characteristic polynomial form. Models start with regular time. We apply a linear property as an aberrated, as stated below illustrates a timer which means comprehensive, it constant being zero lies in transfer matrix. There find one other thing to notice immediately the system: it is often the necessary to missing all seek the transfer functions directly. If any pole itself a positive real part, typically only one cannot ever calculated, and as can be inner the motor command stays within appropriate limits. The transfer functions. The system model output voltage over a model to take note that circuit via mesh analysis and define its output. Each term like, plc tutorials and background data science graduate. Otherwise, excel also by what number of pixels, capacitor and inductor. The window dead sec. Make this form for gain of signal voltage source changes to transfer function and therefore, all sources and how to meet our design. Be simultaneous to boil switch settings before installation Be sure which set the rotary address switches to advise proper addresses before installing the system. Then it gets hot water level of evaluation in feedback configuration not point is important in series, also great simplification occurs when you.
    [Show full text]
  • Digital Signal Processing Zahir M
    Digital Signal Processing Zahir M. Hussain Á Amin Z. Sadik Á Peter O’Shea Digital Signal Processing An Introduction with MATLAB and Applications 123 Prof. Zahir M. Hussain Peter O’Shea School of Electrical and Computer School of Engineering Systems Engineering QUT RMIT University Gardens Point Campus Latrobe Street 124, Melbourne Brisbane 4001 VIC 3000 Australia Australia e-mail: [email protected] e-mail: [email protected] Amin Z. Sadik RMIT University Monash Street 19 Lalor, Melbourne VIC 3075 Australia e-mail: [email protected] ISBN 978-3-642-15590-1 e-ISBN 978-3-642-15591-8 DOI 10.1007/978-3-642-15591-8 Springer Heidelberg Dordrecht London New York Ó Springer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the right of translation, reprinting, reuse of illustrations, recitation, broad- casting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: eStudio Calamar S.L. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) This book is dedicated to our loving families.
    [Show full text]
  • Signals and Systems: Introduction
    Signals and Systems: Introduction Prof. Miguel A. Muriel Siggynals and Systems: Introduction 1- Introduction to Signals and Systems 2- Continuous-Time Signals 3- Discrete-Time Signals 4- Description of Systems 5- Time-Domain System Analysis 6- Spectral Method 7- Fourier Transform 8- Sampling 9- Discrete Fourier Transform (DFT) Miguel A. Muriel - Signals and Systems: Introduction - 2 1- Introduction to Siggynals and Systems Miguel A. Muriel - Signals and Systems: Introduction - 3 Introduction -A signal is any physical phenomenon which conveys ifinformati on. -Systems respondilddd to signals and produce new si ilgnals. -Excitation signals are applied at system inputs and response signals are produced at system outputs. Miguel A. Muriel - Signals and Systems: Introduction - 4 Siggypnal types Continuous-Time Discrete-Time x(t) Continuous-Value x[n] Continuous-Value Signal Signal t n Continuous-Time Continuous-Time x(t) Discrete-Value Discrete-Value Signal x(t) Signal t t Digital Signal Continuous-Time CtiContinuous-VlValue x(t) Random Signal x(t) Noisy Digital Signal t t Miguel A. Muriel - Signals and Systems: Introduction - 5 Conversions Between Signal Types Miguel A. Muriel - Signals and Systems: Introduction - 6 Syypstem example -A communication system has an information signal plus noise signals. Miguel A. Muriel - Signals and Systems: Introduction - 7 Vo ice Signal Miguel A. Muriel - Signals and Systems: Introduction - 8 (a) 32 ms (b) 256 samples (a) Segment of a continuous-time speech signal x(t). (b) Sequence of samples x[][n]=x(nT) obta ined from the silignal in part ()(a) with T =125 μs. Miguel A. Muriel - Signals and Systems: Introduction - 9 2- Continuous-Time Signals Miguel A.
    [Show full text]
  • Linear Systems 2 2 Linear Systems
    2 LINEAR SYSTEMS 2 2 LINEAR SYSTEMS We will discuss what we mean by a linear time-invariant system, and then consider several useful transforms. 2.1 De¯nition of a System In short, a system is any process or entity that has one or more well-defined inputs and one or more well-defined outputs. Examples of systems include a simple physical object obeying Newtonian mechanics, and the US economy! Systems can be physical, or we may talk about a mathematical description of a system. The point of modeling is to capture in a mathematical representation the behavior of a physical system. As we will see, such representation lends itself to analysis and design, and certain restrictions such as linearity and time-invariance open a huge set of available tools. We often use a block diagram form to describe systems, and in particular their interconnec­ tions: input u(t) output y(t) System F input u(t) output y(t) System F System G In the second case shown, y(t) = G[F [u(t)]]. Looking at structure now and starting with the most abstracted and general case, we may write a system as a function relating the input to the output; as written these are both functions of time: y(t) = F [u(t)] The system captured in F can be a multiplication by some constant factor - an example of a static system, or a hopelessly complex set of differential equations - an example of a dynamic system. If we are talking about a dynamical system, then by definition the mapping from u(t) to y(t) is such that the current value of the output y(t) depends on the past history of u(t).
    [Show full text]
  • Appendix 1 Linear Systems Analysis
    Appendix 1 Linear Systems Analysis LINEAR SYSTEMS AND FILTER A linear system is given by the following relation: y(t) = f: h(t, 'O)x(r) d'O (A1-1) where x(t) is called the input, h(t, '0) the system impulse response function at t = '0, y(t) the output signal. If the system is time invariant, the output signal of the linear system is given by y(t) = f:oo h(t - 'O)x('O)d'O (A1-2) h(t) is called the impulse response. Because if the input is an impulse, then the output y(t) = f:oo h(t - '0)15('0) d'O = h(t) (A1-3) For a time invariant linear system, when the input is x(t - to), then the output is y(t - to), where to is the delay. The system is called causal if h(t) = 0, t<O (A 1-4) This means there is no response prior to the input. The system is called stable if bounded input produces a bounded output. This requires that the impulse function satisfies (A1-5) The time invariant system satisfies the linearity condition: If i = 1,2 549 550 APPENDIX 1 then (Al-6) where at and a2 are constants. Note that the output of a causal time invariant system is given by yet) = r", h(t - r)x(r) dr ~ h(t) ® x(t), (Al-7) convolution of x(t) with h(t). Taking the Fourier transform of the both sides of (Al-7), when they exist, we get Y(f) = H(f)X(f) (Al-8) where i2 j X(f) = 9"(x(t)) = J:", x(t)e- 7[ t dt i2 j H(f) = 9"(h(t)) = J:", h(t)e- 7[ t dt i2 j Y(f) = 9"(y(t)) = L"'", y(t)e- 7[ t dt Y(f), H(f), and X(f) are called the output, system, and input transfer func­ tion.
    [Show full text]
  • Discrete-Time System Analysis Using the Z-Transform
    Discrete-Time System Analysis Using the Z-Transform The counterpart of the Laplace transform for discrete-time systems is the z­ transform. The Laplace transform converts integra-differential equations into alge­ braic equations. In the same way, the z-transforms changes difference equations into algebraic equations, thereby simplifying the analysis of discrete-time systems. The z-transform method of analysis of discrete-time systems parallels the Laplace trans­ form method of analysis of continuous-time systems, with some minor differences. In fact, we shall see that the z-transform is the Laplace transform in disguise. The behavior of discrete-time systems (with some differences) is similar to that of continuous-time systems. The frequency-domain analysis of discrete-time systems is based on the fact (praved in Sec. 9.4-2) that the response of a linear time-invariant discrete-time (LTID) system to an everlasting exponential zk is also the same exponential (within a multiplicative constant), given by H[z]zk. We then express an input f [k] as a sum of (everlasting) exponentials of the form zk. The system response to f[k] is then found as a sum of the system's responses to all these exponential components. The tool which allows us to represent an arbitrary input f[k] as a sum of (everlasting) exponentials of the form zk is the z-transform. 11.1 The Z-Transform In the last Chapter, we extended the discrete-time Fourier transform to derive the pair of equations defining the z-transform as 00 F[z] == L f[k]z-k (11.1) k=-oo t[k] = ~ f F[z]zk-l dz (11.2) 27rJ 668 11.1 The Z-Transform 669 where the symbol f indicates an integration in counterclockwise direction around a closed path in the complex plane (see Fig.
    [Show full text]
  • On the Control of Stochastic Systems
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 83, 611-621 (1981) On the Control of Stochastic Systems G. ADOMIAN Center for Applied Mathematics, University of Georgia, Athens, Georgia 30602 AND L. H. SIBUL Applied Research Lab, Pennsylvania State University, University Park, Pennsylvania 16802 A general model is available for analysis of control systems involving stochastic time varying parameters in the system to be controlled by the use of the “iterative” method of the authors or its more recent adaptations for stochastic operator equations. It is shown that the statistical separability which is achieved as a result of the method for stochastic operator equations is unaffected by the matrix multiplications in state space equations; the method, therefore, is applicable to the control problem. Application is made to the state space equation i = Ax + Bu + C, where A, B. C are stochastic matrices corresponding to stochastic operators, i.e., involving randomly time varying elements, e.g., aij(t, w) E A, t E T, w E (f2, F,p), a p.s. It is emphasized that the processes are arbitrary stochatic processes with known statistics. No assumption is made of Wiener or Markov behavior or of smallness of fluctuations and no closure approximations are necessary. The method differs in interesting aspects from Volterra series expansions used by Wiener and others and has advantages over the other methods. Because of recent progress in the solution of the nonlinear case, it may be possible to generalize the results above to the nonlinear case as well but the linear case is suffcient to show the connections and essential point of separability of ensemble averages.
    [Show full text]
  • A Basics of Modeling and Control-Systems Theory
    A Basics of Modeling and Control-Systems Theory This appendix collects some of the most important definitions and results of the theory of system modeling and control systems analysis and design. To avoid using any complex mathematical formulations, all systems are assumed to have only one input and one output. This appendix is not intended to serve as a self-contained course on con- trol systems analysis and design (this would require much more space). Rather, it is intended to synchronize notation and to recall some points that are used repeatedly throughout the main text. Readers who have never had the oppor- tunity to study these subjects are referred to the many standard text books available, some of which are listed at the end of this chapter. A.1 Modeling of Dynamic Systems General Remarks This section recalls briefly the most important ideas in system modeling for control. In general, two classes of models can be identified: 1. models based purely on (many) experiments; and 2. models based on physical first principles and (a few) parameter identifi- cation experiments. In this text, only the second class of models is discussed. General guidelines to formulate such a control-oriented model encompass the following six steps at least: 1. Identify the system boundaries (what inputs, what outputs, etc.). 2. Identify the relevant reservoirs (mass, energy, information, . ) and the corresponding level variables. 3. Formulate the differential equations for all relevant reservoirs as shown in eq. (A.1). 262 A Basics of Modeling and Control-Systems Theory d (reservoir content) = inflows outflows (A.1) dt − X X 4.
    [Show full text]