The Z-transform, like many other integral transforms, can be defined as either a onesided or two-sided transform.

Similar documents
From Wikipedia, the free encyclopedia

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

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

(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

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

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

The Z transform (2) 1

Chapter 7: The z-transform

Need for transformation?

Generalizing the DTFT!

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ω

ESE 531: Digital Signal Processing

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)

Chapter 13 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).

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

ESE 531: Digital Signal Processing

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

Module 4 : Laplace and Z Transform Problem Set 4

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 )

Z Transform (Part - II)

Signals & Systems Handout #4

Ch.11 The Discrete-Time Fourier Transform (DTFT)

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

Signal Analysis, Systems, Transforms

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

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

Theory and Problems of Signals and Systems

6.003: Signals and Systems

ECE503: Digital Signal Processing Lecture 4

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

CH.6 Laplace Transform

Responses of Digital Filters Chapter Intended Learning Outcomes:

Discrete-Time Fourier Transform (DTFT)

Signals and Systems Lecture 8: Z Transform

Very useful for designing and analyzing signal processing systems

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.

Digital Signal Processing

Topic 4: The Z Transform

Review of Discrete-Time System

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

INTRODUCTION TO THE DFS AND THE DFT

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

EE-210. Signals and Systems Homework 7 Solutions

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

(i) Understanding the characteristics and properties of DTFT

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

ECE 438 Exam 2 Solutions, 11/08/2006.

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

z-transform Chapter 6

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

The Laplace Transform

Solutions: Homework Set # 5


Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

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

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

University of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing

DISCRETE FOURIER TRANSFORM

Question Paper Code : AEC11T02

Chapter 6: The Laplace Transform. Chih-Wei Liu

EE482: Digital Signal Processing Applications

An Fir-Filter Example: Hanning Filter

EE 225a Digital Signal Processing Supplementary Material

Digital Signal Processing. Midterm 1 Solution

Digital Signal Processing

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

Roll No. :... Invigilator s Signature :.. CS/B.Tech (EE-N)/SEM-6/EC-611/ DIGITAL SIGNAL PROCESSING. Time Allotted : 3 Hours Full Marks : 70

Modeling and Analysis of Systems Lecture #8 - Transfer Function. Guillaume Drion Academic year

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

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

GATE EE Topic wise Questions SIGNALS & SYSTEMS

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

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

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

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

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

Lecture Sketching the root locus

EE 521: Instrumentation and Measurements

Complex Variables. Instructions Solve any eight of the following ten problems. Explain your reasoning in complete sentences to maximize credit.

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

Give a geometric description of the set of points in space whose coordinates satisfy the given pair of equations.

Discrete Time Systems

Transform Analysis of Linear Time-Invariant Systems

! Review: Discrete Fourier Transform (DFT) ! DFT Properties. " Duality. " Circular Shift. ! Circular Convolution. ! Fast Convolution Methods

The Laplace Transform

Notes 22 largely plagiarized by %khc

Discrete-Time Fourier Transform

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

EEL3135: Homework #4

ECGR4124 Digital Signal Processing Final Spring 2009

B Elements of Complex Analysis

Physics 6303 Lecture 22 November 7, There are numerous methods of calculating these residues, and I list them below. lim

which has a check digit of 9. This is consistent with the first nine digits of the ISBN, since

Z-Transform. x (n) Sampler

Stability Condition in Terms of the Pole Locations

Analysis of Discrete-Time Systems

Transcription:

Z-transform Definition The Z-transform, like many other integral transforms, can be defined as either a onesided or two-sided transform. Bilateral Z-transform The bilateral or two-sided Z-transform of a discrete-time signal x[n] is the function X(z) defined as where n is an integer and z is, in general, a complex number: z = Ae jf (OR) z = A(cosf + jsinf ) where A is the magnitude of z, and f is the complex argument (also referred to as angle or phase) in radians. Unilateral Z-transform Alternatively, in cases where x[n] is defined only for n = 0, the single-sided or unilateral Z-transform is defined as In signal processing, this definition is used when the signal is causal. An important example of the unilateral Z-transform is the probability-generating function, where the component x[n] is the probability that a discrete random variable takes the value n, and the function X(z) is usually written as X(s), in terms of s = z - 1. The properties of Z-transforms (below) have useful interpretations in the context of probability theory. Inverse Z-transform The inverse Z-transform is

where is a counterclockwise closed path encircling the origin and entirely in the region of convergence (ROC). The contour or path,, must encircle all of the poles of. A special case of this contour integral occurs when is the unit circle (and can be used when the ROC includes the unit circle). The inverse Z-transform simplifies to the inverse discrete-time Fourier transform: The Z-transform with a finite range of n and a finite number of uniformly-spaced z values can be computed efficiently via Bluestein's FFT algorithm. The discrete-time Fourier transform (DTFT) (not to be confused with the discrete Fourier transform (DFT)) is a special case of such a Z-transform obtained by restricting z to lie on the unit circle. Region of convergence The region of convergence (ROC) is the set of points in the complex plane for which the Z-transform summation converges.. Example 1 (No ROC) Let. Expanding on the interval it becomes Looking at the sum Therefore, there are no such values of that satisfy this condition. Example 2 (causal ROC)

ROC shown in blue, the unit circle as a dotted grey circle and the circle shown as a dashed black circle is Let (where u is the Heaviside step function). Expanding on the interval it becomes Looking at the sum The last equality arises from the infinite geometric series and the equality only holds if which can be rewritten in terms of as. Thus, the ROC is. In this case the ROC is the complex plane with a disc of radius 0.5 at the origin "punched out". Example 3 (anticausal ROC)

ROC shown in blue, the unit circle as a dotted grey circle and the circle shown as a dashed black circle is Let on the interval (where u is the Heaviside step function). Expanding it becomes Looking at the sum Using the infinite geometric series, again, the equality only holds if which can be rewritten in terms of as. Thus, the ROC is. In this case the ROC is a disc centered at the origin and of radius 0.5. What differentiates this example from the previous example is only the ROC. This is intentional to demonstrate that the transform result alone is insufficient. Examples conclusion Examples 2 & 3 clearly show that the Z-transform of is unique when and only when specifying the ROC. Creating the pole-zero plot for the causal and anticausal case

show that the ROC for either case does not include the pole that is at 0.5. This extends to cases with multiple poles: the ROC will never contain poles. In example 2, the causal system yields an ROC that includes anticausal system in example 3 yields an ROC that includes. while the ROC shown as a blue ring In systems with multiple poles it is possible to have an ROC that includes neither nor. The ROC creates a circular band. For example, has poles at 0.5 and 0.75. The ROC will be, which includes neither the origin nor infinity. Such a system is called a mixed-causality system as it contains a causal term and an anticausal term. The stability of a system can also be determined by knowing the ROC alone. If the ROC contains the unit circle (i.e., ) then the system is stable. In the above systems the causal system (Example 2) is stable because contains the unit circle. If you are provided a Z-transform of a system without an ROC (i.e., an ambiguous ) you can determine a unique? Stability? Causality provided you desire the following: If you need stability then the ROC must contain the unit circle. If you need a causal system then the ROC must contain infinity and the system function will be a right-sided

sequence. If you need an anticausal system then the ROC must contain the origin and the system function will be a left-sided sequence. If you need both, stability and causality, all the poles of the system function must be inside the unit circle. The unique can then be found. Properties Properties of the z-transform Time domain Z-domain Proof ROC Notati on ROC: Linear ity At least the intersectio n of ROC 1 and ROC 2 Time shiftin g ROC, except if and if Scalin g in the z- domai n

Time revers al Compl ex conjug ation ROC Real part ROC Imagi nary part ROC Differe ntiatio n ROC Convo lution At least the intersectio n of ROC 1 and ROC 2 Correl ation At least the intersectio n of ROC

of X 1 (z) and X 2 (z - 1 ) First Differe nce At least the intersectio n of ROC of X 1 (z) and z > 0 Accum ulatio n At least the intersectio n of ROC of X 1 (z) and z > 1 Multip licatio n - Parsev al's relatio n? Initial value theorem? Final value theorem, If causal the unit circle, Only if poles of are inside Table of common Z-transform pairs

Here:? u[n]=1 for n>=0, u[n]=0 for n<0? d[n] = 1 for n=0, d[n] = 0 otherwise Signal, x[n] Z-transform, X(z) ROC 1 2 3 4 5 6 7 8

9 10 11 12 13 14 15 16 17 18

19 20