Ch. 2 Time-Domain Models of Systems Kamen and Heck.

Slides:



Advertisements
Similar presentations
Review of Frequency Domain
Advertisements

Lecture 4: Linear Systems and Convolution
Lecture 19: Discrete-Time Transfer Functions
Lecture 5: Linear Systems and Convolution
EE-2027 SaS, L11 1/13 Lecture 11: Discrete Fourier Transform 4 Sampling Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
Lecture 9: Fourier Transform Properties and Examples
Time-Domain System Analysis M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl 1.
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
Signals and Systems Discrete Time Fourier Series.
The Discrete Fourier Series
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
Discrete-Time and System (A Review)
1 Signals & Systems Spring 2009 Week 3 Instructor: Mariam Shafqat UET Taxila.
Ch. 1 Fundamental Concepts Kamen and Heck. 1.1 Continuous Time Signals x(t) –a signal that is real-valued or scalar- valued function of the time variable.
Time-Domain Representations of LTI Systems
Time Domain Representation of Linear Time Invariant (LTI).
DISCRETE-TIME SIGNALS and SYSTEMS
Time-Domain Representations of LTI Systems
Discrete-time Systems Prof. Siripong Potisuk. Input-output Description A DT system transforms DT inputs into DT outputs.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Hasliza A Samsuddin EKT.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
2006 Fall Signals and Systems Lecture 4 Representation of signals Convolution Examples.
Fourier Analysis of Discrete-Time Systems
BYST CPE200 - W2003: LTI System 79 CPE200 Signals and Systems Chapter 2: Linear Time-Invariant Systems.
Linear Time-Invariant Systems
COSC 3451: Signals and Systems Instructor: Dr. Amir Asif
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Convolution Examples Ex2.9:
Input Function x(t) Output Function y(t) T[ ]. Consider The following Input/Output relations.
Fourier Analysis of Signals and Systems
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.
1 Time-Domain Representations of LTI Systems CHAPTER 2.11 Characteristics of Systems Described by Differential and Difference Equations and Difference.
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.
Time Domain Representation of Linear Time Invariant (LTI).
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
Fourier Representation of Signals and LTI Systems.
Signals and Systems Lecture #6 EE3010_Lecture6Al-Dhaifallah_Term3321.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Amir Razif B. Jamil Abdullah EKT.
Description and Analysis of Systems Chapter 3. 03/06/06M. J. Roberts - All Rights Reserved2 Systems Systems have inputs and outputs Systems accept excitation.
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
Digital Signal Processing
In summary If x[n] is a finite-length sequence (n  0 only when |n|
Time Domain Representations of Linear Time-Invariant Systems
EENG 420 Digital Signal Processing Lecture 2.
الفريق الأكاديمي لجنة الهندسة الكهربائية 1 Discrete Fourier Series Given a periodic sequence with period N so that The Fourier series representation can.
EE611 Deterministic Systems Examples and Discrete Systems Descriptions Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Discrete Time Signal Processing Chu-Song Chen (陳祝嵩) Institute of Information Science Academia Sinica 中央研究院 資訊科學研究所.
Linear Constant-Coefficient Difference Equations
Time Domain Representation of Linear Time Invariant (LTI).
Chapter 3 Time Domain Analysis of DT System Basil Hamed
Digital Signal Processing
Properties of LTI Systems
Discrete-time Systems
Lecture 12 Linearity & Time-Invariance Convolution
Laplace and Z transforms
Lecture 4: Discrete-Time Systems
CS3291: "Interrogation Surprise" on Section /10/04
2 Linear Time-Invariant Systems --Analysis of Signals and Systems in time-domain An arbitrary signal can be represented as the supposition of scaled.
Lecture 22 IIR Filters: Feedback and H(z)
Lecture 4: Linear Systems and Convolution
Convolution sum & Integral
Presentation transcript:

Ch. 2 Time-Domain Models of Systems Kamen and Heck

2.1 Input/Output Representation of Discrete-Time Systems N-Point Moving Average – y[n] = (1/N) {x[n] + x[n-1] + …+x[n-N +1] (2.1) Generalization (linear, time-invariant,causal) –

2.1.1 Exponentially Weighted Moving Average Let a = (1-b)/(1-b n )

2.1.2 General Class of Systems Upper index (N-1) can be replaced by n. Unit impulse response of the system can be obtained by letting x[n] =  [n].

Convolution Equation The input/output representation can be rewritten with the weighting function replaced with the input response function values, h[i]. The result is called convolution.

2.2 Convolution of Discrete-Time Signals The convolution equation can be defined for arbitrary discrete-time signals x[n] and v[n]. The result can also be generalized for the case where – x[n] =0 for n<Q – v[n ] = 0 for n<P In such a case the convolution result is 0 for n<P+Q.

Array Method for Computation An array method can be used for computation of the general discrete convolution. The columns are labeled x[Q], x[Q+1],… The rows are labeled v[P], v[P+1]… The array is filled in with the products of the values—then sum of elements of the backwords diagonals gives the values, y[n]. Example 2.4 illustrates the process.

MATLAB The matlab function conv can be used to compute discrete convolution. Examples on page 52 and 53 illustrate the results.

Difference Equation Models In some applications, a causal linear time- invariant discrete-time system is given by an input/output difference equation instead of an input/output convolution model. First order linear difference equation – y[n] –ay[n-1] = -x[n]

2.3.1 Nth-Order Input/Output Difference Equations

Examples Example 2.6 Second Order System – System can be solved recursively. – Sometimes a “complete” solution can be found recursively.

2.4 Differential Equation Models Example 2.8 Series RC Circuit Example 2.9 Mass-Spring-Damper System Example 2.10 Motor with Load

2.5 Solution Of Differential Equations Example 2.11 Series RC Circuit Example 2.12 Using MATLAB ODE Solver Example MATLAB Symbolic MATH Solver

2.6 Convolution Representation of Continuous-Time Systems Example 2.14 RC Circuit Graphical Approach to Convolution