DSP-I DSP-I DSP-I DSP-I

Similar documents
(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

ESE 531: Digital Signal Processing

! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction

ESE 531: Digital Signal Processing

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

PROBLEM SET 3. Note: This problem set is a little shorter than usual because we have not covered inverse z-transforms yet.

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

6.003: Signals and Systems

ELEG 305: Digital Signal Processing

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

Chapter 7: The z-transform

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

ECE503: Digital Signal Processing Lecture 4

Need for transformation?

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

INTRODUCTION TO THE DFS AND THE DFT

Z Transform (Part - II)

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections

The z-transform Part 2

Discrete-time signals and systems

The Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

ECE-S Introduction to Digital Signal Processing Lecture 4 Part A The Z-Transform and LTI Systems

y[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1)

Solutions: Homework Set # 5

Lecture 19 IIR Filters

Lecture 04: Discrete Frequency Domain Analysis (z-transform)

Module 4 : Laplace and Z Transform Problem Set 4

Very useful for designing and analyzing signal processing systems

z-transforms Definition of the z-transform Chapter

EE482: Digital Signal Processing Applications

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis

EE Homework 5 - Solutions

S&S S&S S&S. Signals and Systems (18-396) Spring Semester, Department of Electrical and Computer Engineering

Digital Signal Processing

Z-Transform. x (n) Sampler

EEL3135: Homework #4

THE INVERSE Z-TRANSFORM. 1. Lecture 6-47 minutes. Inv.rse -trondorm. -~~~ -' CkIn-)C ETC. Exam olp. b. i. ipole at g. nao 6.1

Z-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1

Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis

# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.

Digital Signal Processing:

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

Review of Discrete-Time System

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

8. z-domain Analysis of Discrete-Time Signals and Systems

Discrete Time Systems

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

Topic 4: The Z Transform

Module 4. Related web links and videos. 1. FT and ZT

ELEN E4810: Digital Signal Processing Topic 4: The Z Transform. 1. The Z Transform. 2. Inverse Z Transform

EE102B Signal Processing and Linear Systems II. Solutions to Problem Set Nine Spring Quarter

From Wikipedia, the free encyclopedia

Signals and Systems. Spring Room 324, Geology Palace, ,

Responses of Digital Filters Chapter Intended Learning Outcomes:

Z-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =

信號與系統 Signals and Systems

z-transform Chapter 6

Module 4 : Laplace and Z Transform Lecture 36 : Analysis of LTI Systems with Rational System Functions

2.161 Signal Processing: Continuous and Discrete Fall 2008

How might we evaluate this? Suppose that, by some good luck, we knew that. x 2 5. x 2 dx 5

GATE EE Topic wise Questions SIGNALS & SYSTEMS

Chapter 13 Z Transform

Signals and Systems Lecture 8: Z Transform

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

Section Taylor and Maclaurin Series

Determine the Z transform (including the region of convergence) for each of the following signals:

DSP-I DSP-I DSP-I DSP-I

Making Models with Polynomials: Taylor Series

A system that is both linear and time-invariant is called linear time-invariant (LTI).

ECE-314 Fall 2012 Review Questions for Midterm Examination II

a factors The exponential 0 is a special case. If b is any nonzero real number, then

Discrete-Time Fourier Transform (DTFT)


Integration of Rational Functions by Partial Fractions

Part 3.3 Differentiation Taylor Polynomials

Question Paper Code : AEC11T02

Discrete Time Systems

Digital Signal Processing Lecture 3 - Discrete-Time Systems

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

III. Time Domain Analysis of systems

Notes 22 largely plagiarized by %khc

Digital Signal Processing. Midterm 1 Solution

Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.

E : Lecture 1 Introduction

Assignment 11 Assigned Mon Sept 27

and the compositional inverse when it exists is A.

Poles, Zeros and System Response

Flash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:

Lecture 11 FIR Filters

Digital Signal Processing Lecture 5

The Convolution Sum for Discrete-Time LTI Systems

Transcription:

DSP-I DSP-I DSP-I DSP-I Digital Signal Processing I (8-79) Fall Semester, 005 OTES FOR 8-79 LECTURE 9: PROPERTIES AD EXAPLES OF Z-TRASFORS Distributed: September 7, 005 otes: This handout contains in outline form the lecture notes used for 8-79 Lecture 9, presented by videotape on September. Because the notes were transcribed some time after the lecture was taped, there may be some minor differences between these notes and what is seen on the video. The beginning of the lecture is covered by the end of the notes for Lecture 8.. I. Introduction In the last lecture we reviewed the basic properties of the z-transform and the corresponding region of convergence. In this lecture we will cover Stability and causality and the ROC of the z-transform (see Lecture 8 notes) Comparison of ROCs of z-transforms and LaPlace transforms (see Lecture 8 notes) Basic z-transform properties Linear constant-coefficient difference equations and z-transforms Evaluation of the inverse z-transform using Direct evaluation (not done in detail in this course) Partial fraction evaluation Evaluation using long division Evaluation using Taylor series

8-79 Lecture 9 otes -- Fall, 005 II. Basic z-transform properties Introduction: While the basic z-transform properties are very similar to those of the corresponding DTFTs, they are complicated a little by the fact that we now must also consider the region of convergence of the new transform as well. We will not review right now all of the properties cited in the text, but we will touch on the most important ones. If the time function xn [ ] has the z-transform Xz ( ), with the corresponding ROC R x, we observe the following general properties of functions and their z-transforms: Linearity with the ROC being the overlap region of the ROCs R x and R x or R x R x Time shift ax [ n] + bx [ n] ax ( z) + bx ( z) xn [ ] z Xz ( ) with ROC R x This relation plays a big role in dealing with difference equations, as will be discussed below. ultiplication in time by a complex exponential a n xn [ ] X ā - with ROC ar x ote that if a is purely real, this corresponds to a circularly-symmetric expansion or contraction of the z- plane. If a is purely imaginary, this corresponds to a rotation of the z-plane. Convolution in time xn [ ] h[ n] Xz ( ) with ROC R x R h This, of course, is just like things are with DTFTs. General multiplication in time xn [ ]wn [ ] ------- X( ν)w z πj -- ν dν ν This is again a contour integral, which we cannot evaluate using the techniques developed in this class. Hence, we will normally use DTFTs rather than z-transforms whenever we need to consider the z-transforms of multiplied time functions. We will, however, make use of the relationship that describes the z- transforms of a function multiplied by a complex exponential. Differentiation of the Z-transform nx[ n] z dx ------------- ( z) dz

8-79 Lecture 9 otes -- Fall, 005 This is easily proved by differentiating the z-transform equation with respect to z. It plays an important role in dealing with systems where multiple poles occur in the same location n the z-plane. III. Linear constant-coefficient difference equations Introduction: x[n] h[n] y[n] Difference equations in discrete time play the same role in characterizing the time-domain response of discrete-time LSI systems that differential equations play for continuous-time LTI systems. In most general form we can write difference equations as where (as usual) xn [ ] represents the input and yn [ ] represents the output. Since we can set a 0 equal to 0 without any loss of generality, we can rewrite this as Comments: a k yn k b m xn [ m] k 0 m 0 yn [ ] a k yn k b m xn [ m] k m 0 In this representation we characterize the present output of an LSI system as a linear combination of past outputs combined with a linear combination of the present and previous inputs. The difference equations alone do not uniquely specify the system. Initial conditions are needed as well. ormally we assume initial rest (i.e. the output is zero before the input is applied). Otherwise the system would be neither linear nor shift-invariant, as discussed in Problem Set. These equations can be solved analytically, just as in the case of ordinary differential equations. ormally the solution involves obtaining the homogenous solution (or the natural frequencies) of the system, and the particular solution (or the forced response). Details and examples of this are provided in the text. We can solve these equations using the procedure of iteration. For example, consider the equation yn [ ] --y[ n ] --y[ n ] x[ n] --x[ n ] 8 or, yn [ ] --y[ n ] + --y[ n ] + x[ n] --x[ n ] 8

8-79 Lecture 9 otes -- Fall, 005 Let s obtain the unit sample response hn [ ] for this equation via iteration. As we did in class a few days ago, this can be done by setting up the table: n x[n-] x[n] y[n-] y[n-] y[n] 0 0 0 0 0 0 0 0 0 0 /8 IV. Poles and zeros of LSI systems x[n] h[n] y[n] Let s consider again the generic LSI system with yn [ ] xn [ ] h[ n] or Yz ( ) Xz ( ). You will recall that the general difference equation for such a system is a k yn [ k ] b m xn [ m] k 0 m 0 Taking the z-transforms of both sides, we obtain k 0 a k z k Yz ( ) m 0 b m z m Xz ( ) Yz ( ) a k z k k 0 Xz ( ) b m z m m 0 Yz ( ) ---------- Xz ( ) b m z m m--------------------------- 0 a k z k k 0 In other words, if we have an LSI system that is characterizable by a linear constant-coefficient difference equation, the z-transform of the unit sample response, which we refer to as the system function, will always be the ratio of two polynomials in z, with coefficients that are the coefficients of the corresponding difference equation. Virtually all of the systems that we will encounter in this course will be of this form.

8-79 Lecture 9 otes -5- Fall, 005 For example, in the case of the difference equation we had looked at previously, yn [ ] --y[ n ] --y[ n ] x[ n] --x[ n ] 8 we obtain Yz ( ) ---------- Xz ( ) --z ------------------------------------ --z 8 --z ow, the zeros of the systems are by definition the values of z that cause the numerator of to equal zero (i.e. the roots of the numerator polynomial in z). Similarly, the poles of the system are the values of z that cause the denominator of to go to zero (or the roots of the denominator polynomial in z). We can obtain the poles and zeros of our example by multiplying numerator and denominator by z. z --z z --z ----------------------------------------------- z --z ------------------------- 8 --z z --z -- 8 z z -- ---------------------------------- z -- z + -- So, in this system, the zeros are at z 0 and z -- and the poles are at z -- and z --. Pole locations and the ROC We note that since the z-transform is infinite at the values of z corresponding to the pole locations, the ROC cannot include the locations of the system s poles. In fact, ROCs are always bounded by circles that are centered at the origin of the z-plane, and that pass through the locations of the poles. In this case, the potential boundaries of the ROCs are circles of radius / and /. This means that there are three possible ROCs for this system: z < -- This system would be unstable and have a left-sided unit sample response. -- < z < -- This system would also be unstable and have a both-sided unit sample response. z > -- This system would be stable and have a right-sided ( causal ) unit sample response. The exact ROC would be known either because it would be given or because you will know whether the system is causal and/or stable.

8-79 Lecture 9 otes -6- Fall, 005 V. Inverse z-transforms Recall that the equations that define z-transforms are As we know, we will not evaluate the complex contour integral for the inverse z-transform directly. Instead we will use one of the following techniques: Partial fraction expansion Long division Taylor series expansion Partial fraction expansion As is discussed briefly in the videotape, partial fraction expansion is a computational hack algorithm that enables us to obtain the results that we would have obtained if we had gone through the formal procedure of contour integration over the complex z-plane. The partial fraction method of obtaining inverse z-transforms builds on the fact that we know that a n un [ ] z for the ROC and that z ---------- ------------------- a az z > a The simplest case: If Xz ( ) xn [ ]z n n xn [ ] ------- Xz ( )z n dz πj c a n u[ n ] ------------------- for the ROC az z < a. the order of the numerator of the polynomial in z is less than the order of its denominator (as it is in this case), and. all the poles of the z-transform are at different locations in the z-plane (as they are in this case), then we can write for the example we have been considering --z A ------------------------------------------------ A ---------------------- -- z + --z + ------------------------- -- z + --z where the as-yet undetermined coefficients are referred to as the residues of the z-transform, following the term used in complex calculus.

8-79 Lecture 9 otes -7- Fall, 005 In general, the residues A i corresponding to a pole at location z z i can be easily obtained using the formula A i ( z z i ) z zi For our example this becomes: A --z z -- --z -- ------------------- -- + --z -- z -- A + --z --z 6 ----------------------- -- + -- z z -- z -- Hence ---------------------- + ------------------------- -- z + --z and if we are told that the system is causal, then the corresponding inverse z-transform is hn [ ] -- n + ----- n un [ ] ote that the first samples of this function starting with by iteration. n 0 are, 0, and /8, as determined previously There are actually three possible inverse z-transforms transforms for this system function:. If the ROC is z > --, hn [ ] -- n + ----- n un [ ], as noted above. This system is causal and stable.. If the ROC is -- < z < --, hn [ ] -- n u[ n ] + ----- n un [ ]. This system neither causal nor stable.. If the ROC is z < --, hn [ ] -- n u[ n ] + ----- n u[ n ]. This system neither causal nor stable.

8-79 Lecture 9 otes -8- Fall, 005 Partial fractions with numerator order greater than or equal to denominator order: If the order of the numerator is too large, we can reduce it via long division. For example, if we have the transform z + z + z + 5 ---------------------------------------------------, we can apply long division as follows: z (Using ATLAB notation and setting in plain text to control positioning:) -z^(-)-z^(-)-(/) -z^(-)+ )z^(-)+z^(-)+ z^(-)+ 5 z^(-)+ z^(-) z^(-)+ z^(-) z^(-)- z^(-) z^(-)+ 5 z^(-)-(/) 7/ In other words, the result of this division operation is that Partial fractions with multiple poles in the same location: If we have multiple poles in the same location, the situation is more difficult. As described in the text, If we have s poles at location d in the z-plane, the contribution of the multiple pole to the partial-fraction of the z- transform is where z + z + z + 5 --------------------------------------------------- z z z d s k c k ------------------------------------- evaluated at ( s k)! ( d) s k --------------- dw s k ( dw ) s Hw ( ) w d In the general case, with some isolated poles, one set of multiple poles in the same location, and a polynomial of numerator order and denominator order, the z-transform would be of the form -- + ------------------- 7 z and the corresponding inverse z-transform equals δ[ n ] δ[ n ] -- plus whatever the inverse z-t 7 transform of ------------------- (which now has a denominator of higher order than the numerator) turns out to be. z s c k ------------------------ k ( dz )

8-79 Lecture 9 otes -9- Fall, 005 B r z r s A k + --------------------- r 0 k, k i d k z + c m ( d i z ) m m where d i is the location of the pole of multiplicity s. If there is more than one location with multiple poles, additional series of terms as in the latter term above will be obtained. We will discuss multiple poles in more detail in the Thursday lecture. Inverse z-transforms by long division Long division can also be used to obtain inverse z-transforms numerically. For example, consider again the transform --z ------------------------------------- --z + 8 --z Arranging the terms in order of increasing powers of z and dividing we obtain + 0z^(-)+(/8)z^(-)+. -(/)z^(-)-(/8)z^(-) ) -(/)z^(-)+ 0z^(-)+ 0z^(-)+ 0z^(-)+... -(/)z^(-)-(/8)z^(-) 0z^(-)+(/8)z^(-)+ 0z^(-) 0z^(-) - 0z^(-) + 0 z^(-) (/8)z^(-)+0 z^(-)+ 0z^(-) Hence, the first several terms of the quotient will be + 0z + 8 --z + which, if causal, has by inspection the inverse transform of Comment: hn [ ] δ[ n] + 0δ[ n ] + --δ [ n ] + 8 A left-sided inverse z-transform could be obtained in similar fashion by arranging the terms in the opposite order. This technique cannot be used to obtain both-sided inverse z-transforms. Inverse z-transforms by Taylor series expansion Occasionally we are asked to obtain the inverse z-transform of a function that is not a ratio of polynomials in z or z. Sometimes we can use Taylor series expansion to accomplish this.

8-79 Lecture 9 otes -0- Fall, 005 For example, the z-transform Xz ( ) + z ln ---------------- z with ROC z > can be obtained using series expansion: Xz ( ) + z ln ---------------- z z z z 5 z 7 + ------ + ------ + ------ + 5 7 The corresponding inverse is obtained easily by inspection as in the case of the results of long division.