In mathematics and signal processing, the Z-transform converts a discrete-time signal, which is a sequence of real or complex numbers, into a complex valued frequency-domain (the z-domain or z-plane) representation.
It can be considered a discrete-time counterpart of the Laplace transform (the s-domain or s-plane). This similarity is explored in the theory of time-scale calculus.
While the continuous-time Fourier transform is evaluated on the s-domain's vertical axis (the imaginary axis), the discrete-time Fourier transform is evaluated along the z-domain's unit circle. The s-domain's left half-plane maps to the area inside the z-domain's unit circle, while the s-domain's right half-plane maps to the area outside of the z-domain's unit circle.
In signal processing, one of the means of designing digital filters is to take analog designs, subject them to a bilinear transform which maps them from the s-domain to the z-domain, and then produce the digital filter by inspection, manipulation, or numerical approximation. Such methods tend not to be accurate except in the vicinity of the complex unity, i.e. at low frequencies.
History
The basic idea now known as the Z-transform was known to Laplace, and it was re-introduced in 1947 by W. Hurewicz and others as a way to treat sampled-data control systems used with radar. It gives a tractable way to solve linear, constant-coefficient difference equations. It was later dubbed "the z-transform" by Ragazzini and Zadeh in the sampled-data control group at Columbia University in 1952.
The modified or advanced Z-transform was later developed and popularized by E. I. Jury.
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. 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 can be defined as either a one-sided or two-sided transform (similarly to the one-sided Laplace transform and the two-sided Laplace transform).
Bilateral Z-transform
The bilateral or two-sided Z-transform of a discrete-time signal <math>x[n]</math> is the formal power series <math>X(z)</math> defined as:
where <math>n</math> is an integer and <math>z</math> is, in general, a complex number. In polar form, <math>z</math> may be written as:
: <math>z = A e^{i\phi} = A\cdot(\cos{\phi}+i\sin{\phi})</math>
where <math>A</math> is the magnitude of , <math>i</math> is the imaginary unit, and <math>\phi</math> is the complex argument (also referred to as angle or phase) in radians.
Unilateral Z-transform
Alternatively, in cases where <math>x[n]</math> is defined only for , 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 <math>x[n]</math> is the probability that a discrete random variable takes the value . The properties of Z-transforms (listed in ') have useful interpretations in the context of probability theory.
Inverse Z-transform
The inverse Z-transform is:
where <math>C</math> is a counterclockwise closed path encircling the origin and entirely in the region of convergence (ROC). In the case where the ROC is causal (see Example 2), this means the path <math>C</math> must encircle all of the poles of .
A special case of this contour integral occurs when <math>C</math> is the unit circle. This contour can be used when the ROC includes the unit circle, which is always guaranteed when <math>X(z)</math> is stable, that is, when all the poles are inside the unit circle. With this contour, the inverse Z-transform simplifies to the inverse discrete-time Fourier transform, or Fourier series, of the periodic values of the Z-transform around the unit circle:
The Z-transform with a finite range of <math>n</math> and a finite number of uniformly spaced <math>z</math> 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 <math>z</math> to lie on the unit circle.
The following three methods are often used for the evaluation of the inverse -transform,
Direct evaluation by contour integration
This method involves applying the Cauchy Residue Theorem to evaluate the inverse Z-transform. By integrating around a closed contour in the complex plane, the residues at the poles of the Z-transform function inside the ROC are summed. This technique is particularly useful when working with functions expressed in terms of complex variables.
Expansion into a series of terms in the variables z and z<sup>−1</sup>
In this method, the Z-transform is expanded into a power series. This approach is useful when the Z-transform function is rational, allowing for the approximation of the inverse by expanding into a series and determining the signal coefficients term by term.
Partial-fraction expansion and table lookup
This technique decomposes the Z-transform into a sum of simpler fractions, each corresponding to known Z-transform pairs. The inverse Z-transform is then determined by looking up each term in a standard table of Z-transform pairs. This method is widely used for its efficiency and simplicity, especially when the original function can be easily broken down into recognizable components.
Example
A) Determine the inverse Z-transform of the following by series expansion method,
<math display=block>X(z) = \frac{1}{1 - 1.5\,z^{-1} + 0.5\,z^{-2</math>
Solution:
Case 1:
ROC: <math>\left\vert z \right\vert > 1</math>
Since the ROC is the exterior of a circle, <math>x(n)</math> is causal (signal existing for ).
<math display=block>X(z) = {1\over 1 - {3\over 2}z^{-1} + {1\over 2}z^{-2 = 1 + + + + + \ldots .</math>
Thus,
<math display=block>\begin{align}
x(n) &= \left\{1 , \frac{3}{2} , \frac{7}{4} , \frac{15}{8} , \frac{31}{16} \ldots \right\} \\
& \qquad\! \uparrow \\
\end{align}</math> (arrow indicates term at ).
Note that in each step of long division process we eliminate lowest power term of .
Case 2:
ROC: <math>\left\vert z \right\vert < 0.5</math>
Since the ROC is the interior of a circle, <math>x(n)</math> is anticausal (signal existing for ).
By performing long division we get
<math display=block>X(z) = \frac{1}{1 - \frac{3}{2}z^{-1} + \frac{1}{2}z^{-2} } = 2z^2 + 6z^3 +14z^4 + 30z^5 + \ldots</math>
: <math>\begin{align}
x(n) & = \{30, 14, 6, 2, 0, 0\} \\
& \qquad \qquad \qquad \quad\ \ \, \uparrow\\
\end{align}</math> (arrow indicates term at ).
Note that in each step of long division process we eliminate lowest power term of .
Note:
- When the signal is causal, we get positive powers of <math>z</math> and when the signal is anticausal, we get negative powers of .
- <math>z^k</math> indicates term at <math>x(-k)</math> and <math>z^{-k}</math> indicates term at .
B) Determine the inverse Z-transform of the following by series expansion method,
Eliminating negative powers if <math>z</math> and dividing by ,
<math display=block>\frac{X(z)}{z} = \frac{z^2}{z(z^2 - 1.5\,z + 0.5)} = \frac{z}{z^2 - 1.5\,z + 0.5} </math>
By partial fraction expansion,
<math display=block>\begin{align}
\frac{X(z)}{z} &= \frac{z}{(z-1)(z-0.5)} = \frac{A_1}{z-0.5} + \frac{A_2}{z-1} \\[4pt]
& A_1 = \left. \frac{(z-0.5) X(z)}{z} \right\vert_{z=0.5} = \frac{0.5}{(0.5-1)} = -1 \\[4pt]
& A_2 = \left. \frac{(z-1) X(z)}{z} \right\vert_{z=1} = \frac{1}{1-0.5} = {2} \\[4pt]
\frac{X(z)}{z} &= \frac{2}{z-1} - \frac{1}{z-0.5}
\end{align}</math>
Case 1:
ROC:<math>\left\vert z \right\vert > 1 </math>
Both the terms are causal, hence <math>x(n)</math> is causal.
<math display=block>\begin{align}
x(n) &= 2{(1)^n}u(n) - 1{(0.5)^n}u(n) \\
&= (2-(0.5)^n) u(n) \\
\end{align}</math>
Case 2:
ROC: <math>\left\vert z \right\vert < 0.5 </math>
Both the terms are anticausal, hence <math>x(n)</math> is anticausal.
<math>\begin{align}
x(n) &= -2{(1)^n}u(-n-1) - (-1{(0.5)^n}u(-n-1) ) \\
&= ((0.5)^n-2) u(-n-1) \\
\end{align}</math>
Case 3:
ROC: <math>0.5 < \left\vert z \right\vert < 1</math>
One of the terms is causal ( provides the causal part) and other is anticausal ( provides the anticausal part), hence <math>x(n)</math> is both sided.
<math>\begin{align}
x(n) &= -2{(1)^n}u(-n-1) - 1{(0.5)^n}u(n) \\
&= -2u(-n-1) - (0.5)^n u(n) \\
\end{align}</math>
Region of convergence
The region of convergence (ROC) is the set of points in the complex plane for which the Z-transform summation absolutely converges:
: <math>\mathrm{ROC} = \left\{ z : \sum_{n=-\infty}^{\infty} \left| x[n]z^{-n}\right| < \infty \right\} </math>
Example 1 (no ROC)
Let . Expanding <math>x[n]</math> on the interval <math>(-\infty, \infty)</math> it becomes
: <math>x[n] = \left \{\dots, (0.5)^{-3}, (0.5)^{-2}, (0.5)^{-1}, 1, 0.5, (0.5)^2, (0.5)^3, \dots \right \} = \left \{\dots, 2^3, 2^2, 2, 1, 0.5, (0.5)^2, (0.5)^3, \dots \right\}.</math>
Looking at the sum
: <math>\sum_{n=-\infty}^{\infty}x[n]z^{-n} \to \infty.</math>
Therefore, there are no values of <math>z</math> that satisfy this condition.
Example 2 (causal ROC)
thumb|250px|ROC (blue), = 0.5 (dashed black circle), and the unit circle (dotted grey circle).
Let <math>x[n] = (0.5)^n \, u[n] </math> (where <math>u</math> is the Heaviside step function). Expanding <math>x[n]</math> on the interval <math>(-\infty, \infty)</math> it becomes
: <math>x[n] = \left \{\dots, 0, 0, 0, 1, 0.5, (0.5)^2, (0.5)^3, \dots \right \}.</math>
Looking at the sum
: <math>\sum_{n=-\infty}^{\infty}x[n]z^{-n} = \sum_{n=0}^{\infty}(0.5)^n z^{-n} = \sum_{n=0}^{\infty}\left(\frac{0.5}{z}\right)^n = \frac{1}{1 - 0.5\,z^{-1.</math>
The last equality arises from the infinite geometric series and the equality only holds if , which can be rewritten in terms of <math>z</math> as . Thus, the ROC is . In this case the ROC is the complex plane with a disc of radius at the origin "punched out".
Example 3 (anticausal ROC)
thumb|250px|ROC (blue), = 0.5 (dashed black circle), and the unit circle (dotted grey circle).
Let <math>x[n] = -(0.5)^n \, u[-n-1] </math> (where <math>u</math> is the Heaviside step function). Expanding <math>x[n]</math> on the interval <math>(-\infty, \infty)</math> it becomes
: <math>x[n] = \left \{ \dots, -(0.5)^{-3}, -(0.5)^{-2}, -(0.5)^{-1}, 0, 0, 0, 0, \dots \right \}.</math>
Looking at the sum
: <math>\begin{align}
\sum_{n=-\infty}^{\infty}x[n] \, z^{-n} &= -\sum_{n=-\infty}^{-1}(0.5)^n \, z^{-n} \\
&= -\sum_{m=1}^{\infty}\left(\frac{z}{0.5}\right)^{m} \\
&= -\frac{(0.5)^{-1}z}{1 - (0.5)^{-1}z} \\
&= -\frac{1}{0.5\,z^{-1}-1} \\
&= \frac{1}{1 - 0.5\,z^{-1 \\
\end{align}</math>
and using the infinite geometric series again, the equality only holds if <math>|(0.5)^{-1} z| < 1</math> which can be rewritten in terms of <math>z</math> as . Thus, the ROC is . In this case the ROC is a disc centered at the origin and of radius .
What differentiates this example from the previous example is only the ROC. This is intentional to demonstrate that the transform result alone is insufficient.
Examples conclusion
Examples 2 and 3 clearly show that the Z-transform <math>X(z)</math> of <math>x[n]</math> 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 . This extends to cases with multiple poles: the ROC will never contain poles.
In example 2, the causal system yields a ROC that includes <math>|z| = \infty</math> while the anticausal system in example 3 yields an ROC that includes .
thumb|250px|ROC shown as a blue ring 0.5 < < 0.75
In systems with multiple poles it is possible to have a ROC that includes neither <math>|z| = \infty</math> nor . The ROC creates a circular band. For example,
: <math>x[n] = (0.5)^n \, u[n] - (0.75)^n \, u[-n-1]</math>
has poles at and . 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 <math>(0.5)^n \, u[n]</math> 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.
Let us assume we are provided a Z-transform of a system without a ROC (i.e., an ambiguous ). We can determine a unique <math>x[n]</math> provided we desire the following:
- Stability
- Causality
For stability the ROC must contain the unit circle. If we need a causal system then the ROC must contain infinity and the system function will be a right-sided sequence. If we need an anticausal system then the ROC must contain the origin and the system function will be a left-sided sequence. If we need both stability and causality, all the poles of the system function must be inside the unit circle.
The unique <math>x[n]</math> can then be found.
Properties
{| class="wikitable"
|+ Properties of the z-transform
!
Property
! Time domain
! Z-domain
! Proof
! ROC
|-
!Definition of Z-transform
| <math>x[n]</math>
| <math>X(z)</math>
| <math>X(z)=\mathcal{Z}\{x[n]\}</math> (definition of the z-transform)
<math>x[n]=\mathcal{Z}^{-1}\{X(z)\}</math> (definition of the inverse z-transform)
| <math>r_2<|z|<r_1</math>
|-
! Linearity
| <math>a_1 x_1[n] + a_2 x_2[n]</math>
| <math>a_1 X_1(z) + a_2 X_2(z)</math>
| <math>\begin{align}X(z) &= \sum_{n=-\infty}^{\infty} (a_1x_1[n]+a_2x_2[n])z^{-n} \\
&= a_1\sum_{n=-\infty}^{\infty} x_1[n] \, z^{-n} + a_2\sum_{n=-\infty}^{\infty}x_2[n] \, z^{-n} \\
&= a_1X_1(z) + a_2X_2(z) \end{align} </math>
| Contains ROC<sub>1</sub> ∩ ROC<sub>2</sub>
|-
! Time expansion
| <math>x_K[n] = \begin{cases} x[r], & n = Kr \\ 0, & n \notin K\mathbb{Z} \end{cases}</math>
with <math>K\mathbb{Z} := \{Kr: r \in \mathbb{Z}\}</math>
| <math>X(z^K)</math>
| <math>\begin{align} X_K(z) &=\sum_{n=-\infty}^{\infty} x_K[n]z^{-n} \\
&= \sum_{r=-\infty}^{\infty}x[r]z^{-rK}\\
&= \sum_{r=-\infty}^{\infty}x[r](z^{K})^{-r}\\
&= X(z^{K}) \end{align}</math>
| <math>R^{\frac{1}{K</math>
|-
! Decimation
| <math>x[Kn]</math>
| <math>\frac{1}{K} \sum_{p=0}^{K-1} X\left(z^{\tfrac{1}{K \cdot e^{-i \tfrac{2\pi}{K} p}\right)</math>
| ohio-state.edu or ee.ic.ac.uk
|
|-
! Time delay
| <math>x[n-k]</math>
with <math>k>0</math> and <math>x : x[n]=0\ \forall \, n<0</math>
| <math>z^{-k}X(z)</math>
| <math>\begin{align} \mathcal{Z}\{x[n-k]\} &= \sum_{n=0}^{\infty} x[n-k]z^{-n}\\
&= \sum_{m=-k}^{\infty} x[m]z^{-(m+k)}&& m = n-k \\
&= \sum_{m=-k}^{\infty} x[m]z^{-m}z^{-k} \\
&= z^{-k}\sum_{m=-k}^{\infty}x[m]z^{-m}\\
&= z^{-k}\sum_{m=0}^{\infty}x[m]z^{-m} && x[\beta] = 0, \forall \beta < 0 \\
&= z^{-k}X(z)\end{align} </math>
| ROC, except <math>z=0</math> if <math>k > 0</math> and <math>z = \infty</math> if <math>k < 0</math>
|-
! Time advance
| <math>x[n+k]</math>
with <math>k>0</math>
| Bilateral Z-transform:
<math display="block">z^kX(z)</math>
Unilateral Z-transform:
<math display="block">z^k \, X(z)-z^k\sum^{k-1}_{n=0}x[n] \, z^{-n}</math>
|
|
|-
! First difference backward
| <math>x[n] - x[n-1]</math>
with <math>x[n]=0 </math> for <math>n < 0 </math>
| <math> (1-z^{-1}) \, X(z)</math>
|
| Contains the intersection of ROC of <math>X_1(z)</math> and <math>z \neq 0</math>
|-
! First difference forward
| <math>x[n+1] - x[n]</math>
| <math> (z-1) \, X(z)-z \, x[0]</math>
|
|
|-
! Time reversal
| <math>x[-n]</math>
| <math>X(z^{-1})</math>
| <math>\begin{align} \mathcal{Z}\{x(-n)\} &= \sum_{n=-\infty}^{\infty} x[-n]z^{-n} \\
&= \sum_{m=-\infty}^{\infty} x[m]z^{m}\\
&= \sum_{m=-\infty}^{\infty} x[m]{(z^{-1})}^{-m}\\
&= X(z^{-1}) \\
\end{align} </math>
| <math>\tfrac{1}{r_1}<|z|<\tfrac{1}{r_2}</math>
|-
! Scaling in the z-domain
| <math>a^n x[n]</math>
| <math>X(a^{-1}z)</math>
| <math>\begin{align}\mathcal{Z} \left \{a^n x[n] \right \} &= \sum_{n=-\infty}^{\infty} a^{n}x[n]z^{-n} \\
&= \sum_{n=-\infty}^{\infty} x[n](a^{-1}z)^{-n} \\
&= X(a^{-1}z)
\end{align} </math>
| <math>|a|r_2 < |z|< |a|r_1</math>
|-
! Complex conjugation
| <math>x^*[n]</math>
| <math>X^*(z^*)</math>
| <math>\begin{align} \mathcal{Z} \{x^*(n)\} &= \sum_{n=-\infty}^{\infty} x^*[n]z^{-n}\\
&= \sum_{n=-\infty}^{\infty} \left [x[n](z^*)^{-n} \right ]^*\\
&= \left [ \sum_{n=-\infty}^{\infty} x[n](z^*)^{-n}\right ]^*\\
&= X^*(z^*)
\end{align} </math>
|
|-
! Real part
| <math>\operatorname{Re}\{x[n]\}</math>
| <math>\tfrac{1}{2}\left[X(z)+X^*(z^*) \right]</math>
|
|
|-
! Imaginary part
| <math>\operatorname{Im}\{x[n]\}</math>
| <math>\tfrac{1}{2i}\left[X(z)-X^*(z^*) \right]</math>
|
|
|-
! Differentiation in the z-domain
| <math>n \, x[n]</math>
| <math> -z \frac{dX(z)}{dz}</math>
| <math>\begin{align} \mathcal{Z}\{n \, x(n)\} &= \sum_{n=-\infty}^{\infty} n \, x[n]z^{-n}\\
&= z \sum_{n=-\infty}^{\infty} n \, x[n]z^{-n-1}\\
&= -z \sum_{n=-\infty}^{\infty} x[n](-n \, z^{-n-1})\\
&= -z \sum_{n=-\infty}^{\infty} x[n]\frac{d}{dz}(z^{-n}) \\
&= -z \frac{dX(z)}{dz}
\end{align} </math>
| ROC, if <math>X(z)</math> is rational;
ROC possibly excluding the boundary, if <math>X(z)</math> is irrational
|-
! Convolution
| <math>x_1[n] * x_2[n]</math>
| <math>X_1(z) \, X_2(z)</math>
| <math>\begin{align} \mathcal{Z}\{x_1(n)*x_2(n)\} &= \mathcal{Z} \left \{\sum_{l=-\infty}^{\infty} x_1[l]x_2[n-l] \right \} \\
&= \sum_{n=-\infty}^{\infty} \left [\sum_{l=-\infty}^{\infty} x_1[l]x_2[n-l] \right ]z^{-n}\\
&=\sum_{l=-\infty}^{\infty} x_1[l] \left [\sum_{n=-\infty}^{\infty} x_2[n-l]z^{-n} \right ]\\
&= \left [\sum_{l=-\infty}^{\infty} x_1(l)z^{-l} \right ] \! \!\left [\sum_{n=-\infty}^{\infty} x_2[n]z^{-n} \right ] \\
&=X_1(z)X_2(z)
\end{align} </math>
| Contains ROC<sub>1</sub> ∩ ROC<sub>2</sub>
|-
! Cross-correlation
| <math>r_{x_1,x_2}=x_1^*[-n] * x_2[n]</math>
| <math>R_{x_1,x_2}(z)=X_1^*(\tfrac{1}{z^*})X_2(z)</math>
|
| Contains the intersection of ROC of <math>X_1(\tfrac{1}{z^*})</math> and <math>X_2(z)</math>
|-
! Accumulation
|<math>\sum_{k=-\infty}^{n} x[k]</math>
|<math> \frac{1}{1-z^{-1X(z)</math>
|<math>\begin{align}
\sum_{n=-\infty}^{\infty}\sum_{k=-\infty}^{n} x[k] z^{-n}&=\sum_{n=-\infty}^{\infty}(x[n]+\cdots)z^{-n}\\
&=X(z) \left (1+z^{-1}+z^{-2}+\cdots \right )\\
&=X(z) \sum_{j=0}^{\infty}z^{-j} \\
&=X(z) \frac{1}{1-z^{-1\end{align}</math>
|
|-
! Multiplication
| <math>x_1[n] \, x_2[n]</math>
| <math>\frac{1}{2\pi i}\oint_C X_1(v)X_2(\tfrac{z}{v})v^{-1}\mathrm{d}v</math>
|
| At least <math>r_{1l}r_{2l}<|z|<r_{1u}r_{2u}</math> |-
|}
Parseval's theorem
: <math>\sum_{n=-\infty}^{\infty} x_1[n]x^*_2[n] \quad = \quad \frac{1}{2\pi i}\oint_C X_1(v)X^*_2(\tfrac{1}{v^*})v^{-1}\mathrm{d}v</math>
Initial value theorem : If <math>x[n]</math> is causal, then <math display="block">x[0]=\lim_{z\to \infty}X(z).</math>
Final value theorem: If the poles of <math>(z - 1) X(z)</math> are inside the unit circle, then <math display="block">x[\infty]=\lim_{z\to 1}(z-1)X(z).</math>
Table of common Z-transform pairs
Here:
: <math>u : n \mapsto u[n] = \begin{cases} 1, & n \ge 0 \\ 0, & n < 0 \end{cases}</math>
is the unit (or Heaviside) step function and
: <math>\delta : n \mapsto \delta[n] = \begin{cases} 1, & n = 0 \\ 0, & n \ne 0 \end{cases}</math>
is the discrete-time unit impulse function (cf. Dirac delta function, which is a continuous-time version). The two functions are chosen together so that the unit step function is the accumulation (running total) of the unit impulse function.
{| class="wikitable"
|-
! !! Signal, <math>x[n]</math> !! Z-transform, <math>X(z)</math> !! ROC
|-
| 1 || <math>\delta[n]</math> || 1 || all z
|-
| 2 || <math>\delta[n-n_0]</math> || <math> z^{-n_0}</math> || <math> z \neq 0</math>
|-
| 3 || <math>u[n]</math> || <math> \frac{1}{1-z^{-1} }</math> || <math>|z| > 1</math>
|-
| 4 ||<math> -u[-n-1]</math> || <math> \frac{1}{1 - z^{-1</math> ||<math>|z| < 1</math>
|-
| 5 ||<math> n u[n]</math> || <math> \frac{z^{-1{( 1-z^{-1} )^2}</math> || <math>|z| > 1</math>
|-
| 6 ||<math> - n u[-n-1]</math> || <math> \frac{z^{-1} }{ (1 - z^{-1})^2 }</math> ||<math> |z| < 1</math>
|-
| 7 ||<math>n^2 u[n]</math> || <math> \frac{ z^{-1} (1 + z^{-1} )}{(1 - z^{-1})^3} </math> || <math>|z| > 1</math>
|-
| 8 ||<math> - n^2 u[-n - 1]</math> || <math> \frac{ z^{-1} (1 + z^{-1} )}{(1 - z^{-1})^3} </math> || <math>|z| < 1</math>
|-
| 9 ||<math>n^3 u[n]</math> || <math> \frac{z^{-1} (1 + 4 z^{-1} + z^{-2} )}{(1-z^{-1})^4} </math> || <math>|z| > 1</math>
|-
| 10 ||<math>- n^3 u[-n -1]</math> || <math> \frac{z^{-1} (1 + 4 z^{-1} + z^{-2} )}{(1-z^{-1})^4} </math> || <math>|z| < 1</math>
|-
| 11 ||<math>a^n u[n]</math> || <math> \frac{1}{1-a z^{-1</math> ||<math> |z| > |a|</math>
|-
| 12 ||<math>-a^n u[-n-1]</math> || <math> \frac{1}{1-a z^{-1</math> ||<math>|z| < |a|</math>
|-
| 13 ||<math>n a^n u[n]</math> || <math> \frac{az^{-1} }{ (1-a z^{-1})^2 }</math> || <math>|z| > |a|</math>
|-
| 14 ||<math>-n a^n u[-n-1]</math> || <math> \frac{az^{-1} }{ (1-a z^{-1})^2 }</math> ||<math> |z| < |a|</math>
|-
| 15 ||<math>n^2 a^n u[n]</math> || <math> \frac{a z^{-1} (1 + a z^{-1}) }{(1-a z^{-1})^3} </math> || <math>|z| > |a|</math>
|-
| 16 ||<math>- n^2 a^n u[-n -1]</math> || <math> \frac{a z^{-1} (1 + a z^{-1}) }{(1-a z^{-1})^3} </math> || <math>|z| < |a|</math>
|-
| 17 ||<math> \left(\begin{array}{c} n + m - 1 \\ m - 1 \end{array} \right) a^n u[n]</math> [[Permutation#k-permutations of n|<sup>[14]</sup>]]|| , for positive integer <math>m</math>