Lecture 2 Linear and Time Invariant Systems

Similar documents
DSP First, 2/e. Lecture 11 FIR Filtering Intro

Computing the output response of LTI Systems.

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

Linear time invariant systems

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

DIGITAL SIGNAL PROCESSING LECTURE 3

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems

ECE 308 Discrete-Time Signals and Systems

ADVANCED DIGITAL SIGNAL PROCESSING

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

Lectures 9 IIR Systems: First Order System

EEO 401 Digital Signal Processing Prof. Mark Fowler

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Question1 Multiple choices (circle the most appropriate one):

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

Frequency Response of FIR Filters

EECE 301 Signals & Systems

MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0.

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

2D DSP Basics: 2D Systems

Time-Domain Representations of LTI Systems

Signals & Systems Chapter3

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

COMM 602: Digital Signal Processing

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

ELEG3503 Introduction to Digital Signal Processing

Solution of Linear Constant-Coefficient Difference Equations

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

Frequency Domain Filtering

M2.The Z-Transform and its Properties

Chapter 7: The z-transform. Chih-Wei Liu

FIR Filter Design: Part II

EE123 Digital Signal Processing

Finite-length Discrete Transforms. Chapter 5, Sections

Morphological Image Processing

Introduction to Signals and Systems, Part V: Lecture Summary

Ch3 Discrete Time Fourier Transform

Chapter 8. DFT : The Discrete Fourier Transform

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

6.003 Homework #3 Solutions

Chapter 7 z-transform

from definition we note that for sequences which are zero for n < 0, X[z] involves only negative powers of z.

Digital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved

Exponential Moving Average Pieter P

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Chapter 2 Systems and Signals

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

Unit 4: Polynomial and Rational Functions

Solutions - Homework # 1

EE123 Digital Signal Processing

EE422G Homework #13 (12 points)

MAXIMALLY FLAT FIR FILTERS

A. Basics of Discrete Fourier Transform

CALCULUS BASIC SUMMER REVIEW

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Definition of z-transform.

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

Digital Signal Processing, Fall 2006

EE123 Digital Signal Processing

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

VU Signal and Image Processing

Chapter 4 : Laplace Transform

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

CHAPTER I: Vector Spaces

Discrete-time signals and systems See Oppenheim and Schafer, Second Edition pages 8 93, or First Edition pages 8 79.

Solution of EECS 315 Final Examination F09

P.3 Polynomials and Special products

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

EE Midterm Test 1 - Solutions

Web Appendix O - Derivations of the Properties of the z Transform

Appendix: The Laplace Transform

Problem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =

CEMTool Tutorial. The z-transform

Section 11.8: Power Series

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk

9.3 Power Series: Taylor & Maclaurin Series

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3

Polynomials. Computer Programming for Engineers (2014 Spring)

Digital Signal Processing

Classification of DT signals

Generating Functions. 1 Operations on generating functions

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

Fall 2011, EE123 Digital Signal Processing

Linearly Independent Sets, Bases. Review. Remarks. A set of vectors,,, in a vector space is said to be linearly independent if the vector equation

Chapter 3. z-transform

arxiv: v1 [cs.sc] 2 Jan 2018

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

The Discrete Fourier Transform

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)

TEACHER CERTIFICATION STUDY GUIDE

Polynomial Multiplication and Fast Fourier Transform

A brief introduction to linear algebra

Transcription:

EE3054 Sigals ad Systems Lecture 2 Liear ad Time Ivariat Systems Yao Wag Polytechic Uiversity Most of the slides icluded are extracted from lecture presetatios prepared by McClella ad Schafer

Licese Ifo for SPFirst Slides This work released uder a Creative Commos Licese with the followig terms: Attributio The licesor permits others to copy, distribute, display, ad perform the work. I retur, licesees must give the origial authors credit. No-Commercial The licesor permits others to copy, distribute, display, ad perform the work. I retur, licesees may ot use the work for commercial purposes uless they get the licesor's permissio. Share Alike The licesor permits others to distribute derivative works oly uder a licese idetical to the oe that govers the licesor's work. Full Text of the Licese This (hidde) page should be kept with the presetatio 1/30/2008 2003, JH McClella & RW Schafer 2

Review of Last Lecture Geeral FIR System IMPULSE RESPONSE FIR case: h[]=b_ CONVOLUTION { b k } h[] y[ ] = h[ ] x[ ] For ay FIR system: y[] = x[] * h[] 1/30/2008 2003, JH McClella & RW Schafer 3

1/30/2008 2003, JH McClella & RW Schafer 4 GENERAL FIR FILTER FILTER COEFFICIENTS {b k } DEFINE THE FILTER For example, = = M k k k x b y 0 ] [ ] [ 3] [ 2] [ 2 1] [ ] [ 3 ] [ ] [ 3 0 + + = = = x x x x k x b y k k 1, 2,1} 3, = { b k Feedforward Differece Equatio

GENERAL FIR FILTER SLIDE a Legth-L WINDOW over x[] Whe h[] is ot symmetric, eeds to flip h() first! x[-m] x[] 1/30/2008 2003, JH McClella & RW Schafer 5

7-pt AVG EXAMPLE Iput : x[ ] = (1.02) + cos(2π /8 + π / 4) for 0 40 CAUSAL: Use Previous 1/30/2008 2003, JH McClella & RW Schafer 6 LONGER OUTPUT

Uit Impulse Sigal x[] has oly oe NON-ZERO VALUE δ [ ] = 1 0 = 0 0 UNIT-IMPULSE 1 1/30/2008 2003, JH McClella & RW Schafer 7

4-pt Avg Impulse Respose δ[] READS OUT the FILTER COEFFICIENTS h i h[] deotes Impulse Respose y[ ] = 1 ( x[ ] + x[ 1] + x[ 2] + x[ 4 h[ ] = {, 0, 0, 1, 1, 1, 1, 0, 0, } 4 = 1 =0 =1 4 =0 1 4 1/30/2008 2003, JH McClella & RW Schafer 8 4 =4 =5 NON-ZERO Whe widow overlaps δ[] 3])

What is Impulse Respose? Impulse respose is the output sigal whe the iput is a impulse Fiite Impulse Respose (FIR) system: Systems for which the impulse respose has fiite duratio For FIR system, impulse respose = Filter coefficiets h[k] = b_k Output = h[k]* iput 1/30/2008 2003, JH McClella & RW Schafer 9

1/30/2008 2003, JH McClella & RW Schafer 10 FIR IMPULSE RESPONSE Covolutio = Filter Defiitio Filter Coeffs = Impulse Respose = = M k k x k h y 0 ] [ ] [ ] [ CONVOLUTION = = M k k k x b y 0 ] [ ] [

Covolutio Operatio Flip h[] SLIDE a Legth-L WINDOW over x[] y [ ] = M k = 0 h [ k ] x [ k ] CONVOLUTION x[-m] x[] 1/30/2008 2003, JH McClella & RW Schafer 11

More o sigal rages ad legths after filterig Iput sigal from 0 to N-1, legth=l1=n Filter from 0 to M, legth = L2= M+1 Output sigal? From 0 to N+M-1, legth L3=N+M=L1+L2-1 1/30/2008 2003, JH McClella & RW Schafer 12

DCONVDEMO: MATLAB GUI 1/30/2008 2003, JH McClella & RW Schafer 13

Go through the demo program for differet types of sigals Do a example by had Rectagular * rectagular Step fuctio * rectagular 1/30/2008 2003, JH McClella & RW Schafer 14

CONVOLUTION via Sythetic Polyomial Multiplicatio 1/30/2008 2003, JH McClella & RW Schafer 15

Covolutio via Sythetic Polyomial Multiplicatio More example 1/30/2008 2003, JH McClella & RW Schafer 16

MATLAB for FIR FILTER yy = cov(bb,xx) VECTOR bb cotais Filter Coefficiets DSP-First: yy = firfilt(bb,xx) FILTER COEFFICIENTS {b k } y[ ] = M k= 0 b k x[ k] cov2() for images 1/30/2008 2003, JH McClella & RW Schafer 17

POP QUIZ FIR Filter is FIRST DIFFERENCE y[] = x[] - x[-1] INPUT is UNIT STEP 1 u[ ] = 0 < 0 0 Fid y[] y [ ] = u [ ] u [ 1] = δ [ ] 1/30/2008 2003, JH McClella & RW Schafer 18

SYSTEM PROPERTIES x[] SYSTEM y[] MATHEMATICAL DESCRIPTION TIME-INVARIANCE INVARIANCE LINEARITY CAUSALITY No output prior to iput 1/30/2008 2003, JH McClella & RW Schafer 19

TIME-INVARIANCE IDEA: Time-Shiftig the iput will cause the same time-shift i the output EQUIVALENTLY, We ca prove that The time origi (=0) is picked arbitrary 1/30/2008 2003, JH McClella & RW Schafer 20

TESTING Time-Ivariace 1/30/2008 2003, JH McClella & RW Schafer 21

Examples of systems that are time ivariat ad o-time ivariat 1/30/2008 2003, JH McClella & RW Schafer 22

LINEAR SYSTEM LINEARITY = Two Properties SCALING Doublig x[] will double y[] SUPERPOSITION: Addig two iputs gives a output that is the sum of the idividual outputs 1/30/2008 2003, JH McClella & RW Schafer 23

TESTING LINEARITY 1/30/2008 2003, JH McClella & RW Schafer 24

Examples systems that are liear ad o-liear 1/30/2008 2003, JH McClella & RW Schafer 25

LTI SYSTEMS LTI: Liear & Time-Ivariat Ay FIR system is LTI Proof! 1/30/2008 2003, JH McClella & RW Schafer 26

LTI SYSTEMS COMPLETELY CHARACTERIZED by: IMPULSE RESPONSE h[] CONVOLUTION: y[] = x[]*h[] The rule defiig the system ca ALWAYS be rewritte as covolutio FIR Example: h[] is same as b k 1/30/2008 2003, JH McClella & RW Schafer 27

Proof of the covolutio sum relatio by represetig x() as sum of delta(-k), ad use LTI property!

Properties of Covolutio Covolutio with a Impulse Commutative Property Associative Property

Covolutio with Impulse x[]*δ[]=x[] x[]*δ[-k]=x[-k] Proof

Commutative Property x[]*h[]=h[]*x[] Proof

Associative Property (x[]* y[])* z[]=x[]*(y[]*z[]) Proof

HARDWARE STRUCTURES x[] FILTER y[] y[ ] = M k= 0 b k x[ k] INTERNAL STRUCTURE of FILTER WHAT COMPONENTS ARE NEEDED? HOW DO WE HOOK THEM TOGETHER? SIGNAL FLOW GRAPH NOTATION 1/30/2008 2003, JH McClella & RW Schafer 33

1/30/2008 2003, JH McClella & RW Schafer 34 HARDWARE ATOMS Add, Multiply & Store = = M k k k x b y 0 ] [ ] [ ] [ ] [ x y β = 1] [ ] [ = x y ] [ ] [ ] [ 2 1 x x y + =

FIR STRUCTURE Direct Form SIGNAL FLOW GRAPH y[ ] = M k= 0 b k x[ k ] 1/30/2008 2003, JH McClella & RW Schafer 35

FILTER AS BUILDING BLOCKS x[] FILTER OUTPUT INPUT FILTER + + y[] FILTER BUILD UP COMPLICATED FILTERS FROM SIMPLE MODULES Ex: FILTER MODULE MIGHT BE 3-pt FIR Is the overall system still LTI? What is its impulse respose? 1/30/2008 2003, JH McClella & RW Schafer 36

CASCADE SYSTEMS Does the order of S 1 & S 2 matter? NO, LTI SYSTEMS ca be rearraged!!! WHAT ARE THE FILTER COEFFS? {b k } S 1 S 2 1/30/2008 2003, JH McClella & RW Schafer 37

proof 1/30/2008 2003, JH McClella & RW Schafer 38

CASCADE SYSTEMS x[] h 1 [] h 2 [] y[] Is the cascaded system LTI? What is the impulse respose of the overall system? 1/30/2008 2003, JH McClella & RW Schafer 39

CASCADE SYSTEMS h[] = h 1 []*h2[]! Proof o board

Does the order matter? S 1 S 2 S 2 S 1 1/30/2008 2003, JH McClella & RW Schafer 41

proof

Example Give impulse resposes of two systems, determie the overall impulse respose

Parallel Coectios h 1 [] x[] + y[] h 2 [] h[]=?

Parallel ad Cascade h 1 [] h 2 [] x[] + y[] h 3 [] h[]=?

Summary of This Lecture Properties of liear ad time ivariat systems Ay LTI system ca be characterized by its impulse respose h[], ad output is related to iput by covolutio sum: y[]= ]=x[]*h[] Properties of covolutio Computatio of covolutio revisited Slidig widow Sythetic polyomial multiplicatio Block diagram represetatio Hardware implemetatio of oe FIR Coectio of multiple FIR Kow how to compute overall impulse respose

READING ASSIGNMENTS This Lecture: Chapter 5, Sectios 5-5 --- 5-9