From Wikipedia, the free encyclopedia

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

(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

The goal of the Wiener filter is to filter out noise that has corrupted a signal. It is based on a statistical approach.

信號與系統 Signals and Systems

Bessel function - Wikipedia, the free encyclopedia

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

Digital Signal Processing

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

Theory and Problems of Signals and Systems

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

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

Module 4 : Laplace and Z Transform Problem Set 4

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

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

Chapter 7: The z-transform

An Fir-Filter Example: Hanning Filter

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) =

Spectrum (functional analysis) - Wikipedia, the free encyclopedia

Biomedical Signal Processing and Signal Modeling

Very useful for designing and analyzing signal processing systems

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

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

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ω

Generalizing the DTFT!

B Elements of Complex Analysis

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

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)

Lecture 04: Discrete Frequency Domain Analysis (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

Topic 4: The Z Transform

Transform Representation of Signals

INTRODUCTION TO THE DFS AND THE DFT

ECE503: Digital Signal Processing Lecture 4

E : Lecture 1 Introduction

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Discrete Time Systems

The Laplace Transform

Need for transformation?

EEL3135: Homework #4

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

PS403 - Digital Signal processing

The Laplace Transform

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

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

ESE 531: Digital Signal Processing

The Continuous-time Fourier

The Discrete-time Fourier 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).

Solutions: Homework Set # 5

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

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 )

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

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

Discrete-Time Fourier Transform (DTFT)

DISCRETE-TIME SIGNAL PROCESSING

Digital Signal Processing:

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

Signals & Systems Handout #4

Responses of Digital Filters Chapter Intended Learning Outcomes:

Some of the different forms of a signal, obtained by transformations, are shown in the figure. jwt e z. jwt z e

The Laplace Transform

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.

Chapter 6: The Laplace Transform. Chih-Wei Liu

Advanced Digital Signal Processing -Introduction

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

Computer Engineering 4TL4: Digital Signal Processing

2.161 Signal Processing: Continuous and Discrete Fall 2008

ESE 531: Digital Signal Processing

(i) Understanding the characteristics and properties of DTFT

Grades will be determined by the correctness of your answers (explanations are not required).

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

# 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.

EE482: Digital Signal Processing Applications

Signals and Systems Lecture 8: Z Transform

Chapter 13 Z Transform

Grades will be determined by the correctness of your answers (explanations are not required).

Review of Discrete-Time System

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

GATE EE Topic wise Questions SIGNALS & SYSTEMS

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

Linear Convolution Using FFT

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

INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER

EE482: Digital Signal Processing Applications

EE-210. Signals and Systems Homework 7 Solutions

A.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =

Fall 2011, EE123 Digital Signal Processing

2.161 Signal Processing: Continuous and Discrete Fall 2008

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

Identification Methods for Structural Systems

Notes 22 largely plagiarized by %khc

Question Paper Code : AEC11T02

Z Transform (Part - II)

Signal Analysis, Systems, Transforms

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

6.003: Signals and Systems

Lecture 28 Continuous-Time Fourier Transform 2

Transcription:

Z-transform - Wikipedia, the free encyclopedia Z-transform Page 1 of 7 From Wikipedia, the free encyclopedia In mathematics and signal processing, the Z-transform converts a discrete time domain signal, which is a sequence of real numbers, into a complex frequency domain representation. The Z-transform and advanced Z-transform were introduced (under the Z-transform name) by E. I. Jury in 1958 in Sampled-Data Control Systems (John Wiley & Sons). The idea contained within the Z-transform was previously known as the "generating function method". The (unilateral) Z-transform is to discrete time domain signals what the one-sided Laplace transform is to continuous time domain signals. Contents 1 Definition 1.1 Bilateral Z-Transform 1.2 Unilateral Z-Transform 2 Inverse Z-Transform 3 Region of convergence 3.1 Example 1 (No ) 3.2 Example 2 (causal ) 3.3 Example 3 (anticausal ) 3.4 Examples conclusion 4 Properties 5 Table of common Z-transform pairs 6 Relationship to Laplace 7 Relationship to Fourier 8 Linear constant coefficient difference equation 8.1 Transfer function 8.2 Zeros and poles 8.3 Output response 9 See also 10 Bibliography 11 External links Definition The Z-transform, like many other integral transforms, can be defined as either a one-sided 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 jφ where A is the magnitude of z, and φ is the angular frequency (in radians per sample). 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

Page 2 of 7 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 (). 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 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 confuse 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 () is where the Z-transform of a signal has a finite sum for a region in the complex plane. Example 1 (No ) Let. Expanding on the interval it becomes Looking at the sum There are no such values of that satisfy this condition. Example 2 (causal ) Let (where u is the Heaviside step function). Expanding on the interval it becomes

Page 3 of 7 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 is. In this case the is the complex plane with a disc of radius 0.5 at the origin "punched out". Example 3 (anticausal ) Let (where u is the Heaviside step function). Expanding on the interval 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 is. In this case the is a disc centered at the origin and of radius 0.5. Examples conclusion Examples 2 & 3 clearly show that the Z-transform of is unique when and only when specifying the. Creating the pole-zero plot for the causal and anticausal case show that the for either case does not include the pole that is at 0.5. This extends to cases with multiple poles: the will never contain poles. In example 2, the causal system yields an that includes that includes. while the anticausal system in example 3 yields an In systems with multiple poles it is possible to have an that includes neither nor. The creates a circular band. For example, has poles at 0.5 and 0.75. The 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 alone. If the contains the unit circle (i.e., ) then the system is stable. In the above systems the causal system is stable because contains the unit circle. If you are provided a Z-transform of a system without an (i.e., an ambiguous provided you desire the following: ) you can determine a unique Stability Causality

Page 4 of 7 If you need stability then the must contain the unit circle. If you need a causal system then the must contain infinity. If you need an anticausal system then the must contain the origin. The unique can then be found. Properties Properties of the z-transform Time domain Z-domain Notation Linearity : At least the intersection of 1 and 2 Time shifting, except and if if Scaling in the z- domain Time reversal Conjugation Real part Imaginary part Differentiation Convolution Correlation Multiplication At least the intersection of 1 and 2 At least the intersection of of X 1 (z) and X 2 (z 1 ) At least Parseval's relation Initial value theorem, If causal Final value theorem Table of common Z-transform pairs Signal, x[n] Z-transform, X(z), Only if poles of are inside the unit circle

Page 5 of 7 1 2 3 4 5 6 7 8 9 10 11 Relationship to Laplace The bilateral Z-transform is simply the two-sided Laplace transform of the ideal sampled function where is the continuous-time function being sampled, the n th sample, is the sampling period, and with the substitution:. Likewise the unilateral Z-transform is simply the one-sided Laplace transform of the ideal sampled function. Both assume that the sampled function is zero for all negative time indices. The Bilinear transform is a useful approximation for converting continuous time filters (represented in Laplace space) into discrete time filters (represented in z space), and vice versa. To do this, you can use the following substitutions in H(s) or H(z) : from Laplace to z (Tustin transformation); from z to Laplace.

Page 6 of 7 Relationship to Fourier The Z-transform is a generalization of the discrete time fourier transform (DTFT). The DTFT can be found by evaluating the Z- transform at or, in other words, evaluated on the unit circle. In order to determine the frequency response of the system the Z-transform must be evaluated on the unit circle, meaning that the system's region of convergence must contain the unit circle. Otherwise, the DTFT of the system does not exist. Linear constant coefficient difference equation The linear constant coefficient difference (LCCD) equation is a representation for a linear system based on the autoregressive moving average equation. Both sides of the above equation can be divided by, if it is not zero, normalizing and the LCCD equation can be written This form of the LCCD equation is favorable to make it more explicit that the "current" output, current input, and previous inputs. is a function of past outputs Transfer function Taking the Z-transform of the equation yields and rearranging results in Zeros and poles From the fundamental theorem of algebra the numerator has M roots (called zeros) and the denominator has N roots (called poles). Rewriting the transfer function in terms of poles and zeros Where is the zero and is the pole. The zeros and poles are commonly complex and when plotted on the complex plane (z-plane) it is called the pole-zero plot. In simple words, zeros are the solutions to the equation obtained by setting the numerator equal to zero, while poles are the solutions to the equation obtained by setting the denominator equal to zero.

Page 7 of 7 In addition, there may also exist zeros and poles at z = 0 and. If we take these poles and zeros as well as multiple-order zeros and poles into consideration, the number of zeros and poles are always equal. By factoring the denominator, partial fraction decomposition can be used, which can then be transformed back to the time domain. Doing so would result in the impulse response and the linear constant coefficient difference equation of the system. Output response If such a system is driven by a signal then the output is. By performing partial fraction decomposition on and then taking the inverse Z-transform the output can be found. In practice, it is often useful to fractionally decompose before multiplying that quantity by to generate a form of which has terms with easily computable inverse Z-transforms. See also Zeta function regularization Advanced Z-transform Formal power series Laplace transform Bibliography Eliahu Ibrahim Jury, Theory and Application of the Z-Transform Method, Krieger Pub Co, 1973. ISBN 0-88275-122-0. Refaat El Attar, Lecture notes on Z-Transform, Lulu Press, Morrisville NC, 2005. ISBN 1-4116-1979-X. External links Mathworld's entry on the Z-transform (http://mathworld.wolfram.com/z-transform.html) Z-Transform threads in Comp.DSP (http://www.dsprelated.com/comp.dsp/keyword/z_transform.php) Z-Transform Module by John H. Mathews (http://math.fullerton.edu/mathews/c2003/ztransformintromod.html) Retrieved from "" Category: Transforms This page was last modified 19:18, 20 December 2006. All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.) Wikipedia is a registered trademark of the Wikimedia Foundation, Inc.