Difference Equations Linear Systems and Signals Lecture 9 Spring 2008.

Slides:



Advertisements
Similar presentations
Chapter 1 -Discrete Signals A Sampled or discrete time signal x[n] is just an ordered sequence of values corresponding to the index n that embodies the.
Advertisements

Week Real time state machines 2.LTI systems– the [A,B,C,D] representation 3.Differential equation-approximation by discrete- time system 4.Response–
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.
Discrete Structures Chapter 6 Recurrence Relations
Lecture 19: Discrete-Time Transfer Functions
DT systems and Difference Equations Monday March 22, 2010
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,
Meiling chensignals & systems1 Lecture #2 Introduction to Systems.
Difference Equations and Stability Linear Systems and Signals Lecture 10 Spring 2008.
System State and Differential Equations Linear Systems and Signals Lecture 3 Spring 2008.
Differential Equations EE 313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian.
7 = 7 SOLUTION EXAMPLE 1 Check the intersection point Use the graph to solve the system. Then check your solution algebraically. x + 2y = 7 Equation 1.
Finite Impuse Response Filters. Filters A filter is a system that processes a signal in some desired fashion. –A continuous-time signal or continuous.
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
ECE 352 Systems II Manish K. Gupta, PhD Office: Caldwell Lab ece. osu. ece. osu. edu Home Page:
1 Signals & Systems Spring 2009 Week 3 Instructor: Mariam Shafqat UET Taxila.
Unit 1 Test Review Answers
DISCRETE-TIME 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.
Discrete-time Systems Prof. Siripong Potisuk. Input-output Description A DT system transforms DT inputs into DT outputs.
Signals and Systems 1 Lecture 8 Dr. Ali. A. Jalali September 6, 2002.
Fourier Analysis of Discrete-Time Systems
BYST CPE200 - W2003: LTI System 79 CPE200 Signals and Systems Chapter 2: Linear Time-Invariant Systems.
Hossein Sameti Department of Computer Engineering Sharif University of Technology.
Signals And Systems Chapter 2 Signals and systems analysis in time domain.
Chapter 2 Systems Defined by Differential or Difference Equations.
Leo Lam © Signals and Systems EE235. Leo Lam © Today’s menu Yesterday: Exponentials Today: Linear, Constant-Coefficient Differential.
Time Domain Analysis of Linear Systems Ch2 University of Central Oklahoma Dr. Mohamed Bingabr.
Section – Linear Inequalities (NC)
Net work analysis Dr. Sumrit Hungsasutra Text : Basic Circuit Theory, Charles A. Desoer & Kuh, McGrawHill.
CHAPTER 2 Discrete-Time Signals and Systems in the Time-Domain
Homework 3.
1 Time-Domain Representations of LTI Systems CHAPTER 2.11 Characteristics of Systems Described by Differential and Difference Equations and Difference.
Review for Unit 2 Test Directions: Show your work for each slide on the next 2-3 blank pages of your INB. Write the title above on each page you use in.
Review for Unit 2 Quiz 1. Review for U2 Quiz 1 Solve. We will check them together. I will answer questions when we check answers. Combine like terms.
Signal & Linear system Chapter 3 Time Domain Analysis of DT System Basil Hamed.
Time Domain Representation of Linear Time Invariant (LTI).
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.
Signal and System I The representation of discrete-time signals in terms of impulse Example.
Signals and Systems Analysis NET 351 Instructor: Dr. Amer El-Khairy د. عامر الخيري.
Linear Constant-Coefficient Difference Equations
Leo Lam © Signals and Systems EE235 Lecture 19.
Ch. 2 Time-Domain Models of Systems Kamen and Heck.
Signals and Systems Lecture #6 EE3010_Lecture6Al-Dhaifallah_Term3321.
2-4 Solving Equations with Variables on Both Sides.
EXAMPLE 1 Solve a system graphically Graph the linear system and estimate the solution. Then check the solution algebraically. 4x + y = 8 2x – 3y = 18.
Algebra Review. Systems of Equations Review: Substitution Linear Combination 2 Methods to Solve:
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.
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
Digital Signal Processing Lecture 3 LTI System
Finite Impuse Response Filters. Filters A filter is a system that processes a signal in some desired fashion. –A continuous-time signal or continuous.
Digital Signal Processing
Notes Over 9.4 Checking a Solution Using a Graph The solution, or roots of an equation are the x-intercepts. Solve the equation algebraically. Check the.
EENG 420 Digital Signal Processing Lecture 2.
1 Lesson 2 Classification of the System response Linear system.
EE611 Deterministic Systems Examples and Discrete Systems Descriptions Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
CEN352 Dr. Nassim Ammour King Saud University
Discrete-time Systems
Laplace and Z transforms
Lecture 4: Discrete-Time Systems
Solve a system of linear equation in two variables
Discrete-Time Signals: Sequences
CS3291: "Interrogation Surprise" on Section /10/04
Linear Algebra Lecture 3.
SECTION 2-4 : SOLVING EQUATIONS WITH THE VARIABLE ON BOTH SIDES
Solving Linear Equations by Graphing
Presentation transcript:

Difference Equations Linear Systems and Signals Lecture 9 Spring 2008

9 - 2 Iterative Solutions Example: y[n] - ½ y[n-1] = x[n] How many initial conditions do we need? For x[n] = n 2 u[n] and y[-1] = 16, causal system, y[n] = ½ y[n-1] + f[n] Compute answer iteratively: y[0], y[1], … y[0] = ½ y[-1] + f[0] = ½ (16) + 0 = 8 y[1] = ½ (8) + (1) 2 = 5 y[2] = 6.5 y[3] = y[4] =

9 - 3 Stability Is the system stable? y[n] - ½ y[n-1] = x[n] Impulse response occurs when x[n] =  [n] Values zero-state response y s [n] to input  [n] are 1, 0.5, 0.25, …, for n = 0, 1, 2, … System appears to be stable. x[n] = n 2 u[n] is unbounded

9 - 4 Zero-Input, Zero-State Solutions Example: y[n] - ½ y[n-1] = x[n] with y 0 [-1] = 16 Zero-input solution y 0 [n] - ½ y 0 [n-1] = 0 y 0 [n] = ½ y 0 [n-1] y 0 [n] = 8 (½) n u[n] 8, 4, 2, 1, ½, … Zero-state solution y s [n] - ½ y s [n-1] = n 2 y s [0] = 0 y s [1] = (½) 0 + (1) 2 = 1 y s [2] = (½) 1 + (2) 2 = 4.5 Important identity

9 - 5 Complete Solution Closed-form solution of impulse response Algebraic solution (not numerical or iterative solution) y[n] = zero-input solution + zero-state solution y[n] = y 0 [n] + y s [n] Using Mathematica on example on previous slide Needs[ “DiscreteMath`Master`” ]; RSolve[ { y[n] - (1/2) y[n-1] == n^2, y[-1] == 16 }, y[n], n] Complete solution (for non-negative n) y[n] = -14 ( n + 2 ) + 2 ( n + 2 ) ( n + 3 ) (½) n

9 - 6 Forms of Difference Equations Anti-causal (advance operator form) Causality requires M  N Set M = N; delay input/output by N samples Iterative solution 2N initial conditions (N initial conditions if causal input) Lathi, p. 271

9 - 7 Operator Notation E operator E{x[n]} = x[n + 1] E 2 {x[n]} = x[n + 2] … E k {x[n]} = x[n+ k] What is E -1 {x[n]}? E -1 {x[n]} = x[n - 1] E k {x[n]} = x[n + k] for any integer n First-order difference equation y[n + 1] + a 0 y[n] = x[n + 1] (E + a 0 ) y[n] = E{x[n]} Zero-input response: solve Q(  ) = 0   = -a 0 y 0 [n] = C (-a 0 ) n u[n]

9 - 8 Characteristic Modes Continuous Time Discrete TimeCase non-repeated roots repeated roots