Prerequisite: What is Z-transform?
A z-Transform is important for analyzing discrete signals and systems. In this article, we will see the properties of z-Transforms. These properties are helpful in computing transforms of complex time-domain discrete signals.
1. Linearity: If we have two sequences x1[n] and x2[n], and their individual z-transforms as X1(z) and X2(z), then the linearity property permits us to write:
[Tex]\begin{aligned}X(z) & = Z { ax_{1}[n]+bx_{2}[n] } \\
& = aX_{1}(z) + bX_{2}(z)\end{aligned}[/Tex]
This is easily proved. First consider [Tex]x[n]=ax_{1}[n]+bx_{2}[n][/Tex]
Then, from the definition, we see:
[Tex]\begin{aligned}X(z)&= \sum _{ n=0 }^{ \infty }{ } x[n]z^{-n}\\&= \sum _{ n=0 }^{ \infty }{ }( ax_{1}[n]+bx_{2}[n])z^{-n}\\&= a\sum _{ n=0 }^{ \infty }x_{1}[n]z^{-n}+b\sum _{ n=0 }^{ \infty }x_{2}[n]z^{-n}
\\&= aX_{1}(z) + bX_{2}(z)\end{aligned}[/Tex]
2. Time Shifting: If we have a time-shifted sequence such as x[n-k], then its z-transform is given by Z{ x[n-k]} = z^{-k}X(z).
Let’s take n – k = m, i.e., n = k + m and y[n] = x[n-k]. Now here we are assuming that x[n] starts from n=0, hence x[n-k] starts from n=k, or n-k=0, or from m=0.
[Tex]\begin{aligned}Y(z) & = \sum_{m=0}^{\infty }y[n]z^{-n}
\\& = \sum_{m=0}^{\infty }x[n-k]z^{-n}
\\&= \sum_{m=0}^{\infty }x[m]z^{-m-k}
\\& = z^{-k}\sum_{m=0}^{\infty }x[m]z^{-m}
\\&= z^{-k}X(z)\end{aligned}[/Tex]
3. Time reversal: Time reversal property states that [Tex]Z{ x[-n]} = X(1/z)[/Tex]
We are going to formally prove this statement by taking y[n]=x[-n].
[Tex]\begin{aligned} \sum_{n=0}^{\infty }y[n]z^{-n}
= \sum_{n=0}^{\infty }x[-n]z^{-n}\end{aligned}[/Tex]
Now let’s take -n=m. Then
[Tex] \begin{aligned}\sum_{m=0}^{ -\infty}x[m]z^{m}
& = \sum_{m=-\infty}^{0 }x[m]z^{m}\\
& = \sum_{-m=\infty}^{0 }x[m](z^{-1})^{-m}\\
& = X(z^{-1})\end{aligned}[/Tex]
4. Scaling in z domain: When we multiply the signal sequence x[n] in the time domain with an exponential factor an, the equivalent z-transform of the new signal is scaled by a factor of a.
Basically, [Tex]Z{ anx[n]}=X(z/a) [/Tex].
Proof is elementary and is shown below.
[Tex]\begin{aligned} \sum _{ n=0 }^{ \infty } a^{n}x[n]z^{-n} & = \sum _{ n=0 }^{ \infty } x[n](a^{-1}z)^{-n}\\
&=\sum _{ n=0 }^{ \infty } x[n](z/a)^{-n} \\ = X(z/a)\end{aligned}[/Tex]
5. Differentiation in z domain: We know: [Tex]X(z)=\sum_{n=0}^{\infty }x[n]z^{-n}[/Tex]
Differentiating with respect to z, we get
[Tex]\begin{aligned} \frac{\mathrm{d} X(z)}{\mathrm{d} z} = -\sum_{n=0}^{\infty }nx[n]z^{-n-1} & \\ = -z^{-1} \sum_{n=0}^{\infty }nx[n]z^{-n}\end{aligned}[/Tex]
[Tex]\begin{aligned} -z\frac{\mathrm{d} X(z)}{\mathrm{d} z} & = \\ \sum_{n=0}^{\infty }(nx[n])z^{-n}\end{aligned}[/Tex]
Hence, we can deduce that for k differentiations, we get [Tex]Z{ n^kx[n]} = (-1)^kz^k\frac{\mathrm{d^{k}}X(z) }{\mathrm{d} z^{k}}[/Tex]
6. Convolution: Convolution of two sequences x[n] and h[n] is defined as [Tex]x[n]*h[n]=\sum_{k=0}^{\infty }x[k]h[n-k][/Tex]
Now z-transforms of x[n] and h[n] are X(z) and H(z) respectively. Using this notation, we have
[Tex]\begin{aligned}\sum_{n=0}^{\infty }(x[n]*h[n])z^{-n} =\sum_{n=0}^{\infty }\sum_{k=0}^{\infty }x[k]h[n-k]z^{-n}\\=\sum_{n=0}^{\infty }\sum_{k=0}^{\infty }x[k]h[n-k]z^{-(n-k)}z^{-k}\\ =\sum_{n=0}^{\infty }(\sum_{k=0}^{\infty }x[k]z^{-k})h[n-k]z^{-(n-k)}\\ =\sum_{n=0}^{\infty }X(z)h[n-k]z^{-(n-k)}\\ =X(z)\sum_{n-k=0}^{\infty }h[n-k]z^{-(n-k)}\\ =X(z)H(z)\end{aligned}[/Tex]
Hence, convolution in time domain is multiplication in z domain.
7. Initial value theorem: Initial value theorem gives us a tool to compute the initial value of the sequence x[n], that is, x[0] in the z domain by taking a limit of the value of X(z). It states that the following equivalence is feasible.
[Tex]x[0] = \lim _{ z\rightarrow \infty } x(Z)[/Tex]
The proof, as before, relies on the definition of X(z).
[Tex]\begin{aligned} X(z) = \sum_{n=0}^{\infty }x[n]z^{-n} & \\ = x[0]z^0+x[1]z^{-1}+z[2]z^{-2}+….&\\ \end{aligned}[/Tex]
Clearly, if we want to get x[0], we can make z approach to infinity so that all the other terms die out. What is left behind is precisely the statement of the theorem presented before.
8. Final value theorem: The final value theorem lets us know the final value of x[n], or the value at infinity of x[n], using appropriate limits of X(z).
It states that [Tex]x(\infty ) = \lim _{ z\rightarrow 1 } X(z)(1-z^{-1})[/Tex]
If we take the z transform of x[n]-x[n-1], then we get [Tex]\begin{aligned} X(z)-z^{-1}X(z) & =\sum_{n=0}^{\infty }x[n]z^{-n}-z^{-1} \sum_{n=0}^{\infty }x[n]z^{-n} \\& = x[0]+x[1]z^{-1}+x[2]z^{-2}+…-z^{-1}(x[0]+x[1]z^{-1}+x[2]z^{-2}+…) \end{aligned}
[/Tex]
Now taking the limit z⇢1, we see that we get [Tex]x[1]-x[0]+x[2]-x[1]+x[3]-x[2]+…+x[\infty]-x[\infty -1] [/Tex] in the right hand side, which simplifies to x[\infty] basically. Hence the theorem is proved.
9. Multiplication in time property
x1[n].x2[n]=1/j2pi {X1[z]*X2[z]}
10. Accumulation property
Share your thoughts in the comments
Please Login to comment...