0% found this document useful (0 votes)
41 views7 pages

DSP - Z-Transform Properties DSP - Z-Transform Properties: Linearity

Digital Signal Processing

Uploaded by

Francis Xavier
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
41 views7 pages

DSP - Z-Transform Properties DSP - Z-Transform Properties: Linearity

Digital Signal Processing

Uploaded by

Francis Xavier
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

DSP - Z-TRANSFORM PROPERTIES

https://www.tutorialspoint.com/digital_signal_processing/dsp_z_transform_properties.htm Copyright © tutorialspoint.com

Advertisements

In this chapter, we will understand the basic properties of Z-transforms.

Linearity
It states that when two or more individual discrete signals are multiplied by constants, their respective Z-
transforms will also be multiplied by the same constants.

Mathematically,

a 1 x1 (n) + a 2 x2 (n) = a 1 X 1 (z) + a 2 X 2 (z)

Proof − We know that,



−n
X(Z ) = ∑ x(n)Z

n=−∞

∞ −n
= ∑ (a 1 x1 (n) + a 2 x2 (n))Z
n=−∞

∞ −n ∞ −n
= a1 ∑ x1 (n)Z + a2 ∑ x2 (n)Z
n=−∞ n=−∞

= a 1 X 1 (z) + a 2 X 2 (z)

H enceP roved

Here, the ROC is ROC 1 ⋂ ROC 2 .

Time Shifting
Time shifting property depicts how the change in the time domain in the discrete signal will affect the Z-
domain, which can be written as;
−n
x(n − n0 ) ⟷ X(Z )Z

Or x(n − 1) ⟷ Z
−1
X(Z )

Proof −

Let y(P ) = X(P − K )

∞ −p
Y (z) = ∑ y(p)Z
p=−∞

∞ −p
= ∑ (x(p − k))Z
p=−∞

Let s = p-k
∞ −(s+k)
= ∑ x(s)Z
s=−∞

∞ −s −k
= ∑ x(s)Z Z
s=−∞

−k ∞ −s
= Z [∑ x(m)Z ]
s=−∞
−k
= Z X(Z )

H enceP roved

Here, ROC can be written as Z = 0 p > 0 or Z = ∞p < 0

Example

Un and Un − 1 can be plotted as follows

Z-transformation of Un cab be written as;


∞ −n
∑ [U (n)]Z = 1
n=−∞

Z-transformation of Un − 1 can be written as;


∞ −n −1
∑ [U (n − 1)]Z = Z
n=−∞

So here x(n − n 0) = Z
−n0
X(Z )

H enceP roved

Time Scaling
Time Scaling property tells us, what will be the Z-domain of the signal when the time is scaled in its discrete
form, which can be written as;
n −1
a x(n) ⟷ X(a Z)

Proof −

Let y(p) = a x(p)


p

∞ −p
Y (P ) = ∑ y(p)Z
p=−∞

∞ p −p
= ∑ a x(p)Z
p=−∞

∞ −1 −p
= ∑ x(p)[a Z]
p=−∞

−1
= X(a Z)

H enceproved

ROC: = Modar1 < ModZ < Modar2 where Mod = Modulus

Example
Let us determine the Z-transformation of x(n) = a n
cos ωn using Time scaling property.

Solution −

We already know that the Z-transformation of the signal cos(ωn) is given by −



−n 2 2
∑ (cos ωn)Z = (Z − Z cos ω)/(Z − 2Z cos ω + 1)

n=−∞

Now, applying Time scaling property, the Z-transformation of a n


cos ωn can be written as;
∞ n −n −1
∑ (a cos ωn)Z = X(a Z)
n=−∞

−1 2 −1 −1 2 −1
= [(a Z) − (a Z cos ωn)]/((a Z) − 2(a Z cos ωn) + 1)

2 2
= Z (Z − a cos ω)/(Z − 2az cos ω + a )

Successive Differentiation
Successive Differentiation property shows that Z-transform will take place when we differentiate the discrete
signal in time domain, with respect to time. This is shown as below.

dx(n)
−1
= (1 − Z )X(Z )
dn

Proof −
dx(n)
Consider the LHS of the equation − dn

[x(n) − x(n − 1)]


=
[n − (n − 1)]

= x(n) − X(n − 1)

−1
= x(Z ) − Z x(Z )

−1
= (1 − Z )x(Z ) H enceP roved

ROC: R1< Mod Z <R2

Example

Let us find the Z-transform of a signal given by x(n) = n 2


u(n)

By property we can write


dZ[U (n)]
Z z[nU (n)] = −Z
dz

Z
d[ ]
Z−1
= −Z
dZ

2
= Z /((Z − 1)

= y(let)

Now, Z[n.y] can be found out by again applying the property,


dy
Z (n, y) = −Z
dz

3
d[Z/(Z−1) ]
= −Z
dz

2
= Z (Z + 1)/(Z − 1)

Convolution
This depicts the change in Z-domain of the system when a convolution takes place in the discrete signal form,
which can be written as −

x1 (n) ∗ x2 (n) ⟷ X 1 (Z ). X 2 (Z )

Proof −
∞ −n
X(Z ) = ∑ x(n)Z
n=−∞

∞ ∞ −n
= ∑ [∑ x1 (k)x2 (n − k)]Z
n=−∞ k=−∞

∞ ∞ −n
= ∑ x1 (k)[∑ x2 (n − k)Z ]
k=−∞ n

∞ ∞ −(n−k) −k
= ∑ x1 (k)[∑ x2 (n − k)Z Z ]
k=−∞ n=−∞

Let n-k = l, then the above equation cab be written as −


∞ −k ∞ −l
X(Z ) = ∑ x1 (k)[Z ∑ x2 (l)Z ]
k=−∞ l=−∞

∞ −k
= ∑ x1 (k)X 2 (Z )Z
k=−∞

∞ −k
= X 2 (Z ) ∑ x1 (Z )Z
k=−∞

= X 1 (Z ). X 2 (Z )

H enceP roved

ROC:ROC ⋂ ROC 2

Example
Let us find the convolution given by two signals

x1 (n) = {3, −2, 2} ...


eq. 1

x2 (n) = {2, 0 ≤ 4 and 0 elsewhere} ...eq. 2

Z-transformation of the first equation can be written as;


∞ −n
∑ x1 (n)Z
n=−∞

−1 −2
= 3 − 2Z + 2Z

Z-transformation of the second signal can be written as;


∞ −n
∑ x2 (n)Z
n=−∞

−1 −2 −3 −4
= 2 + 2Z + 2Z + 2Z + 2Z
So, the convolution of the above two signals is given by −

X(Z ) = [x1 (Z ) x2 (Z )]

−1 −2 −1 −2 −3 −4
= [3 − 2Z + 2Z ] × [2 + 2Z + 2Z + 2Z + 2Z ]

−1 −2 −3
= 6 + 2Z + 6Z + 6Z +. . . ... ...

Taking the inverse Z-transformation we get,

x(n) = {6, 2, 6, 6, 6, 0, 4}

Initial Value Theorem


If xn is a causal sequence, which has its Z-transformation as Xz, then the initial value theorem can be written
as;

X(n)(at n = 0) = limz→∞ X(z)

Proof − We know that,


∞ −n
X(Z ) = ∑ x(n)Z
n=0

Expanding the above series, we get;


0 −1 −2
= X(0)Z + X(1)Z + X(2)Z +. . . ...

−1 −2
= X(0) × 1 + X(1)Z + X(2)Z +. . . ...

In the above case if Z → ∞ then Z −n


→ 0 Becausen > 0

Therefore, we can say;

limz→∞ X(z) = X(0)

H enceP roved

Final Value Theorem


Final Value Theorem states that if the Z-transform of a signal is represented as XZ and the poles are all inside
the circle, then its final value is denoted as xn or X∞ and can be written as −
−1
X(∞) = limn→∞ X(n) = limz→1 [X(Z )(1 − Z )]

Conditions −

It is applicable only for causal systems.


X(Z )(1 − Z
−1
) should have poles inside the unit circle in Z-plane.

Proof − We know that


+ k −n
Z [x(n + 1) − x(n)] = limk→∞ ∑ Z [x(n + 1) − x(n)]
n=0

+ + k −n
⇒ Z [x(n + 1)] − Z [x(n)] = limk→∞ ∑ Z [x(n + 1) − x(n)]
n=0

+ + k −n
⇒ Z [X(Z ) − x(0)] − X(Z ) = limk→∞ ∑ Z [x(n + 1) − x(n)]
n=0

Here, we can apply advanced property of one-sided Z-Transformation. So, the above equation can be re-
written as;
+ + 0 +
Z [x(n + 1)] = Z [X(2) − x(0)Z ] = Z [X(Z ) − x(0)]

Now putting z = 1 in the above equation, we can expand the above equation −

limk→∞ [x(1) − x(0) + x(6) − x(1) + x(3) − x(2)+. . . ... . . . +x(x + 1) − x(k)]

This can be formulated as;


−1
X(∞) = limn→∞ X(n) = limz→1 [X(Z )(1 − Z )] H enceP roved

Example

Let us find the Initial and Final value of xn whose signal is given by
−1 −2
X(Z ) = 2 + 3Z + 4Z

Solution − Let us first, find the initial value of the signal by applying the theorem

x(0) = limz→∞ X(Z )

−1 −2
= limz→∞ [2 + 3Z + 4Z ]

3 4
= 2 + ( ) + ( ) = 2
∞ ∞

Now let us find the Final value of signal applying the theorem
−1
x(∞) = limz→∞ [(1 − Z )X(Z )]

−1 −1 −2
= limz→∞ [(1 − Z )(2 + 3Z + 4Z )]

−1 −2 −3
= limz→∞ [2 + Z + Z − 4Z ]

= 2 + 1 + 1 − 4 = 0

Some other properties of Z-transform are listed below −

Differentiation in Frequency
It gives the change in Z-domain of the signal, when its discrete signal is differentiated with respect to time.
dX(z)
nx(n) ⟷ −Z
dz

Its ROC can be written as;

r2 < M od(Z ) < r1

Example

Let us find the value of xn through Differentiation in frequency, whose discrete signal in Z-domain is given by
−1
x(n) ⟷ X(Z ) = log(1 + aZ )

By property, we can write that


dx(Z)
nx(n) ⟷ −Z
dz

−2
−aZ
= −Z [ ]
−1
1+aZ
−1 −1
= (aZ )/(1 + aZ )

−1
= 1 − 1/(1 + aZ )

n
nx(n) = δ(n) − (−a) u(n)

n
⇒ x(n) = 1/n[δ(n) − (−a) u(n)]

Multiplication in Time
It gives the change in Z-domain of the signal when multiplication takes place at discrete signal level.
1
x1 (n). x2 (n) ⟷ ( )[X1(Z ) ∗ X2(Z )]
2Πj

Conjugation in Time
This depicts the representation of conjugated discrete signal in Z-domain.
∗ ∗ ∗
X (n) ⟷ X (Z )

You might also like