All of these properties of z-transform are applicable for discrete-time signals that have a Z-transform. Meaning these properties of Z-transform apply to any generic signal x(n) for which an X(z) exists. (x(n) X(z)). We will also specify the Region of Convergence of the transform for each of the properties.
Property | Mathematical representation | Exceptions/
ROC |
Linearity | a1x1(n)+a2x2(n) = a1X1(z) + a2X2(z) | At least
ROC1∩ROC2 |
Time shifting | x(n-k) z-kX(z) | ROC of x(n-k) |
Scaling | anx(n) x(z/a) | If r1 <|z|< r2,
then |a|r1<|z|<|a|r2 |
Time reversal | x(-n) x(1/z) | 1/r2<|z|<1/r1 |
Differentiation
in Z-domain or Multiplication by n |
nkx(n) [-1]kzk | ROC = All R |
Convolution | x(n)*h(n) x(Z)*h(Z) | At least
ROC1∩ROC2 |
Correlation | x(n)⊗y(n) x(Z).y(Z-1) | |
Initial Value theorem
in Z-transform |
x(0) = x(Z) | For a causal
signal x(n) |
Final Value theorem
in Z-transform |
x() = x(Z)(1-Z-1) | For a causal
signal x(n) |
Conjugation | x*(n) x*(Z*) | ROC of x(n) |
Parseval’s
Theorem |
x(n).h*(n) = F(z)F*(z) dz
Parseval’s relation tells us that the energy of a signal is equal to the energy of its Fourier transform. |