EXERCISE 5

SGN-1159 Introduction to Signal Processing

Solutions
by Pavlo Molchanov
02.10.2012

PROBLEM 1: Given:

2 4.7z 1 + 2.23z 2 0.3z 3

X(z) =
1 0.7z 1 + 0.12z 2
having a ROC 0.3 > |z| > 0.4, find the inverse Z transform.
Solution:
In order to invert the given Z-transform we have to manipulate the ex-
pression of X(z) so that it becomes a linear combination of terms like those
in Table 1.
We will compute inverse z-transform by partial-fraction expansion. The
degree of the nominator of X(z) is greater than the degree of the denomi-
nator. Therefore, we want to have it in a form of:

R(z)
X(z) = A(z) + , (1)
D(z)

where D(z) is the denominator of X(z), such that degree of the polynomial
R(z) is less than that of D(z).
To find A(z) and R(z) we need to apply the long devision:

Sequence Z-transform ROC

[n] 1 z
1
n [n] 1z 1
|z| > ||
1
()n [n 1] 1z 1
|z| < ||
z 1
nn [n] (1z 1 )2
|z| > ||
z 1
nn [n 1] (1z 1 )2
|z| < ||

Table 1: Common Z-transform pairs.

1
 0.3z 3 +2.23z 2 4.7z 1 +2 0.12z 2 0.7z 1 +1
0.3z 3 +1.75z 2 2.5z 1 2.5z 1 +4
0.48z 2 2.2z 1 +2
0.48z 2 2.8z 1 +4
0.6z 1 2

After the long devision we got:

1 0.6z 1 2
X(z) = 2.5z
{z + 4} + 1 2
, (2)
|1 0.7z {z+ 0.12z }
|
A(z)
R(z)
G(z)= D(z)

The term A(z) is already directly invertible (using the shifting property
of the Z-transform):

a[n] = Z 1 {A(z)} = Z 1 4 2.5z 1 = 4[n] 2.5[n 1].



The fraction G(z) from (1) has to be further manipulated using fractional
expansion which first requires that we compute the poles of G(z). The poles
of G(z) are just the values of z that make G(z) equal to infinity, which are
the same as the values of z that make the denominator D(z) equal to zero.
The denominator D(z) is of second order, therefore can be expressed as:

D(z) = (1 p1 z 1 )(1 p2 z 1 ) = 1 + (p1 p2 )z 1 + p1 p2 z 2 (3)

Taking into account that D(z) = 1 0.7z 1 + 0.12z 2 and (3):

p1 = 0.3
p2 = 0.4

Two poles of G(z) are p1 = 0.3; p2 = 0.4. Now D(z) become:

0.6z 1 2
G(z) = . (4)
(1 0.3z 1 )(1 0.4z 1 )

Now can use the method of the residuals to rewrite G(z) as:
B C
G(z) = + (5)
(1 0.3z ) (1 0.4z 1 )
1

where B is the residual corresponding to the pole p1 = 0.3 and therefore

is obtained with the formula:
1 2 

 1
 0.6z
B = (1 p1 z )G(z) z=p1 =  = 0,
(1 0.4z 1 ) z=0.3

2
while
0.6z 1 2 

1
 
C = (1 p2 z )G(z)  = = 2.
z=p2 (1 0.3z 1 ) z=0.4

Therefore, G(z) become:

2
G(z) = .
(1 0.4z 1 )

Taking into account the ROC given to us, we can invert G(z):
 
1 1 2
g[n] = Z {G(z)} = Z = 2(0.4)n [n 1].
(1 0.4z 1 )

Combining () and (), the inverse z-transform of X(z) is:

x[n] = Z 1 {X(z)} = 4[n] 2.5[n 1] 2(0.4)n [n 1].

PROBLEM 2: Given the following system function:

5 3z + 2z 1
H(z) = ROC |z| > 2
1 2z 1
Solution:
We can rewrite H(z) as:

H(z) = 5G(z) 3zG(z) + 2z 1 G(z),

1
where G(z) = 12z 1 .
Assume g[n] is the inverse z-transform of G(z), then the inverse Z-
transform of H(z) can be obtained by using time-shift theorem (g[n
Z
z n0 G(z)):
n0 ]

h[n] = 5g[n] 3g[n + 1] + 2g[n 1].

The inverse Z-transform of G(z) can be calculated using Table 1:

g[n] = Z 1 {G(z)} = (2)n [n].

Finally, the inverse Z-transform of H(z) is:

h[n] = 5(2)n [n] 3(2)n+1 [n + 1] + 2(2)n1 [n 1].

PROBLEM 3: Evaluate the convolution of the two sequences h[n] =

(0.5)n [n] and x[n] = 3n [n] by using the Z-transform.
Solution: Convolution theorem says that the Z-transform of the convolu-
tion sum of the sequences x[n] and h[n] is given by X(z)H(z). So we need

3
first to compute Z-transforms of x[n] and h[n], then multiply them and apply
the inverse Z-transform.
The Z-transform of h[n] can be obtained from the Table 1:
1
H(z) = ROC |z| > 0.5 (6)
1 0.5z 1
To compute the Z-transform of x[n] we need to rewrite it as:
1
x[n] = ( )n [n].
3
Next, we make change of variable m = n:
1
x[m] = ( )m [m].
3
The Z-transform of x[m] is:
1 1
Xm (z) = 1 1 ROC |z| > .
1 3z
3

To obtain the Z-transform of x[n] we need to apply time-reversal theorem

Z
(g[n]
G(1/z) ROC : 1/Rg ):
1
X(z) = ROC |z| < 3.
1 31 z 1

In the next step we will multiply numerator and denumerator by 3z 1 :

3z 1
X(z) = ROC |z| < 3.
1 3z 1
The same result can be obtained by using the Table 1.
Now we will compute multiplication of X(z) and H(z):

1 3z 1
P (z) = H(z)X(z) = ROC 0.5 < |z| < 3.
1 0.5z 1 1 3z 1
Function P (z) contains two poles p1 = 0.5 and p2 = 3 and we can apply
method of residuals:
B C
P (z) = + ,
1 0.5z 1 1 3z 1
where
3z 1 

 1
 6
B = (1 p1 z )G(z) z=p1 = = ,
(1 3z 1 ) z=0.5 5
and
3z 1 

 1
 6
C = (1 p2 z )G(z)  z=p2
= 1
= .
(1 0.5z ) z=3
 5

4
 Therefore P (z) become:

6/5 6/5
P (z) = + ROC 0.5 < |z| < 3.
1 0.5z 1 1 3z 1
The last step is to apply inverse Z-transform using Table 1 and taking
into account the ROC:
6 6
Z 1 {P (z)} = x h = (0.5)n [n] + (3)n [n 1].
5 5

PROBLEM 4: Find the inverse Z-transform of

1 3z 5
X(z) = ROC 0.2 < |z| < 0.6
(1 0.2z 1 )(1 + 0.6z 1 )

SOLUTION (by German Gomez Herrero):

Since the order of the numerator is greater that the order of the denom-
inator we cannot apply directly the method of the residuals to X(z). One
way of proceeding is to perform a long division but this can be a rather long
process. Since the numerator of our Z expression has only two terms the
best is to rewrite X(z) as:

1 1
X(z) = 3z 5
(1 0.2z 1 )(1 + 0.6z 1 ) (1 0.2z 1 )(1 + 0.6z 1 )
| {z } | {z }
G(z) G(z)

and use the linearity and shifting properties of the Z-transform to write:

x[n] = g[n] 3g[n 5]

where g[n] is the inverse Z-transform of G(z). Inverting G(z) is very
easy using the method of the residuals:

1 3
1 4 4
G(z) = = +
(1 0.2z 1 )(1 + 0.6z 1 ) 1 0.2z 1 1 + 0.6z 1
So we have that:
1 3
g[n] = (0.2)n [n] (0.6)n [n 1]
4 4
and then x[n] = g[n] 3g[n 5].

5
PROBLEM 5: A signal x[n] has been passed through a causal LTI system
given by the following difference equation:

1 11 3
y[n]y[n1]+ y[n2] = 2x[n]2x[n1] x[n2]+3x[n3] x[n4]
4 4 4
Find the impulse response of the system. Is the system stable?

SOLUTION (by German Gomez Herrero):

Using the shifting property of the Z-transform we easily obtain that:

Y (z) 2 2z 1 11
4 z
2 + 3z 3 3 z 4
4
H(z) = = (7)
X(z) 1 z 1 + 14 z 2
Clearly, we cannot invert H(z) directly because the numerator does not
look anything like (1 z 1 ) or (1 z 1 )2 . Therefore a valid approach
would be to use long division and subsequently the method of the residuals
to express H(z) as a linear combination of powers of z and terms having as
denominator either (1 z 1 ) or (1 z 1 )2 . We will explore this approach
later.
However, because the denominator of our fractional Z-transform is of
order 2 it is worth checking if its two roots are identical (i.e. if we have a
double pole), which would make the denominator of H(z) become (1z 1 )2
with equal to the value of the double pole. Then H(z) would be directly
invertible using the shifting property of the Z-transform. To explore this
possibility, we start by finding the poles of H(z), that is, the roots of the
polynomial 1 z 1 + 41 z 2 . To do this we make the variable change x = z 1
and solve:
1
1 x + x2 = 0
4
obtaining the solutions x1 = x2 = 2. Reversing the variable change we
obtain the roots of our polynomial in z 1 are z1 = z2 = x1
1
= 12 . So we have
obtained that H(z) effectively has a double pole at z = 12 and therefore we
can write H(z) as:

Y (z) 2 2z 1 11
4 z
2 + 3z 3 3 z 4
4 1
H(z) = = ROC |z| > (8)
X(z) (1 12 z 1 )2 2

Notice that we know that the ROC of H(z) is |z| > 21 because it is
said in the problem description that the system is causal. From here we
can already use the table of Z-transform pairs and the shifting property of
the Z-transform to obtain an expression of h[n]. Recall from the table of
Z-transform pairs:

6
  n 1 1
1 2z
g[n] = n [n] G(z) = (9)
2 (1 12 z 1 )2
Clearly we can write the expression of H(z) in Eq. 8 as:

11 1 3
H(z) = 4zG(z) 4G(z) z G(z) + 6z 2 G(z) z 3 G(z)
2 2
And therefore:

(n+1)
n 1 (n1)
h[n] = 4(n + 1) 12 [n + 1] 4n 21 [n] 11


2
(n 1) 2 [n 1]
1 (n2) 3 1 (n3)


+6(n 2) 2 [n 2] 2 (n 3) 2 [n 3]
(10)
Although this will not be required in the exam, one can operate a bit
more in order to express Eq. 10 in this more compact form:
 n
1
h[n] = 2[n] 6[n 2] + (1 n) [n 3] (11)
2
There is an alternative way of reaching the final solution. Because the
numerator of H(z) in Eq. 7 is not of lower degree than the denominator we
could have used long-division to express H(z) as:

1 z 1
H(z) = 1 3z 2 +
2 (12)
1 21 z 1
Then we can express H(z) as:

H(z) = 1 3z 2 + 2zG(z) 2G(z)

1 1
z
with G(z) = 2
(1 21 z 1 )2
. Thus the inverse Z-transform will be:

 (n+1)  n
1 1
h[n] = [n] 3[n 2] + 2 [n + 1] 2 [n] (13)
2 2

which, operating a bit can be rewriten exactly as in Eq. 11.

Is the system stable?
There are two alternative ways of anwering this question:

Yes because the ROC of H(z) (|z| > 21 ) includes the unit circle.

Yes because the system is causal and all the poles of the system func-
tion are inside the unit circle.