M2.The Z-Transform and its Properties

Similar documents
The Z-Transform. Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, Prentice Hall Inc.

Digital Signal Processing

Definition of z-transform.

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.

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

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations

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

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

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 z Transform. The Discrete LTI System Response to a Complex Exponential

Chapter 3. z-transform

Question1 Multiple choices (circle the most appropriate one):

ADVANCED DIGITAL SIGNAL PROCESSING

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

Chapter 4 : Laplace Transform

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

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

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

Solutions of Chapter 5 Part 1/2

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

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It

6.003 Homework #3 Solutions

EE Midterm Test 1 - Solutions

Solution of EECS 315 Final Examination F09

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

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

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

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

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

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

Frequency Response of FIR Filters

GATE ELECTRONICS & COMMUNICATION

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

ELEG3503 Introduction to Digital Signal Processing

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

Quiz. Use either the RATIO or ROOT TEST to determine whether the series is convergent or not.

PRELIM PROBLEM SOLUTIONS

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

DIGITAL SIGNAL PROCESSING LECTURE 5

Appendix: The Laplace Transform

Chapter 2 Systems and Signals

DIGITAL SIGNAL PROCESSING LECTURE 3

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

COMM 602: Digital Signal Processing

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

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

ECE 308 Discrete-Time Signals and Systems

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

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

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)

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

A. Basics of Discrete Fourier Transform

Introduction to Digital Signal Processing

EE123 Digital Signal Processing

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

Linear time invariant systems

EE123 Digital Signal Processing

A) is empty. B) is a finite set. C) can be a countably infinite set. D) can be an uncountable set.

EEO 401 Digital Signal Processing Prof. Mark Fowler

DEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING SIGNALS AND SYSTEMS. Assoc. Prof. Dr. Burak Kelleci. Spring 2018

The z transform is the discrete-time counterpart of the Laplace transform. Other description: see page 553, textbook.

Chapter 10 z Transform

PAPER : IIT-JAM 2010

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Exponential Moving Average Pieter P

Fall 2011, EE123 Digital Signal Processing

EECE 301 Signals & Systems

2D DSP Basics: 2D Systems

Computing the output response of LTI Systems.

j=1 dz Res(f, z j ) = 1 d k 1 dz k 1 (z c)k f(z) Res(f, c) = lim z c (k 1)! Res g, c = f(c) g (c)

Analytic Continuation

The Discrete Fourier Transform

Signals & Systems Chapter3

Fall 2013 MTH431/531 Real analysis Section Notes

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

f(w) w z =R z a 0 a n a nz n Liouville s theorem, we see that Q is constant, which implies that P is constant, which is a contradiction.

Introduction to Optimization Techniques

Finite-length Discrete Transforms. Chapter 5, Sections

FIR Filter Design: Part II

UNIT-I. 2. A real valued sequence x(n) is anti symmetric if a) X(n)=x(-n) b) X(n)=-x(-n) c) A) and b) d) None Ans: b)

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Regn. No. North Delhi : 33-35, Mall Road, G.T.B. Nagar (Opp. Metro Gate No. 3), Delhi-09, Ph: ,

Introduction to Signals and Systems, Part V: Lecture Summary

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

ENGI Series Page 6-01

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

Time-Domain Representations of LTI Systems

Lecture 2 Linear and Time Invariant Systems

Chapter 8. DFT : The Discrete Fourier Transform

AP Calculus Chapter 9: Infinite Series

Digital Signal Processing, Fall 2006

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

(, ) (, ) (, ) ( ) ( )

Ch3 Discrete Time Fourier Transform

CEMTool Tutorial. The z-transform

Dynamic Response of Linear Systems

6.003: Signal Processing

Singular Continuous Measures by Michael Pejic 5/14/10

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

Transcription:

M2.The Z-Trasform ad its Properties Readig Material: Page 94-126 of chapter 3 3/22/2011 I. Discrete-Time Sigals ad Systems 1

What did we talk about i MM1? MM1 - Discrete-Time Sigal ad System 3/22/2011 I. Discrete-Time Sigals ad Systems 2

MM1: Discrete-Time Sigals: Sequeces Cotiuous-time sigals are defied alog a cotium of times (aalog sigals) Discrete-time sigals are defied at discrete times Digital sigals are those for which both time ad amplitude are discrete Delayed sequece, y[]=x[- 0 ], 0 is a iteger Discrete-time impulse, Uit step sequece, δ [ ] u [ ] Siusoid sequeces, x[]=acos(ω 0 +φ), - < < 3/22/2011 I. Discrete-Time Sigals ad Systems 3 = = 1, 0, 1, 0, = < 0 0 0 0

A liear system: T{ax1[]+bx2[]}=T{ax1[]}+T{bx2[]}=ay1[]+by2[] A time-ivariat system: T{}: x[] y[], T{}: x[- d ] y[- d ], for ay d A causal system BIBO stability MM1: Discrete-Time Systems x[] LTI system: y[]=σ k=- x[k] h[-k] T{ } Covolutio sum: y[]=x[]*h[] FIR: Fiite-duratio impulse respose systems IIR: Ifiite-duratio impulse respose systems y[] 3/22/2011 I. Discrete-Time Sigals ad Systems 4

How about Exercise Oe? Problem 2.24 o page75 of the textbook; Problem 2.36 o page78 of the textbook. I. Discrete-Time Sigals ad Systems 5

MM2 - The Z-Trasform Readig Material: Page 94-126 of chapter 3 3/22/2011 I. Discrete-Time Sigals ad Systems 6

Review of Laplace Trasform Laplace trasform for the cotiuous-time sigals ad systems: Beefits: X x( t) st ( s) = L( x( t)) = x( t) e dt 0 = 1 2 πj δ + j δ j X( s) e Tur the differetial equatio ito algebraic equatio Deal with discotiuous sigals System s trasiet ad steady-state aalysis st ds, t 0, δ δ 0 3/22/2011 I. Discrete-Time Sigals ad Systems 7

Review of Laplace Trasform (cotiue) Existig Theorem: x(t) is Laplace-trasformable if x(t) is piecewise cotiuous over every fiite iterval x(t) is expoetial order, i.e., x(t) e -at < Properties: Liearity L(ax 1 (t)+bx 2 (t))=ax 1 (s)+bx 2 (s) Shift i time L(x(t-a))=e -as X(s) Complex differetiatio L(tx(t))=-d(X(s))/ds Real differetiatio L(d(x(t))/dt)=sX(s)-X(0) Fial value, iitial value. Applicatios Solve the differetial equatios... 3/22/2011 I. Discrete-Time Sigals ad Systems 8

What s the Z-trasform? The z-trasform for the discrete-time sigals is the couterpart of the Laplace trasform for cotiuous-time sigals The z-trasform is a geeralizatio of the Fourier trasform I the aalysis problems, especially for the discrete-time domai, the z-trasform is more coveiet tha the Fourier trasform 3/22/2011 I. Discrete-Time Sigals ad Systems 9

Defiitio of the Z-Trasform The z-trasform of a sequece x[] is = X ( z ) = x[ ] z Relatio with Fourier trasform, z=re jω X ( re jω ) = = ( x[ ] r The Fourier trasform correspods the z-trasform o the uit circle i the z-plae ) e jω Covergece of the series? 3/22/2011 I. Discrete-Time Sigals ad Systems 10

Regio of Covergece (ROC) For ay give sequece, ROC is a set of values of z for which the z-trasform coverges ROC depeds oly o z, i.e. X(z) <, if = x [ ] z The z-trasform ad all its derivatives are cotiuous fuctios of z withi the ROC ( Lauret series) A ratioal fuctio X(z) is a ratio of two polyomials i z: X(z)=P(z)/Q(z) Zeros of X(z); poles of X(z) 3/22/2011 I. Discrete-Time Sigals ad Systems 11 <

Computatio of the z-trasform Right-sided expoetial sequece (example 3.1 pp.98) a u[] 1/(1-az -1 ), z > a Left-sided expoetial sequece (example 3.2, pp.99) -a u[--1] 1/(1-az -1 ), z < a Sum of two expoetial sequeces x[]=(1/2) u[]+(-1/3) u[] Accordig to defiitio (example 3.3, pp.101) Usig the liearity of z-trasform (example 3.4, pp.102) The ROC is the itersectio of the idividual ROCs 3/22/2011 I. Discrete-Time Sigals ad Systems 12

Computatio of the z-trasform(cotiue) Two-sided expoetial sequece (example 3.5, pp.102) x[]=(-1/3) u[]-(1/2) u[--1] Fiite-legth sequece (example 3.6, pp.103) a 0 N 1 1 x[ ] = X( z) = N 1 0 otherwise z N z a z a The ROC is the etire z-plae except the origi (z=0) The N zeros are z k =ae j(2kπ/n ), k=0,1, N-1 The z-trasform icludes a algebraic expressio ad a ROC 3/22/2011 I. Discrete-Time Sigals ad Systems 13 N

(page104) 3/22/2011 I. Discrete-Time Sigals ad Systems 14

Properties of ROC P1: The ROC is a rig or disk i the z-plae cetered at the origi, i.e., 0 r R z r L P2: The Fourier trasform of x[] coverges absolutely iff the ROC of the z-trasform of x[] icludes the uit circle i the z-plae P3: The ROC ca ot cotai ay poles P4: If x[] is a fiite-duratio sequece, the the ROC is the etire z-plae, except possibly z=0 or z= X ( z ) = N 2 = N 1 x [ ] z If N 1 <0, the exceptio will be z= ; if N 2 >0, the exceptio will be z= 0;if N 2 >0 ad N 1 <0, the exceptio will be both. 3/22/2011 I. Discrete-Time Sigals ad Systems 15

Properties of ROC (cotiue) P5: If x[] is a right-sided sequece, the the ROC exteds outward from the outermost fiite pole to (ad possibly icludig) z= If the sequece has ozero values for egative values of, the ROC will ot iclude z= P6: If x[] is a left-sided sequece, the the ROC exteds iward from the iermost ozero pole to (ad possibly icludig) z= 0 If the sequece has ozero values for positive values of, the ROC will ot iclude z= 0 P7: If x[] is a two-sided sequece, the the ROC will cotai a rig i the z-plae, bouded o the iterior ad exterior by a pole ad does ot cotai ay poles The ROC must be a coected regio 3/22/2011 I. Discrete-Time Sigals ad Systems 16

3/22/2011 I. Discrete-Time Sigals ad Systems 17

Determiig ROC by System Properties The ROC ca be specify through some time-domai properties Example 3.7 pp.110 If the system is stable, the the ROC is. 1/2< z <2 Is the system causal i this case?.. No!! Why If the system is causal, the the ROC is. z >2 Is the system stable i this case?.. No!! Why 3/22/2011 I. Discrete-Time Sigals ad Systems 18-2 Im 1/2 Pole-zero plot for the system fuctio Re

3/22/2011 I. Discrete-Time Sigals ad Systems 19 Z-Trasform Properties Liearity ax 1 []+bx 2 [] ax 1 (z)+bx 2 (z), ROC cotais R 1 R 2 If there is o pole-zero cacellatio, ROC=R 1 R 2 If there is the pole-zero cacellatio, ROC R 1 R 2 possibly Example 3.6, p.103 Time shiftig x[- 0 ] z - 0 X(z), ROC= R x (except for the possible additio or deletio of z=0 or z= ) Expoetial multiplicatio z 0 x[] X(z/z 0 ), ROC= z 0 R x Example 3.15, pp.121 a z a z z z X N u a u a x N N N = = 1 1 ) ( ] [ ] [ ] [ 2 2 1 0 1 0 0 cos 2 1 cos 1 ) ( ] [ ) cos( ] [ + = = z r z r z r z X u r x ω ω ω

Z-Trasform Properties (cotiue 1 ) Differetiatio of X(z) x[] zdx(z)/dz, ROC= R x Example 3.16, pp.122 log( 1 + az 1 ), z > a x[ ] = ( 1) + 1 u[ Cojugatio of a complex sequece x * [] X * (z * ), ROC= R x Time reversal x * [-] X * (1/z * ), ROC=1/ R x a 1] See Example 3.18 pp.124 3/22/2011 I. Discrete-Time Sigals ad Systems 20

Z-Trasform Properties (cotiue 2 ) Covolutio of sequeces x 1 []*x 2 [] X 1 (z)x 2 (z), ROC cotais R 1 R 2 Ca you prove that see page 124 Iitial-value theorem: If x[] is zero for <0 (causal), the x[0]=lim z X(z) Summary of z-trasform properties table 3.2 (pp.126) 3/22/2011 I. Discrete-Time Sigals ad Systems 21

3/22/2011 I. Discrete-Time Sigals ad Systems 22

Exercise Two See the distributed paper 3/22/2011 I. Discrete-Time Sigals ad Systems 23