Z Transform
Z Transform
Z-transform
In mathematics and signal processing, the Z-transform converts a discrete time-domain signal, which is a sequence of real or complex numbers, into a complex frequency-domain representation. It can be considered as a discrete-time equivalent of the Laplace transform. This similarity is explored in the theory of time scale calculus.
History
The basic idea now known as the Z-transform was known to Laplace, and re-introduced in 1947 by W. Hurewicz as a tractable way to solve linear, constant-coefficient difference equations.[1] It was later dubbed "the z-transform" by Ragazzini and Zadeh in the sampled-data control group at Columbia University in 1952.[2][3] The modified or advanced Z-transform was later developed and popularized by E. I. Jury.[4][5] The idea contained within the Z-transform is also known in mathematical literature as the method of generating functions which can be traced back as early as 1730 when it was introduced by de Moivre in conjunction with probability theory.[6] From a mathematical view the Z-transform can also be viewed as a Laurent series where one views the sequence of numbers under consideration as the (Laurent) expansion of an analytic function.
Definition
The Z-transform, like many 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 formal power series X(z) defined as
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 can be used to evaluate the Z-transform of the unit impulse response of a discrete-time causal system. An important example of the unilateral Z-transform is the probability-generating function, where the component is the probability that a discrete random variable takes the value , and the function is usually written as , in terms of . The properties of Z-transforms (below) have useful interpretations in the context of probability theory.
Z-transform
Geophysical definition
In geophysics, the usual definition for the Z-transform is a power series in as opposed to . This convention is used by Robinson and Treitel and by Kanasewich. The geophysical definition is
The two definitions are equivalent; however, the difference results in a number of changes. For example, the location of zeros and poles move from inside the unit circle using one definition, to outside the unit circle using the other definition. Thus, care is required to note which definition is being used by a particular author.
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). In must encircle all of the poles of . is the unit circle (and can be used when the ROC includes the is stable, i.e. all the poles are within the unit circle). The inverse
the case where the ROC is causal (see Example 2), this means the path A special case of this contour integral occurs when unit circle which is always guaranteed when
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.
Z-transform
The last equality arises from the infinite geometric series and the equality only holds if which can be rewritten in terms of Thus, the ROC is as .
the complex plane with a disc of radius 0.5 at the origin "punched out".
ROC shown in blue, the unit circle as a dotted grey circle (appears reddish to the eye) and the circle is shown as a dashed black circle
Using the infinite geometric series, again, the equality only holds if which can be rewritten in terms of as . Thus, the ROC is
ROC shown in blue, the unit circle as a dotted grey circle and the circle is shown as a dashed black circle
. 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.
Z-transform
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 yields an ROC that includes . 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 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. provided you desire the following:
ROC shown as a blue ring
Properties
Properties of the z-transform
Time domain Notation Z-domain Proof ROC: ROC
Linearity
Z-transform
5
R^{1/k} : integer
Time expansion
Time shifting
Time reversal
Complex conjugation
ROC
ROC ROC
Differentiation
ROC
Convolution
Cross-correlation
First difference
Accumulation
Multiplication
Z-transform
Parseval's relation
Initial value theorem , If Final value theorem , Only if poles of are inside the unit circle causal
Both are usually not considered as true functions but as distributions due to their discontinuity (their value on n=0 usually does not really matter, except when working in discrete time, in which case they become degenerate discrete series ; in this section they are chosen to take the value 1 on n=0, both for the continuous and discrete time domains, otherwise the content of the ROC column below would not apply). The two "functions" are chosen together so that the unit step function is the integral of the unit impulse function (in the continuous time domain), or the summation of the unit impulse function is the unit step function (in the discrete time domain), hence the choice of making their value on n=0 fixed here to 1.
Signal, 1 2 3 4 5 6 Z-transform, ROC
10
11
12
Z-transform
7
13 14
15
16
17
18
19
20
21
from z to Laplace. Through the bilinear transformation, the complex s-plane (of the Laplace transform) is mapped to the complex z-plane (of the z-transform). While this mapping is (necessarily) nonlinear, it is useful in that it maps the entire axis of the s-plane onto the unit circle in the z-plane. As such, the Fourier transform (which is the Laplace transform evaluated on the Fourier transform exists; i.e., that the axis) becomes the discrete-time Fourier transform. This assumes that the axis is in the region of convergence of the Laplace transform.
Process of sampling
Consider a continuous time signal . Its one sided Laplace transform is defined as :
where
Now the Laplace transform of the sampled signal (discrete time) is called Star transform and is given by:
Z-transform
It can be seen that the Laplace transform of an impulse sampled signal is the star transform and is the same as the Z transform of the corresponding sequence when . Similar relationship holds when a continuous time system is converted into a sampled data system by cascading an actual impulse sampler at the input and a fictitious impulse sampler at the output.[7]
Both sides of the above equation can be divided by equation can be written
This form of the LCCD equation is favorable to make it more explicit that the "current" output past outputs , current input , and previous inputs .
is a function of
Transfer function
Taking the Z-transform of the above equation (using linearity and time-shifting laws) yields
Z-transform
where
is the
zero and
is the
pole. The zeros and poles are commonly complex and when plotted on and . If we take these poles and zeros as well as
the complex plane (z-plane) it is called the pole-zero plot. In addition, there may also exist zeros and poles at 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 can be found. In to generate a form partial fraction decomposition on and then taking the inverse Z-transform the output before multiplying that quantity by
References
[1] E. R. Kanasewich (1981). Time sequence analysis in geophysics (http:/ / books. google. com/ books?id=k8SSLy-FYagC& pg=PA185) (3rd ed.). University of Alberta. pp.185186. ISBN978-0-88864-074-1. . [2] J. R. Ragazzini and L. A. Zadeh (1952). "The analysis of sampled-data systems". Trans. Am. Inst. Elec. Eng. 71 (II): 225234. [3] Cornelius T. Leondes (1996). Digital control systems implementation and computational techniques (http:/ / books. google. com/ books?id=aQbk3uidEJoC& pg=PA123). Academic Press. p.123. ISBN978-0-12-012779-5. . [4] Eliahu Ibrahim Jury (1958). Sampled-Data Control Systems. John Wiley & Sons. [5] Eliahu Ibrahim Jury (1973). Theory and Application of the Z-Transform Method. Krieger Pub Co. ISBN0-88275-122-0. [6] Eliahu Ibrahim Jury (1964). Theory and Application of the Z-Transform Method. John Wiley & Sons. p.1. [7] Ogata, Katsuhiko. Discrete-Time Control Systems. India: Pearson Education. pp.7577,98103. ISBN81-7808-335-3.
Further reading
Refaat El Attar, Lecture notes on Z-Transform, Lulu Press, Morrisville NC, 2005. ISBN 1-4116-1979-X. Ogata, Katsuhiko, Discrete Time Control Systems 2nd Ed, Prentice-Hall Inc, 1995, 1987. ISBN 0-13-034281-5. Alan V. Oppenheim and Ronald W. Schafer (1999). Discrete-Time Signal Processing, 2nd Edition, Prentice Hall Signal Processing Series. ISBN 0-13-754920-2.
External links
Hazewinkel, Michiel, ed. (2001), "Z-transform" (http://www.encyclopediaofmath.org/index.php?title=p/ z130010), Encyclopedia of Mathematics, Springer, ISBN978-1-55608-010-4 Z-Transform table of some common Laplace transforms (http://www.swarthmore.edu/NatSci/echeeve1/Ref/ LPSA/LaplaceZTable/LaplaceZFuncTable.html) 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)
10
License
Creative Commons Attribution-Share Alike 3.0 Unported //creativecommons.org/licenses/by-sa/3.0/