EECS 20 Chapter 5 Part 21 Linear Infinite State Systems Last time we Looked at systems with an infinite number of states (Reals N ) Examined property of.

Slides:



Advertisements
Similar presentations
Discrete-Time Linear Time-Invariant Systems Sections
Advertisements

Review of Frequency Domain
Lowpass Filter and Highpass Filter 指導老師 : 黃貞瑛老師 報 告 : 林 文 彬.
Week Real time state machines 2.LTI systems– the [A,B,C,D] representation 3.Differential equation-approximation by discrete- time system 4.Response–
MM3FC Mathematical Modeling 3 LECTURE 3
Lecture 4: Linear Systems and Convolution
EECS 20 Chapter 5 Part 11 Linear Infinite State Systems Last time we Looked at state machines with feedback Considered state machines with constant or.
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
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.
EECS 20 Chapter 8 Part 21 Frequency Response Last time we Revisited formal definitions of linearity and time-invariance Found an eigenfunction for linear.
MM3FC Mathematical Modeling 3 LECTURE 6 Times Weeks 7,8 & 9. Lectures : Mon,Tues,Wed 10-11am, Rm.1439 Tutorials : Thurs, 10am, Rm. ULT. Clinics : Fri,
Week 10. Chapter 9 1.Convolution sum & integral 1.Kronecker delta and Dirac delta 2.Impulse response and convolution 2.Impulse response & frequency response.
EECS 20 Chapter 10 Part 11 Sampling and Reconstruction Last time we Viewed aperiodic functions in terms of frequency components via Fourier transform Gained.
MM3FC Mathematical Modeling 3 LECTURE 2 Times Weeks 7,8 & 9. Lectures : Mon,Tues,Wed 10-11am, Rm.1439 Tutorials : Thurs, 10am, Rm. ULT. Clinics : Fri,
EE-2027 SaS, L11 1/13 Lecture 11: Discrete Fourier Transform 4 Sampling Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
EECS 20 Chapter 9 Part 21 Convolution, Impulse Response, Filters In Chapter 5 we Had our first look at LTI systems Considered discrete-time systems, some.
Lecture 6: Linear Systems and Convolution
Signals and Systems Lecture #5
EECS 20 Chapter 9 Part 21 Convolution, Impulse Response, Filters Last time we Revisited the impulse function and impulse response Defined the impulse (Dirac.
Image (and Video) Coding and Processing Lecture 2: Basic Filtering Wade Trappe.
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
Difference Equations and Stability Linear Systems and Signals Lecture 10 Spring 2008.
Discrete-time Systems Prof. Siripong Potisuk. Input-output Description A DT system transforms DT inputs into DT outputs.
Analysis of Discrete Linear Time Invariant Systems
Digital Signals and Systems
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Discrete-Time and System (A Review)
1 Signals & Systems Spring 2009 Week 3 Instructor: Mariam Shafqat UET Taxila.
Chapter 2: Discrete time signals and systems
Time Domain Representation of Linear Time Invariant (LTI).
Discrete-time Systems Prof. Siripong Potisuk. Input-output Description A DT system transforms DT inputs into DT outputs.
BYST CPE200 - W2003: LTI System 79 CPE200 Signals and Systems Chapter 2: Linear Time-Invariant Systems.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Department of Electrical and Computer Engineering Brian M. McCarthy Department of Electrical & Computer Engineering Villanova University ECE8231 Digital.
Linear Time-Invariant Systems Quote of the Day The longer mathematics lives the more abstract – and therefore, possibly also the more practical – it becomes.
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
CHAPTER 2 Discrete-Time Signals and Systems in the Time-Domain
Signal & Linear system Chapter 3 Time Domain Analysis of DT System Basil Hamed.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Neural Networks Laboratory Slide 1 DISCRETE SIGNALS AND SYSTEMS.
EE313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian L. Evans Dept. of Electrical.
Signals and Systems Lecture 19: FIR Filters. 2 Today's lecture −System Properties:  Linearity  Time-invariance −How to convolve the signals −LTI Systems.
Signals and Systems Analysis NET 351 Instructor: Dr. Amer El-Khairy د. عامر الخيري.
Signals and Systems Lecture #6 EE3010_Lecture6Al-Dhaifallah_Term3321.
Digital Signal Processing Topic 2: Time domain
3/18/20161 Linear Time Invariant Systems Definitions A linear system may be defined as one which obeys the Principle of Superposition, which may be stated.
Generalized Linear Phase Quote of the Day The mathematical sciences particularly exhibit order, symmetry, and limitation; and these are the greatest forms.
Analysis of Linear Time Invariant (LTI) Systems
1 Computing the output response of LTI Systems. By breaking or decomposing and representing the input signal to the LTI system into terms of a linear combination.
Chapter 2 System Models – Time Domain
Prepared by:D K Rout DSP-Chapter 2 Prepared by  Deepak Kumar Rout.
In summary If x[n] is a finite-length sequence (n  0 only when |n|
DSP First, 2/e Lecture 11 FIR Filtering Intro. May 2016 © , JH McClellan & RW Schafer 2 License Info for DSPFirst Slides  This work released.
EENG 420 Digital Signal Processing Lecture 2.
Discrete Time Signal Processing Chu-Song Chen (陳祝嵩) Institute of Information Science Academia Sinica 中央研究院 資訊科學研究所.
Review of DSP.
Signal Processing First
Lecture 11 FIR Filtering Intro
Discrete-time Systems
Linear Time Invariant Systems
Laplace and Z transforms
Lecture 4: Discrete-Time Systems
UNIT V Linear Time Invariant Discrete-Time Systems
Signal and Systems Chapter 2: LTI Systems
Digital Signal Processing
Signal Processing First
Lecture 22 IIR Filters: Feedback and H(z)
Concept of frequency in Discrete Signals & Introduction to LTI Systems
Lecture 4: Linear Systems and Convolution
Review of DSP.
Presentation transcript:

EECS 20 Chapter 5 Part 21 Linear Infinite State Systems Last time we Looked at systems with an infinite number of states (Reals N ) Examined property of linearity Formulated (A, B, C, D) system definition Derived equation to calculate state response Today we will Characterize linear discrete-time systems by their impulse response Formulate zero-input output response using impulse response Compute impulse response for example systems See examples of FIR and IIR systems

EECS 20 Chapter 5 Part 22 Zero-State and Zero-Input Responses Last time, we came up with equations that give us s(n) and y(n): s(n) = A n s(0) + Σ A n-1-m B x(m) y(n) = C A n s(0) + Σ C A n-1-m B x(m) + D x(n) We gave names to the terms in these equations: Zero-input state response:A n s(0) Zero-input output response:C A n s(0) Zero-state state response: Σ A n-1-m B x(m) Zero-state output response: Σ C A n-1-m B x(m) + D x(n) m=0 n-1 m=0 n-1 m=0 n-1 m=0 n-1

EECS 20 Chapter 5 Part 23 Impulse Function The general system response can also be described by its response to a particular input signal called the impulse:  : Integers  {0, 1} "n  Integers,  (n) = This function is also known as the Kronecker Delta function. 1if n = 0 0if n ≠ 0 {

EECS 20 Chapter 5 Part 24 Impulse Response When we apply the impulse function  as the input x to a SISO system with an initial state of zero, we denote the resulting output y by h. This special output, h, is called the impulse response. Using the formula for the zero-state output response, y(n) = Σ C A n-1-m B x(m) + D x(n) We see that when the  function is substituted for x, m=0 n-1 h(0) = Dh(1) = CBh(2) = CABh(3) = CA 2 B h(n) = CA n-1 B for n > 0h(0) = Dh(n) = 0 for n < 0

EECS 20 Chapter 5 Part 25 General Response Using Impulse Response Looking again at the zero-state output response, y(n) = Σ C A n-1-m B x(m) + D x(n) we see that we can write a general output y(n) using the impulse response h: y(n) = Σ h(n-m) x(m) + h(0) x(n) = Σ h(n-m) x(m) m=0 n-1 m=0 n n-1 Since h(n) = 0 for n < 0, y(n) = Σ h(n-m) x(m) m=-∞ ∞

EECS 20 Chapter 5 Part 26 Convolution This operation being performed on h and x is called convolution, and it is denoted by  y(n) = Σ h(n-m) x(m)  y = h  x The convolution operation is commutative: h  x = x  h Σ h(n-m) x(m) = Σ h(k) x(n-k) The convolution operation has useful properties in the frequency domain, covered in later chapters. That is one of the reasons we use the impulse response characterization. m=-∞ ∞ ∞ k=-∞ ∞

EECS 20 Chapter 5 Part 27 Example: FIR Consider the 7-day moving average: y(n) = 1/7 Σ x(n-k) Find the impulse response. h(n) = 1/7 Σ  (n-k) The  (n-k) will equal 1 for k = n, 0 otherwise. We can have k = n for n between 0 and 6. h(n) = 1/7 for 0 ≤ n ≤ 6h(n) = 0 otherwise k=0 6 6 The impulse response has finite duration (h(n) = 0 for all n > 6). If a system has an impulse response with finite duration, we call it a finite impulse response (FIR) system.

EECS 20 Chapter 5 Part 28 Example: IIR Consider the oscillator system, and find the impulse response: cos (  ) -sin (  ) sin (  ) cos (  ) We showed that We can also show that cos (n  ) -sin (n  ) sin (n  ) cos (n  ) A = C =1 0B = 0101 D = 0 h(n) = CA n-1 B for n > 0h(0) = Dh(n) = 0 for n < 0 A n = The impulse response does not die out; there is no N for which h(n) = 0 for n>N. We say these systems have infinite impulse response (IIR). h(n) = -sin( (n-1)  ) for n>0 h(n) = 0 otherwise

EECS 20 Chapter 5 Part 29 Example: Unstable Consider the bank interest system s(n+1) = (1+r)s(n) + x(n) y(n) = s(n) Find the impulse response h. Here, the impulse response has an interesting interpretation: it is the yearly value of a bank account when $1 is deposited in year 0, and nothing is deposited thereafter. We may show that h(n) = (1+r) n Here, the impulse response does not die out; it is an IIR system. In addition, h(n) increases with n, without bound. If a system produces an unbounded output for a bounded input, we say the system is unstable.

EECS 20 Chapter 5 Part 210 MIMO Systems Since the impulse function  takes values in Reals, the impulse response h is technically defined only for single-input systems. We may define a matrix-valued function h with the same values and the general output y will be given by the same convolution y(n) = Σ h(n-m) x(m)  y = h  x So we can still have an h with the same properties for general MIMO systems, but we won’t call it an impulse response. h(n) = CA n-1 B for n > 0h(0) = Dh(n) = 0 for n < 0 m=-∞ ∞