Information About

Z-transform




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.


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 {Link without Title} '' is the function ''X(z)'' defined as

:X(z) = Z\{x = \sum_{n=-\infty}^{\infty} x[n z^{-n} \

where ''n'' is an integer and ''z'' is, in general, a Complex Number :
: z= A e^{j\phi}
:where ''A'' is the magnitude of ''z'', and φ is the Angular Frequency (in Radians per Sample ).


Unilateral Z-Transform


Alternatively, in cases where ''x'' {Link without Title} is defined only for ''n'' ≥ 0, the ''single-sided'' or ''unilateral'' Z-transform is defined as

:X(z) = Z\{x = \sum_{n=0}^{\infty} x[n z^{-n} \

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 {Link without Title} '' 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 {Link without Title} = Z^{-1} \{X(z) \}= rac{1}{2 \pi j} \oint_{C} X(z) z^{n-1} 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 {Link without Title} = rac{1}{2 \pi} \int_{-\pi}^{+\pi} X(e^{j \omega}) e^{j \omega n} 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 = \{z : \sum_{n=-\infty}^{\infty}x {Link without Title} z^{-n} < \infty\}\


Example 1 (No ROC)

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

:x {Link without Title} = \{..., 0.5^{-3}, 0.5^{-2}, 0.5^{-1}, 1, 0.5, 0.5^2, 0.5^3, ...\} = \{..., 2^3, 2^2, 2, 1, 0.5, 0.5^2, 0.5^3, ...\}\

Looking at the sum

:\sum_{n=-\infty}^{\infty}x {Link without Title} z^{-n} < \infty\

There are no such values of z\ that satisfy this condition.


Example 2 ( Causal ROC)

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

:x {Link without Title} = \{..., 0, 0, 0, 1, 0.5, 0.5^2, 0.5^3, ...\}\

Looking at the sum

:\sum_{n=-\infty}^{\infty}x {Link without Title} z^{-n} = \sum_{n=0}^{\infty}0.5^nz^{-n} = \sum_{n=0}^{\infty}\left( rac{0.5}{z} ight)^n = rac{1}{1 - 0.5z^{-1}}\



  In Example 2, The Causal System Yields An ROC That Includes <math>\left Z Ight \infty\ </math> while the anticausal system in example 3 yields an ROC that includes <math>\left z ight = 0\ </math>
  In Systems With Multiple Poles It Is Possible To Have An ROC That Includes Neither <math>\left Z Ight \infty\ </math> nor <math>\left z ight = 0\ </math> The ROC creates a circular band For example, <math>x = 05^nu[n - 075^nu </math> has poles at 05 and 075 The ROC will be <math>05 < \left z ight < 075\ </math>, which includes neither the origin nor infinity Such a system is called a Mixed-causality system as it contains a causal term <math>05^nu[n \ </math> and an anticausal term <math>-(075)^nu[-n-1]\ </math>
  The Stability Of A System Can Also Be Determined By Knowing The ROC Alone If The ROC Contains The Unit Circle (ie, <math>\left Z Ight 1\ </math>) then the system is stable In the above systems the causal system is stable because <math>\left z ight > 05\ </math> contains the unit circle



TABLE OF COMMON Z-TRANSFORM PAIRS




  4 <math>n A^n U "n" class="copylinks" target="_blank">{Link without Title} \,</math> <math> rac{az^{-1} }{ (1-a z^{-1})^2 }</math> <math>z > a\,</math>


  6 <math>-n A^n U "-n-1" class="copylinks" target="_blank">{Link without Title} \,</math> <math> rac{az^{-1} }{ (1-a z^{-1})^2 }</math> <math> z < a\,</math>
  7 <math>\cos(\omega 0 N) U "n" class="copylinks" target="_blank">{Link without Title} \,</math> <math> rac{ 1-z^{-1} \cos(\omega_0) }{ 1-2z^{-1}\cos(\omega_0)+ z^{-2} }</math> <math> z >1\,</math>
  8 <math>\sin(\omega 0 N) U "n" class="copylinks" target="_blank">{Link without Title} \,</math> <math> rac{ z^{-1} \sin(\omega_0) }{ 1-2z^{-1}\cos(\omega_0)+ z^{-2} }</math> <math> z >1\,</math>
  9 <math>a^n \cos(\omega 0 N) U "n" class="copylinks" target="_blank">{Link without Title} \,</math> <math> rac{ 1-a z^{-1} \cos( \omega_0) }{ 1-2az^{-1}\cos(\omega_0)+ a^2 z^{-2} }</math> <math> z > a\,</math>
  10 <math>a^n \sin(\omega 0 N) U "n" class="copylinks" target="_blank">{Link without Title} \,</math> <math> rac{ az^{-1} \sin(\omega_0) }{ 1-2az^{-1}\cos(\omega_0)+ a^2 z^{-2} }</math> <math> z > a\,</math>






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) = rac{(1 - q_1 z^{-1})(1 - q_2 z^{-1})...(1 - q_M z^{-1}) } { (1 - p_1 z^{-1})(1 - p_2 z^{-1})...(1 - p_N z^{-1})}\

Where q_k\ is the k^{th}\ zero and p_k\ is the k^{th}\ 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 {Link without Title} \ can be found.


SEE ALSO



BIBLIOGRAPHY




EXTERNAL LINKS