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.
The Z-transform, like many other integral transforms, can be defined as either a ''one-sided'' or ''two-sided'' transform.
The ''bilateral'' or ''two-sided'' Z-transform of a discrete-time signal ''x {Link without Title} '' is the function ''X(z)'' defined as
:
where ''n'' is an integer and ''z'' is, in general, a Complex Number :
:
:where ''A'' is the magnitude of ''z'', and φ is the Angular Frequency (in Radians per Sample ).
Alternatively, in cases where ''x'' {Link without Title} 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 {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.
The 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 that is simply that where is the unit circle (and can be used when the ROC includes the unit circle) is the :
: .
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.
The region of Convergence (ROC) is where the Z-transform of a signal has a finite sum for a region in the complex plane.
:
Let . Expanding on it becomes
:
Looking at the sum
:
There are no such values of that satisfy this condition.
Let (where is the Heaviside Step Function ). Expanding on it becomes
:
Looking at the sum
:
|
|   |
\infty\ </math> while the anticausal system in example 3 yields an ROC that includes <math>\left z
ight = 0\ </math>
|
|   |
\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>
|
|   |
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
|
|   |
"n" class="copylinks" target="_blank">{Link without Title} \,</math> <math> rac{az^{-1} }{ (1-a z^{-1})^2 }</math> <math>z > a\,</math>
|
|   |
"-n-1" class="copylinks" target="_blank">{Link without Title} \,</math> <math> rac{az^{-1} }{ (1-a z^{-1})^2 }</math> <math> z < a\,</math>
|
|   |
"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>
|
|   |
"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>
|
|   |
"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>
|
|   |
"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>
|
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
:
Where
is the
zero and
is the
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
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.
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.
- 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-41161-979-X.