Signals & Systems Predicting System Performance February 27, 2013.

Slides:



Advertisements
Similar presentations
Signals & Systems Predicting System Performance February 27, 2013.
Advertisements

Roots & Zeros of Polynomials I
Signals and Systems March 25, Summary thus far: software engineering Focused on abstraction and modularity in software engineering. Topics: procedures,
Properties of State Variables
ELEN 5346/4304 DSP and Filter Design Fall Lecture 7: Z-transform Instructor: Dr. Gleb V. Tcheslavski Contact:
AMI 4622 Digital Signal Processing
Chapter 7 Laplace Transforms. Applications of Laplace Transform notes Easier than solving differential equations –Used to describe system behavior –We.
EECS 20 Chapter 12 Part 11 Stability and Z Transforms Last time we Explored sampling and reconstruction of signals Saw examples of the phenomenon known.
EE-2027 SaS, L13 1/13 Lecture 13: Inverse Laplace Transform 5 Laplace transform (3 lectures): Laplace transform as Fourier transform with convergence factor.
Laplace Transforms 1. Standard notation in dynamics and control (shorthand notation) 2. Converts mathematics to algebraic operations 3. Advantageous for.
Z-Transform Fourier Transform z-transform. Z-transform operator: The z-transform operator is seen to transform the sequence x[n] into the function X{z},
Review last lectures.
EC 2314 Digital Signal Processing By Dr. K. Udhayakumar.
THE LAPLACE TRANSFORM LEARNING GOALS Definition The transform maps a function of time into a function of a complex variable Two important singularity functions.
Module 2: Representing Process and Disturbance Dynamics Using Discrete Time Transfer Functions.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Stability and the s-Plane Stability of an RC Circuit 1 st and 2 nd.
Signals and Systems March 25, Summary thus far: software engineering Focused on abstraction and modularity in software engineering. Topics: procedures,
Chapter 9 Sequences and Series The Fibonacci sequence is a series of integers mentioned in a book by Leonardo of Pisa (Fibonacci) in 1202 as the answer.
Calculus and Analytic Geometry II Cloud County Community College Spring, 2011 Instructor: Timothy L. Warkentin.
The z-Transform Prof. Siripong Potisuk. LTI System description Previous basis function: unit sample or DT impulse  The input sequence is represented.
CE Digital Signal Processing Fall 1992 Z Transform
Chapter 1 Infinite Series, Power Series
1 ENGG 1015 Tutorial Op Amps and Signals 19 Nov Learning Objectives  Analyze circuits with operational amplifiers  Convert between representations of.
9.9 The Fundamental Theorem of Algebra
Copyright © 2001, S. K. Mitra Digital Filter Structures The convolution sum description of an LTI discrete-time system be used, can in principle, to implement.
Zeros of Polynomial Functions Section 2.5 Page 312.
Laplace Transforms 1. Standard notation in dynamics and control (shorthand notation) 2. Converts mathematics to algebraic operations 3. Advantageous for.
1 1 Chapter 3 The z-Transform 2 2  Consider a sequence x[n] = u[n]. Its Fourier transform does not converge.  Consider that, instead of e j , we use.
Laplace Transforms 1. Standard notation in dynamics and control (shorthand notation) 2. Converts mathematics to algebraic operations 3. Advantageous for.
1 Z-Transform. CHAPTER 5 School of Electrical System Engineering, UniMAP School of Electrical System Engineering, UniMAP NORSHAFINASH BT SAUDIN
Chapter 4 Transfer Function and Block Diagram Operations § 4.1 Linear Time-Invariant Systems § 4.2 Transfer Function and Dynamic Systems § 4.3 Transfer.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Z TRANSFORM AND DFT Z Transform
THE LAPLACE TRANSFORM LEARNING GOALS Definition
Zeros of Polynomials 2.5.
1 ENGG 1015 Tutorial Systems, Control and Computer Arithmetic 11 Dec Learning Objectives  Analyse systems and control systems  Interpret computer arithmetic.
Chapter 3 Dynamic Response The Block Diagram Block diagram is a graphical tool to visualize the model of a system and evaluate the mathematical relationships.
ES97H Biomedical Signal Processing
Lecture 12: First-Order Systems
Digital Signal Processing
Subsea Control and Communications Systems
Signal and Systems Prof. H. Sameti Chapter 10: Introduction to the z-Transform Properties of the ROC of the z-Transform Inverse z-Transform Examples Properties.
Lec 6. Second Order Systems
Lec 7. Higher Order Systems, Stability, and Routh Stability Criteria Higher order systems Stability Routh Stability Criterion Reading: 5-4; 5-5, 5.6 (skip.
Chapter 7 The Laplace Transform
Lecture 7 Poles and Zeros Stability. Transfer Function Models General Representation wh where z i are the zeros p i are the poles n ≥ m to have a physically.
Structures for Discrete-Time Systems
Digital Filter Structures
Z Transform The z-transform of a digital signal x[n] is defined as:
Chapter 3 Polynomial and Rational Functions Copyright © 2014, 2010, 2007 Pearson Education, Inc Zeros of Polynomial Functions.
Sampling and Reconstruction The impulse response of an continuous-time ideal low pass filter is the inverse continuous Fourier transform of its frequency.
MTH253 Calculus III Chapter 11, Part I (sections 11.1 – 11.6) Sequences Series Convergence Tests.
1 Time Response. CHAPTER Poles and Zeros and System Response. Figure 3.1: (a) System showing input and output; (b) Pole-zero plot of the system;
Dr. Tamer Samy Gaafar Lec. 2 Transfer Functions & Block Diagrams.
DYNAMIC BEHAVIOR OF PROCESSES :
Lecture 7/8 Analysis in the time domain (II) North China Electric Power University Sun Hairong.
Application of digital filter in engineering
Laplace Transforms Chapter 3 Standard notation in dynamics and control
Chap2. Modeling in the Frequency Domain
Chapter 4 Transfer Function and Block Diagram Operations
Created by Mr. Lafferty Maths Dept.
Joseph L. Hellerstein IBM Thomas J Watson Research Center, NY
Chapter 1 Infinite Series, Power Series
لجنة الهندسة الكهربائية
Research Methods in Acoustics Lecture 9: Laplace Transform and z-Transform Jonas Braasch.
Chapter 3 Example 2: system at rest (s.s.)
Solution of ODEs by Laplace Transforms
Time Response, Stability, and
Presentation transcript:

Signals & Systems Predicting System Performance February 27, 2013

Outline System functions: primitives and compositions Modes of feedback systems Finding and interpreting poles Reading: Chapter 5.5 – 5.7 of Digital World Notes

Performance analysis We can quantify the performance of a system by characterizing the signals that the system generates.

Analyzing systems Our goal is to develop representations for systems that facilitate analysis. Examples: Does the output signal overshoot? If so, how much? How long does it take for the output signal to reach its final value?

System functions Any LTI system is completely characterized by the relationship between the input signal X and the output signal Y. We call this relationship, the system function. It is independent of any particular input signal, just as a mathematical function or a Python procedure is an entity, independent of its arguments. System functions for LTI systems are always ratios of polynomials in R.

System functions for LTI systems Ratio of polynomials in R: Persistent part of response of such a system is associated with de- nominator.

System functions: Why do we care PCAP system on system functions makes it easier to combine models than manipulating systems of operator equations. System functions expose important analytic properties of the system.

PCAP: Primitive SFs

Combining SFs: Sum The system function of the sum of two systems is the sum of their system functions.

Combining SFs: Cascade The system function of the cascade of two systems is the product of their system functions.

Combining SFs: Negative feedback Concentrate on negative feedback and Black's formula:

Wall finder Control the robot to move to desired distance from a wall.

Use composition to find SF

Wall finder The behavior of the system depends critically on KT.

Predicting properties of system behavior Consider how the system behaves given input signals with different properties: Unit sample (this lecture) Transient : finitely many non-zero samples Bounded : exist values u, l such that l < x[n] < u for all n Understanding unit-sample response is the basis for understanding response to more complex signals. We can predict system behavior (slowly) by simulating any system. We can quickly predict long-term behavior of the unit-sample response based on the denominator of the system function.

Feed-forward systems Output has no dependence on previous outputs Unit-sample response is finite sum of scaled, delayed unit-samples Unit-sample response is transient: finitely many non-zero values

Feedback systems: First-order case

Feedback

Feedback: Cyclic signal flow paths Feedback implies cyclic signal flow paths.

Feedback: Cyclic signal flow paths Feedback implies cyclic signal flow paths.

Feedback: Cyclic signal flow paths Feedback implies cyclic signal flow paths. All cyclic paths must contain at least one delay.

Unit sample response: Geometric growth If traversing the cycle decreases or increases the magnitude of the signal, then the output will decay or grow, respectively.

Unit sample response: Geometric growth These system responses can be characterized by a single number (the pole), which is the base of the geometric sequence.

Cohort Question 1

Geometric growth

Second-order systems The unit-sample response of more complicated cyclic systems is more complicated.

Second-order systems The unit-sample response of more complicated cyclic systems is more complicated. Not geometric. This response grows then decays.

Second-order systems: Additive decomposition This system function can be written as a sum of simpler parts.

Additive decomposition: partial fraction expansion

Second-order systems: Additive decomposition

Sum of geometric sequences Mode with biggest base eventually governs behavior

More dramatically

Analysis of more complicated systems Rational polynomials can be realized with block diagrams of the following form:

Analysis of more complicated systems Modes can be identified by expanding system functional in partial fractions.

Analysis of more complicated systems Modal decomposition provides an alternative block diagram. The upper part is cyclic; the lower part is acyclic.

Easy way to find poles

Complex Roots What if a root has a non-zero imaginary part? Factor theorem: express a polynomial as a product of factors, with one factor associated with each root of the polynomial. Fundamental theorem of algebra: a polynomial of order n has n roots. The roots can have imaginary parts. How does a mode from a complex root behave?

Complex Poles Difference equations that represent physical systems (e.g., population growth, bank accounts, etc.) have real-valued coefficients. Difference equations with real-valued coefficients generate real-valued outputs from real-valued inputs. But they might still have complex poles.

Representing complex numbers

Complex Poles

Convergence and Divergence

Complex Roots Self Reading: Complex Conjugate Root Theorem:

Complex Roots If we pair the factors corresponding to complex-conjugate roots, the resulting polynomial has real-valued coefficients.

Complex modes, Real results

Cohort Question 2

Cohort Question 3

Poles and convergence The dominant pole is the pole with the largest magnitude. If the dominant pole has magnitude > 1, then in response to a bounded input, the output signal will be unbounded. If the dominant pole has magnitude < 1, then in response to a bounded input, the output signal will be bounded; in response to a transient input, the output signal will converge to 0. If the dominant pole has magnitude 1, then in response to a bounded input, the output signal will be bounded; in response to a transient input, it will converge to some constant value.

Poles and periodicity The dominant pole is the pole p = a + bj with the largest magnitude. Assume that |p| is not 1 or 0 and Y = Hδ, there exists a time t such that: If b = 0, a > 0, y[n] is monotonically decreasing or increasing. If b = 0, a < 0, y[n] is alternating signs. Otherwise, oscillating

This Week Readings: Chapter of Digital World Notes (mandatory!) Cohort Exercises & Homework: Practice on LTI systems (note the due dates & times) Lab: Analyzing robot control system for stability