About Opentopia
Opentopia Directory Encyclopedia Tools

Z-transform

Encyclopedia : Z : ZT : ZTR : Z-transform

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

Z-transform is a placeholder name, akin to calling the Laplace transform the "s-transform". More accurate would be "Laurent transform", because it is based on the Laurent series. The (unilateral) Z-transform is to discrete time domain signals what the one-sided Laplace transform is to continuous time domain signals.

Contents

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

[X(z) = Z\ = \sum_^ x[n] z^ \ ]
where n is an integer and z is, in general, a complex number:
[ z= A e^ ]
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

[X(z) = Z\ = \sum_^ x[n] z^ \ ]
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

[ x[n] = Z^ \= \frac \oint_ X(z) z^ dz \ ]
where [ C \ ] is a counterclockwise closed path encircling the origin and entirely in the region of convergence (ROC). The contour or path, [ C \ ], must encircle all of the poles of [ X(z) \ ].

A special case of this contour integral that is simply that where [ C \ ] is the unit circle (and can be used when the ROC includes the unit circle) is the inverse Discrete-Time Fourier transform:

[ x[n] = \frac \int_^ X(e^) e^ d \omega \ ] .

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 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 where the Z-transform of a signal has a finite sum for a region in the complex plane.

[ROC = \^x[n]z^ < \infty\}\ ]

Example 1 (No ROC)

Let [x[n] = 0.5^n\ ]. Expanding [x[n]\ ] on [(-\infty, \infty)\ ] it becomes

[x[n] = \, 0.5^, 0.5^, 1, 0.5, 0.5^2, 0.5^3, ...\} = \\ ]
Looking at the sum

[\sum_^x[n]z^ < \infty\ ]
There are no such values of [z\ ] that satisfy this condition.

Example 2 ( Let [x[n] = 0.5^n u[n]\ ] (where [u] is the Heaviside step function). Expanding [x[n]\ ] on [(-\infty, \infty)\ ] it becomes

[x[n] = \\ ]
Looking at the sum

[\sum_^x[n]z^ = \sum_^0.5^nz^ = \sum_^\left(\frac\right)^n = \frac}\ ]
The last equality arises from the infinite geometric series and the equality only holds if [\left|0.5 z^\right| < 1\ ] which can be rewritten in terms of [z\ ] as [\left|z\right| > 0.5\ ]. Thus, the ROC is [\left|z\right| > 0.5\ ]. In this case the ROC is the complex plane with a disc of radius 0.5 at the origin "punched out".

Example 3 ( Let [x[n] = -(0.5)^n u[-n-1]\ ] (where [u] is the Heaviside step function). Expanding [x[n]\ ] on [(-\infty, \infty)\ ] it becomes

[x[n] = \, -(0.5)^, -(0.5)^, 0, 0, 0, ...\}\ ]
Looking at the sum

[\sum_^x[n]z^ = -\sum_^0.5^nz^ = -\sum_^\left(\frac\right)^\ ]
[= -\sum_^\left(\frac\right)^ = -\fracz}z} = \frac = \frac}\ ]
Using the infinite geometric series, again, the equality only holds if [\left|0.5^z\right| < 1\ ] which can be rewritten in terms of [z\ ] as [\left|z\right| < 0.5\ ]. Thus, the ROC is [\left|z\right| < 0.5\ ]. In this case the ROC is a disc centered at the origin and of radius 0.5.

Examples conclusion

Examples 2 & 3 clearly show that the Z-transform [X(z)\ ] of [x[n]\ ] 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 [\left| z \right| = \infty\ ] while the anticausal system in example 3 yields an ROC that includes [\left| z \right| = 0\ ].

In systems with multiple poles it is possible to have an ROC that includes neither [\left| z \right| = \infty\ ] nor [\left| z \right| = 0\ ]. The ROC creates a circular band. For example, [x[n] = 0.5^nu[n] - 0.75^nu[-n-1]\ ] has poles at 0.5 and 0.75. The ROC will be [0.5 < \left| z \right| < 0.75\ ], which includes neither the origin nor infinity. Such a system is called a mixed-causality system as it contains a causal term [0.5^nu[n]\ ] and an anticausal term [-(0.75)^nu[-n-1]\ ].

The stability of a system can also be determined by knowing the ROC alone. If the ROC contains the unit circle (i.e., [\left| z \right| = 1\ ]) then the system is stable. In the above systems the causal system is stable because [\left| z \right| > 0.5\ ] contains the unit circle.

If you are provided a Z-transform of a system without an ROC (i.e., an ambiguous [x[n]\ ]) you can determine a unique [x[n]\ ] 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. If you need an anticausal system then the ROC must contain the origin.

The unique [x[n]\ ] can then be found.

Properties


!
! Time domain
	! Z-domain

! ROC


! Notation
	| [x[n]=\mathcal^\]
	| [X(z)=\mathcal\]
	| ROC: [r_2<|z|
! Linearity
	| [a_1 x_1[n] + a_2 x_2[n]\ ]
	| [a_1 X_1(z) + a_2 X_2(z) \ ]
	| At least the intersection of ROC1 and ROC2

! Time shifting
	| [x[n-k]\ ]
	| [z^X(z) \ ]
	| ROC, except [z=0\ ] if [k>0\,] and [z=\infty] if [k<0\ ]


! Scaling in the z-domain
	| [a^n x[n]\ ]
	| [X(a^z) \ ]
	| [|a|r_2<|z|<|a|r_1 \ ]


! Time reversal
	| [x[-n]\ ]
	| [X(z^) \ ]
	| [\frac<|z|<\frac \ ]


! Conjugation
	| [x^*[n]\ ]
	| [X^*(z^*) \ ]
	| ROC


! Real part
	| [\operatorname\\ ]
	| [\frac\left[X(z)+X^*(z^*) right]]
	| ROC


! Imaginary part
	| [\operatorname\\ ]
	| [\frac\left[X(z)-X^*(z^*) right]]
	| ROC


! Differentiation
	| [nx[n]\ ]
	| [ -z \fracX(z)}z}]
	| ROC


! Convolution	| [x_1[n] * x_2[n]\ ]
	| [X_1(z)X_2(z) \ ]
	| At least the intersection of ROC1 and ROC2

! Correlation	| [r_(l)=x_1[l] * x_2[-l]\ ]
	| [R_(z)=X_1(z)X_2(z^)\ ]
	| At least the intersection of ROC of X1(z) and X2([z^])


! Multiplication
	|  [x_1[n]x_2[n]\ ]
	| [\frac\oint_C X_1(v)X_2(\frac)v^\mathrmv \ ]
	| At least [r_r_<|z|
! Parseval's relation	|  [\sum^\infty x_1[n]x^*_2[n]\ ]
	| [\frac\oint_C X_1(v)X^*_2(\frac)v^\mathrmv \ ]
	|



 Properties of the z-transform












:[x[0]=\lim_X(z) \ ], If [x[n]\,] causal



: [x[infty]=\lim_(z-1)X(z) \ ], Only if poles of [(z-1)X(z) \ ]	 are inside unit circle



Table of common Z-transform pairs




 
 Signal, [x[n]] 
 Z-transform, [X(z)] 
 ROC


 1 
 [\delta[n] \, ] 
 [1\, ] 
[ \mboxz\, ]


 2 
 [\delta[n-n_0] \,] 
 [ \frac}] 
 [\mboxz\,]


 3 
 [u[n] \,] 
 [ \frac] 
z| > 1\,]


 4 
 [a^n u[n] \,] 
  [ \frac}] 
z| > |a|\,]


 5 
 [n a^n u[n] \,] 
  [ \frac })^2 }] 
z| > |a|\,]


 6 
 [-a^n u[-n-1] \,] 
  [ \frac}] 
z| < |a|\,]


 7 
 [-n a^n u[-n-1] \,] 
  [ \frac })^2 }] 
z| < |a|\,]


 8 
 [\cos(\omega_0 n) u[n] \,] 
  [ \frac \cos(\omega_0) }\cos(\omega_0)+ z^ }] 
z| >1\,]


 9 
 [\sin(\omega_0 n) u[n] \,] 
  [ \frac \sin(\omega_0) }\cos(\omega_0)+ z^ }] 
z| >1\,]


 10 
 [a^n \cos(\omega_0 n) u[n] \,] 
  [ \frac \cos( \omega_0) }\cos(\omega_0)+ a^2 z^ }] 
z| > |a|\,]


 11 
 [a^n \sin(\omega_0 n) u[n] \,] 
  [ \frac \sin(\omega_0) }\cos(\omega_0)+ a^2 z^ }] 
z| > |a|\,]




Relationship to Laplace

The bilateral Z-transform is simply the two-sided Laplace transform of the ideal sampled function 



:[  x(t) \sum_^ \delta(t-nT) = \sum_^ x[n] \delta(t-nT) \ ]



where [ x(t) \ ] is the continuous-time function being sampled, [ x[n]=x(nT) \ ] the nth sample, [ T \ ] is the sampling period, and with the substitution: [ z = e^ \ ].


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) ]  :


[  s =\frac \frac  ] from Laplace to z;



[  z =\frac ] from z to Laplace.



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 [X(z)\ ] at [z=e^\ ] 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.



[\sum_^y[n-p]\alpha_ = \sum_^x[n-q]\beta_\ ]



Both sides of the above equation can be divided by [\alpha_0 \ ], if it is not zero, normalizing [\alpha_0 = 1\ ] and the LCCD equation can be written



[y[n] = \sum_^x[n-q]\beta_ - \sum_^y[n-p]\alpha_\ ]



This form of the LCCD equation is favorable to make it more explicit that the "current" output [y[]\ ] is a function of past outputs [y[]\ ], current input [x[]\ ], and previous inputs [x[]\ ].



Transfer function

Taking the Z-transform of the equation yields



[Y(z) \sum_^z^\alpha_ = X(z) \sum_^z^\beta_\ ]



and rearranging results in



[H(z) = \frac = \frac^z^\beta_}^z^\alpha_} = \frac \beta_1 + z^ \beta_2 + ... + z^ \beta_M} \alpha_1 + z^ \alpha_2 + ... + z^ \alpha_N}\ ]




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



[H(z) = \frac)(1 - q_2 z^)...(1 - q_M z^) } )(1 - p_2 z^)...(1 - p_N z^)}\ ]



Where [q_k\ ] is the [k^\ ] zero and [p_k\ ] is the [k^\ ] pole.  The zeros and poles are commonly complex and when plotted on the complex 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.


In addition, there may also exist zeros and poles at [z=0] and [z=\infty]. 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 [H(z)\ ] is driven by a signal [X(z)\ ] then the output is [Y(z) = H(z)X(z)\ ].  By performing partial fraction decomposition on [Y(z)\ ] and then taking the inverse Z-transform the output [y[n]\ ] can be found.



See also



Bibliography




External links
























 





From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.














Search Titles









0123456789
ABCDEFGHIJ
KLMNOPQRST
UVWXYZ?










E-mail this article to:



Personal Message: