0% found this document useful (0 votes)
155 views32 pages

5 2017 04 1709 57 49 Am

1) A discrete time signal x(n) is obtained by sampling an analog signal xa(t) periodically at a rate fs samples per second. 2) For a signal to be perfectly reconstructed from its samples, the sampling frequency fs must be greater than twice the maximum frequency of the sampled signal according to the Nyquist rate. 3) The response y(n) of a linear time-invariant (LTI) system to an input signal x(n) can be computed using the convolution sum, which involves shifting, multiplying, and summing the input signal with the system's impulse response h(n).

Uploaded by

Jonathan Polania
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)
155 views32 pages

5 2017 04 1709 57 49 Am

1) A discrete time signal x(n) is obtained by sampling an analog signal xa(t) periodically at a rate fs samples per second. 2) For a signal to be perfectly reconstructed from its samples, the sampling frequency fs must be greater than twice the maximum frequency of the sampled signal according to the Nyquist rate. 3) The response y(n) of a linear time-invariant (LTI) system to an input signal x(n) can be computed using the convolution sum, which involves shifting, multiplying, and summing the input signal with the system's impulse response h(n).

Uploaded by

Jonathan Polania
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/ 32

Chapter Two Z-Transform

Z-Transform

A- Discrete Time Signals:


The discrete time signal x(n) is obtained by taking samples of the analog signal
xa (t) every Ts seconds as shown in Figure below.

Analog signal Discrete time signal


xa(t) x(n)=xa(nTs)
fs=1/Ts
xa(t)
Sampler x (n)

t n
0 0 1 2 3 4 5
Ts 2Ts 3Ts ..5Ts
( )= ( ) < <
1
= = =

where fs is sampling frequency and Ts is sampling period.


Example 1: Consider an analog sinusoidal signal ( )= (2 + )
which, when sampled periodically at a rate fs = 1/Ts samples per second, yields

x( ) = ( )= (2 + )= 2 + ,

where = 2 is analog frequency and

= T = 2 is digital frequency

1
Chapter Two Z-Transform

Sampler Mathematical Model:


The sampler can be defined as an impulse separator with intervals of Ts and
amplitude of ( T ).
( )

() ( )

() 0 Ts 2Ts 3Ts

( )= ( )

( )= ( ) ( )= (0) ( ) + ( ) ( )+ (2 ) ( 2 ) +

( )= ( ) ( )

Sampling Theorem
To recover the analog signal from its sampled values the sampling
frequency must be greater or equal Nyquist rate. 2 ,where is the
maximum frequency of sampled signal, and is the minimum rate to cover the
original signal =2 is at the Nyquist rate.

Example 2: Consider the analog signal:


x (t) = 3 cos(50t) + 10 sin(300t) cos(100t), what is the Nyquist rate for
this signal?
Solution:
= 25 , = 150 , = 50 ,
Therefore the maximum frequency = 150 , and 2 300 ,
then, the Nyquist rate is 300Hz.
( )= ( ) = 3 cos(0.167 ) + 10 sin( ) cos(0.33 )

2
Chapter Two Z-Transform

Some Elementary Discrete Time Systems:- ( )


1. Unit Sample Sequence
1 = 0 n
( )=
0 0 ( )
1 = 1
( )=
0
no n
2. Unit Step Sequence
( )
1 0 0, 0, 0, 1, 1, 1,
( )= , ( )=
0 <0 1 ....
1 n
( )=
0 < 0 1 2 3
3. Real valued exponential sequence
( )= ( ), (Positive time sequence),
for example, ( ) = 0.9 ( ) 0 10 .
( )= ( 1), (Negative time sequence).
4. Complex valued exponential sequence
( )= ( ) ( )
, for example,( ) = = .
5. Sinusoidal Sequence
( ) = sin( + ) ( ) ( ) = cos( + ) ( ).
6. Unit Ramp Sequence
( ) = n ( ),.
7. Unit Sample Synthesis

( )= ( ) ( ); ( ) ( ) = (0)

8. The geometric series

1
=1+ + += , | |<1
1

3
Chapter Two Z-Transform

1
= ,| | < 1
1
= ,| |<1
( )

Response of LTI Systems to Arbitrary Inputs:


(The Convolution Sum) x(n) y(n)
T[x(n)]
The input is the arbitrary signal x(n) that is expressed as a h(n)

sum of weighted impulses:

x(n) = ( ) ( )

The response of the system to x (n) is the corresponding sum of weighted outputs
y(n)=T[x(n)]= [ ( ) ( )]

= ( ) [ ( )]]

Since the impulse response h(n)=T[ ( )] then by the time-invariance property, the
response of the system to the delayed unit sample sequence ( ) is
h(n-k)=T[ ( )]
Then the output response of the LTI system as a function of the input sign al x(n)
and the impulse response h(n) can be expressed as

( ) = ( ) ( ) = ( )( ) = ( ) ( )

The equation above is called convolution sum.


To summarize, the process of computing the convolution between x(k) and h(k)
involves the following four steps:
1. Folding. Fold h(k) about k = 0 to obtain h(k).
2. Shifting. Shift h(k) by no to the right (left) if no is positive (negative), to obtain
h(n0 k).
4
Chapter Two Z-Transform

3. Multiplication. Multiply x(k) by h(n0 k) to obtain the product sequence


vno(k) =x(k)h(n0 k).
4. Summation. Sum all the values of the product sequence vno(k) to obtain the
value of the output at time n = n0.
Example 3: Find ( ) ( )by using a graphical method?
( )
( ) 3
2
1
0.5
n n
-2 -1 0 1 2 3 4 -1 0 1 2 3 4

Solution:

( )= ( ) ( ) = ( )( )

( ) ( )
3 2 3
2
1 1

k k
-3 -2 -1 0 n-3 n-2 n-1 n

1. 1 ( )=0
2. =0
( ) (0)
3 ( )
2 1.5
1
0.5
k k
-3 -2 -1 0 0 1 2 0

(0) = ( )( ) = 1.5

5
Chapter Two Z-Transform

3. =1

(1 ) (1)
3 ( )
2
1 1.5
1
0.5
k k
-2 -1 0 1 0 1 2 0 1

(1) = ( )(1 ) = 2.5

4. =2
(2)
(2 )
3 ( )
2
1 1.5
0.5 1
0.5
k k
-1 0 1 2 0 1 2 0 1 2

(2) = ( )(2 ) = 3

5. =3

(3 ) (3)

3 ( )
2
1
1 0.5
0.5
k k
0 1 2 3 0 1 2 0 1 2

(3) = ( )(3 ) = 1.5

6. =4
(4)
(4 )
3 ( )
2
1 0.5
0.5
k k 0 1 2
0 1 2 3 4 0 1 2
6
Chapter Two Z-Transform

(4) = ( )(4 ) = 0.5

7. 5 ( )=0

( ) = {0, 0, 1.5, 2. 5, 3, 1.5, 0.5, 0, 0, }


( )
3
2.5

1.5 1.5

0.5

n
-2 -1 0 1 2 3 4 5 6

HW : the impulse response of a linear time invariant system is


h(n)={ 1,2,1,-1}

Determine the response of the system to the input signal


x(n)={ 1,2,3,1}

Example 4: Suppose a linear shift invariant system with input x(n) and output y(n)
is characterized by its unit sample response h(n)=an u(n) for 0 < a < 1. Find the
( )
response y(n) of such system to the input signal x(n)=u(n).
1 ....
Solution:
no n
( )= ( ) ( )
( )

= ( ) ( ) 1
....
no n
= = ( ) ( ) ( )
1 ....
n
no
7
Chapter Two Z-Transform

System Properties
1-Linear and nonlinear: A system is said to be linear if
T[a1x1(n)+a2x2(n)]=a1T[x1(n)]+a2T[x2(n)]
For any two input x1(n) and x2(n) and for any complex constant a1 and a2.
2- Shift invariance (Time invariance) : T[x(n-n0)]=y(n-n0)
3- Causality: If has zero values for n<0.
4-Stability: the system is stable if for any bounded input |x(n)| < ,the output
will be bounded |y(n)|< (BIBO)
For LTI system, stability is S= | ( )| <

Example 5: a given system is represented by the following input output formula


y(n)=T[x(n)]=n x(n). Show whether the system is linear or nonlinear and time
varying or not.
Solution:
Linearity: let x(n)= a1x1(n)+a2x2(n)
y(n)=n[a1x1(n)+a2x2(n)]= a1 n x1(n)+a2 n x2(n)= a1T[x1(n)]+a2T[x2(n)]
system is linear
Shift invariance: let x(n)=u(n) y(n)=nu(n)
If x(n)=u(n-2) y(n)=n u(n-2) y(n-2)
system is shift varying
Example 6 : a LTI system is characterized by h(n)=an u(n) . Classify this system if
causal or non-causal an stable or unstable.
Solution:
Causality: the system is causal since h(n) is zero for n<0
Stability: S= | ( )| = | |= <0
| |

If |a|<1 the system is BIBO and hence it is stable since S is finite.


If |a| 1 is unstable since S diverges

8
Chapter Two Z-Transform

B- The Direct Z-Transform

From Fourier Transform to Z- Transform:

The time representation of the discrete signal is:

( )= ( ) ( )

By taking the Fourier transform for both sides

{ ( )} = ( ) ( ( )) ( )

{ ( )} = ( )

Where =
The Z-transform is defined by replacing with z to yield

X( ) = { ( )} = ( ) = ( )

{ ( )} = ( )

The z in the above definition is a complex variable and the set of z values for
which the summation converges is called the region of convergence (ROC) for the
transform. In general this region is bounded by
<| |< ,
where is lower (minimum) limit of this region may be zero, and is upper
(maximum) limit of it may be infinity.

9
Chapter Two Z-Transform

Example 7: Find the Z-transform including the region of convergence of

( )= 0
0 <0
Solution:

X( ) = ( ) = { ( )} = ( )

By using the geometric series

1
= 1+ + += ,| | < 1
1
1
X( ) = ( ) = =
1 1
The above result converges if | |<1 | |>| |
( )
Most useful z-transforms can be expressed in the form,X( ) = ,where P(z)
( )

and Q(z) are polynomials in z represent the numerator and denominator of X(z)
respectively. The values of z for which P(z) and X(z) equal to zero are called the
zeros of X(z), and the values with Q(z) = 0 and X(z) goes to infinity are called the
poles.
Imaginary

Zero at Pole at
origin Z=a

Real

| |>| |
Boundary of region of
convergence (ROC)

Example 8: Find the Z-transform including the region of convergence of


( )= ( 1)
Solution:

10
Chapter Two Z-Transform

X( ) = ( ) = { ( 1)} = ( )

By letting n=m in the above summation, that is changed the variables, and
since interchanging the order of summation has not changed the sign, X(z)
becomes

X( ) = =1 ( )

The last step was obtained by adding the m=0 term to the sum and subtracting
it from the total. By using the geometric progression formula to evaluate the
infinite sum, X(z) becomes.
1
X( ) = 1 =
1
and hence the ROC of this transform is | / | < 1 | | < | |
Imagenary

Zero at Pole at
origion Z=b

Real

| |<| | Boundary of region of


convergence (ROC)
| |=| |

Example 9: Find the Z-transform including the region of convergence of


( )= ( ) ( 1)
Solution:

X( ) = ( ) = { ( ) ( 1)}

11
Chapter Two Z-Transform

X( ) = { ( )} { ( 1)} = +

From previous two examples the regions of convergence of them are| | > | |
and | | < | | respectively. And the final region of convergence of the result in this
example is the intersection between these two regions.
{| | > | |} {| | < | |}
For drawing this region, it depends upon the values of the two variables a and b.
If | | < | |, the above intersection is the empty set, i.e. the transform
doesn't converge.
If | | > | |, the transform converges in the annular region as shown
in Figure below.

Imagenary Imagenary
ROC

b a Real a b Real

Example 10: Find the Z-transform including the region of convergence of


1) ( ) = ( ) 2) ( ) = ( ) >0
Solution:

1) X( ) = ( ) = { ( )} = = 1,

12
Chapter Two Z-Transform

2) X( ) = ( ) = { ( )} = { ( )}

= { ( )} = , | |>0

Example 11: Find the Z-transform including the region of convergence of


( )= ( )
Solution:

1
X( ) = ( ) = { ( )} = =
1

{ ( )} = , | |>1
1

Properties of Z-transform
1. Linearity
If X ( ) = { ( )} <| |<
X ( ) = { ( )} <| |<
Then
{ ( )+ ( )} = X ( )+ X ( )
= { }
2. Translation {Shifting}
{ ( )} = X( ) <| |<
Then
{ ( )} = X( )

Proof:

{ ( )} = ( )

Let n-no=m

13
Chapter Two Z-Transform

{ ( )} = ( ) = X( )

Example 12: Find the Z-transform including the region of convergence of


( ) = ( 4)
Solution: X( ) = { ( 4)} = { ( )} = = , | |>1
3. Multiplication by an exponential

{ ( )} = X( )| =X | | <| |<| |

{ ( )} = X( )| =X

| |
<| |<| |
Proof:

1) { ( )} = ( ) = ( )( ) = ( )

2) { ( )} = ( ) = ( )( ) = ( )

Example 13: Find the Z-transform including the region of convergence of


( )= ( )
Solution:

{ ( )} = ( ) = = =
(1 ) ( 1)
| |<1| |>1

{ ( )} = ( )

{ ( )} = , | |>
( 1)
4. Multiplication by n (Ramp)
X( )
{ ( )} = , <| |< ( )

14
Chapter Two Z-Transform

Example 14: Find the Z-transform including the region of convergence of


{ ( )}
( )
Solution: { ( )} = { ( )} =

( ). 1 . 1
{ ( )} = = =
( ) ( )
5. Initial value theorem
(0) = lim ( ) = lim X( )

6. Final value theorem


() = lim ( ) = lim(1 )X( )

7. Discrete convolution

( ) ( )= ( ) ( )

{ ( ) ( )} = X ( )X ( ) , ,
Proof:

{ ( ) ( )} = ( ) ( )

= ( ) ( ) =X ( ) ( ) =

= X ( )X ( )
HW: Find { ( ) ( )}
8. Time reversal
( ) X( ) , <| |<
1 1
( ) X( ) , <| |<

HW: Find Z{-n u(-n)}


Example 15: Find the Z-transform including the region of convergence of
( ) = cos( ) ( )
Solution:
15
Chapter Two Z-Transform

+ 1 1
= + = +
2 2 2
1 + 1 2 ( + )
= =
2 ( )( ) 2 +1
1 2
2 cos( ) cos
= = ,
2 ( + )+1 2 cos +1
| |>
| |>1
Example 16: Find the Z-transform including the region of convergence of
( ) = (n 2) ( )
cos( ( 2)) ( 2)

Use {cos( ) ( )} = and any necessary properties.

Solution:
{ ( )} = ( )
cos( ) ( )

( )
= cos( ) ( )

= {cos( ) ( )}|

| | > | |,
cos
{cos( ) ( )} =
2 cos +1

{cos( cos cos


) ( )}| = =
2 cos +1 2 cos +
cos
{ ( )} = =
2 cos +
H.W:
1. {2cos[0.2 ( 1)] ( )}
2. e sin( ) ( )
3. {sinh( ) ( )}

16
Chapter Two Z-Transform

C- The Inverse of Z-transform { ( )}:-

Example 17: Determine the signal ( ) for X( ) = ln(1 + ), | | > | |

Solution:

using { ( )} = X( ) , ln( ) =

1 ( )
X( ) = ( ) X( ) =
1+ 1+
| |<1 | |>| |

Take the inverse of Z-transform for both sides to get:

( )
( )= ( ) = ( ) ( 1)
1+

1
( )= (1) ( 1)

There are many methods to find the inverse of Z-transform

1- Partial fraction method


i) Distinct poles
X( )
=

= lim (

Example 18: Find ( ) for X( ) = for the following ROC's:


. .
) | | > 1 , b) | | < 0.5 and c) 0.5 < | | < 1
Solution:

X( )
X( ) = = = +
1.5 + 0.5 ( 1)( 0.5) 1 0.5

= lim = 2, = lim = 1
( 0.5) . ( 1)
17
Chapter Two Z-Transform
Im ROC
( )
= , X( ) = 2
. .

a- | |>1
Real
1
( ) = 2 ( ) (0.5) ( )

Im
b- | | < 0.5 ROC
( ) = 2 ( 1) + (0.5) ( 1)
Real Im ROC
0.5 1

c- 0.5 < | | < 1


( ) = 2 ( 1) (0.5) ( )
Real
0.5 1

ii) Multiple order poles


X( )
If =

=
( )
Then
1
=
(

= (

Example 19: Find ( )) for X( ) =


( )( )

Solution: X( ) = =
( )( ) ( )( )

X( )
=
( +

18
Chapter Two Z-Transform

1 2 ( + 1) 3
= lim = , = lim =
( + 1) 2 ( + 1) 4

= lim
(
1
X( ) = 2
(
1
( )=
2
Notes:

( )is a right hand sequence (causal or positive time sequence).


( 1)is a left hand sequence (anti-causal or negative time sequence).

Example 20: Find the inverse Z-transform of

+ 1
X( ) = | |>
( 0.5) ( 0.25) 2

Solution:
X( ) +1
=
( 0.5) ( 0.25)

= + + +
( 0.5) ( 0.5) ( 0.5) ( 0.25)

+1 ( 0.25) 1
= lim = 6, = lim = 20
. ( 0.25) . ( 0.25)

1 +1 1 1.25
= lim = lim
2! . ( 0.25) 2! . ( 0.25)
1 2.5( 0.25)
= lim = 80
2 . ( 0.25)

19
Chapter Two Z-Transform

+1
= lim = 80
. ( 0.5)
6 20 80 80
X( ) = +
( 0.5) ( 0.5) ( 0.5) ( 0.25)

( 1) 1 1 1 1
( )=6 ( ) 20 ( ) + 80 ( ) 80 ( )
2 2 2 2 4
Notes: At | |>| |

= ( ).

= 1
( )
( )
( 1)
= 2
( )
( ) 2!

( 1)( 2)( +2)


In general = +1
( )
( ) ( 1)!

HW: Using the partial fraction method to find ( ) for


( )
1- X( ) = ( ) 2 < | | < 3, ( ) | | > 3, ( ) | | < 1
( )( )( )

2- X( ) = | |>
( . ) ( )

3- X( ) = <| |>
( . )( )

2- Power series inverse method (division)


Example 21: Find the inverse Z-transform by division method for
1
X( ) = ( )| | > 1, ( )| | <
3 4 +1 3
Solution:

a) For ROC | | > 1, we must divide to obtain negative power of z


since | | > 1 indicates a right hand sequence.

20
Chapter Two Z-Transform
1 4
+
3 9
3 4 + 10.5
4 1

3 3
4 1

3 3
4 16 4

3 9 9
etc
1 4
X( ) = + + as compare with
3 9
X( ) = + (2) + (1) + (0) + (1) + (2) +

We can recognize that (1) = , (2) =

1 4
( )= ( 1) + ( 2) +
3 9

b) For ROC | | < , must divide to get positive power of z since | | < indicates
a left hand sequence, for negative n.
+4
14 +3
4 3
4 3
4 16 12
13 12

X( ) = + 4 (1) = 1 , (2) = 4

( ) = ( + 1) + 4 ( + 2) +

21
Chapter Two Z-Transform

3- Discrete convolution
Example 23: Find the inverse Z-transform by using discrete convolution method
.
for X( ) =
( )( . )
Solution:

X( ) =
(
( )=

( )=

( )= ( ) ( )=0.632 ( ) (0.632) ( 1)

D-The one-sided Z-transform


The one-sided or unilateral Z-transform of a signal ( ) is defined by:

X ( )= ( ) ( ) X ( )

Example 24: determine the one-sided Z-transform of the signals


1. ( ) = {2, 4, 5, 7, 0, 1} X ( ) = 5 + 7 +
2. ( ) = ( ), >0 X ( )=
3. ( ) = ( + ), >0 0

Shifting property:

1- Shift to right with Initial Condition (I. C.) {Time delay}

{ ( )}

22
Chapter Two Z-Transform

Proof:

X ( )= ( ) X ( )= ( )

let = = + , =0 = , = =

X ( )= ( ) = ( )

= ( ) + ( ) = X ( )+ ( )

Example 25: determine the one-sided Z-transform of the signals

1- ( ) = ( )
2- ( ) = ( 2) ( )=
Solution:

1- X ( ) = =

2- X ( ) = + ( ) = + (2) + (1)

= + +

2- Shift to left with Initial Condition (I. C.) {Time advance}

{ ( + )} = X ( ) ( ) , >0

Proof:

X ( )= ( ) X ( )= ( + )

let = + = , =0 = , = =

23
Chapter Two Z-Transform

X ( )= ( ) = ( )

= ( ) ( ) = X ( ) ( )

Example 26: find Z+ transform for ( + 1)

Solution:

X ( )= ( ) X ( )= ( + 1)

= X ( ) ( ) = {X ( ) (0)}

E. Discrete Time System Realization and Difference Equation


Direct Form Realizations
X(z) H(z) Y(z)
The transfer function of an arbitrary Kth order is given by:


b z +b z + . +b z + b b z
H(z) = =
a z +a z +a z + . +a z +a a z

For causal systems, we must have L K.

To implement the equation above we need to divide the numerator and


denominator by a0 zK and rewrite the equation in the form:

b b b b
z + z + .+ z + z
a a a a
H(z) = a a a a
1+ z + z + .+ z + z
a a a a

24
Chapter Two Z-Transform

Example 27 : Second Order system Realization:

The transfer function of second order system is given by:

b +b z +b z
H(z) =
1+a z +a z

Keep in mind that we express H(z) in terms of z1 to produce a practical


realization that uses time-delay elements rather than time-advance elements.

The linear constant coefficient difference equation (LCCDE) is written as:

Y(z) (1 + a z +a z ) = X(z)(b + b z +b z )

Taking inverse Z-transform, the LCCDE is given by:

y(n) + a y(n 1) + a y(n 1) = b x(n) + b x(n 1) + b x(n 2)

The Direct form implementation of H(z) is shown

b0
x(n) y(n)

b1 a1 z-1
z-1
( ) ( )

z-1 a2 z-1
b2

( ) ( )

Example 28: Given that H(z) = represents a causal system. Find the
difference equation and draw the realization structure.

Solution:

Y(z) z+1 ( + )
H(z) = = =
X(z) z 2z + 3 (1 2 +3 )

25
Chapter Two Z-Transform

Y(z) +
=
X(z) 1 2 +3

( )(1 2 +3 ) = ( )( + )

The LCCDE,

( ) 2 ( 1) + 3 ( 2) = ( 1) + ( 2)

( ) = 2 ( 1) 3 ( 2) + ( 1) + ( 2)

The direct form realization of the discrete time system is shown,

x(n) y(n)

1 z-1
z-1
( ) ( )

z-1 z-1
1

( ) ( )

HW: Given the impulse response of a system h(n)=an u(n). Find the LCCDE
and draw the realization structure.

Inverse Systems
When connected in cascade, a system H(z) and its inverse Hi(z) form an
identity system, where the final output exactly equals the original input. For
this to occur, the transfer function of the composite system must be unity,
which is to say that H(z)Hi(z) = 1.
Example 29: A discrete time system is realized by the structure shown
below.

a) Determine the impulse response. b) Determine a realization for its inverse


system, that is the system which produces x(n) as an output when y(n) is used
as input.

26
Chapter Two Z-Transform

2
w(n)
x(n) y(n)

z-1
0.8 3
Solution: a)

( ) = ( ) + 0.8 ( 1) (1)

( ) = 2 ( ) + 3 ( 1) (2)

Taking Z-transform for (1) and (2) get:


( )
W(z)=X(z)+0.8z-1W(z) W(z)= (3)
.

Y(z)=2 W(z)+3z-1W(z) ( ) = (2 + 3z ) ( ) (4)

Substitute (3) in (4) get:


( ) ( )
Y(z) = (2 + 3z ) = =H(z)
. ( ) .

H(z)= = +2
. . .

The impulse response, h(n)=3(0.8) ( 1) + 2(0.8) ( )


. . . ( )
b) Hi(z)= = = =
( ) . ( )

The difference equation for the inverse system is determined as:

X(z)(1+1.5z-1)=Y(z)(0.5-0.4z-1)

x(n)=1.5 x(n-1)+0.5 y(n)-0.4 y(n-1)

The direct form realization of Hi(z) is shown,


0.5
y(n) x(n)

-0.4 . z-1
z-1

27
Chapter Two Z-Transform

HW: Consider the discrete time system shown below.

a) Determine the analytical expression for the impulse response of the system.

b) Determine a realization for its inverse system.


w(n)
x(n) y(n)

z-1
0.9 2

z-1
3

F. Solution of Linear Constant Coefficient Difference Equations

Example 30: Find the solution to the following linear constant coefficient
difference equation

y(n)-1.5 y(n-1)+0.5 y(n-2)=(0.25)n for n0 with initial condition y(-1)=4 and


y(-2)=10.

Solution : Taking Z-transform for both sides gives:

Y(z)-1.5[z-1 Y(z)+y(-1)]+0.5[z-2Y(z)+z-1y(-1)+y(-2)]=
.

Y(z)-1.5z-1 Y(z)-6+0.5z-2Y(z)+2z-1+5=
.

Y(z)[1-1.5z-1 +0.5z-2] = +12


.

1.5 + 0.5 2 2.25 + 0.5


( ) =
( 0.25)

( ) 2 2.25 + 0.5 1/3 1 2/3


= = + +
( 0.25)( 0.5)( 1) 0.25 0.5 1

28
Chapter Two Z-Transform

Y(z)= + +
. .

y(n)= (0.25) u(n) + (0.5) u(n) + u(n)

HW: Determine the response y(n), n0 of the system described by the second
order difference equation: y(n)-4y(n-1)+4y(n-2)=x(n)-x(n-1)

when the input is x(n)=(1) ( ) and the initial conditions are


y(-1)=y(-2)=0.

29
Chapter Two Z-Transform

Tutorial Sheet No. 2


Z- Transform

1. Determine Z-transform including region of convergence

a) x(n)=n an u(-n-1)

b) x(n) = {1, 0, -1,0,1, -l)

( )
c) ( ) =
( ) <0
2. Compute the convolution of the following signals

( )
( )= and ( )= ( )
( ) <0

3. Using long division, determine the inverse z-transform of

+
( )=
+
4. Determine the causal signal x(n) if its z-transform X(z) is given by:

a) ( ) =

b) ( )=
.

.
c) ( ) =
. .

( )
5. Given ( ) = find x(n) for the following ROC using partial fraction
method: a) ROC |z|>2

b) ROC |z|<1

c) ROC 1<|z|<2

30
Chapter Two Z-Transform

6. Determine the response of the system with impulse response h(n)=an u(n)
to the input signal x(n)=u(n)-u(n-10).

7. Determine the impulse response of the following systems

i)
x(n) z-1 z-1 z-1

y(n)

z-1

ii) x(n) y(n)

z-1 z-1
0.8 0.6

8. Implementation of LTI systems Consider the recursive discrete-time


system described by the difference equation:
y(n)=0.8y(n-1)-0.64 y(n-2) + 0.866 x(n)
Assume zero initial conditions.
9. Let x(n) be a causal sequence with z-transform X(z) whose pole-zero plot is
shown below. Sketch the pole-zero plots and the ROC of the following
sequence:
Im(z)
a) x1(n)=x(2-n)
0.5
b)x2(n)=e x(n)
Re(z)
-1 -0.5 0.5
-0.5

31
Chapter Two Z-Transform

10. We want to design a causal discrete-time LTI system with the property
that if the input is ( ) = ( ) ( )
Then the output is ( ) = ( )

a) Determine the impulse response h(n) and the system function H(z).
b) Find the difference equation that characterizes this system.
c) Determine a realization of the system using direct form implementation.

11. Consider the causal system

( )= ( )+ ( )+ ( )

Determine:
(a) The impulse response
(b) The zero-state step response
(c) The step response if y(-1) = A 0
(d) The response to the input ( )= ( ) 0 <

12. Realize an FIR ilter with impulse response h(n) given by:

a) ( ) = [ ( ) ( )]
b) ( ) = ( ) ( )+ ( )+ ( ) ( )+ ( )

13. Use the one-sided z-transform to determine y(n), n 0 in the following


cases:
a) ( ) + ( ) ( ) = ; ( ) = ( ) =
b) ( ) . ( ) + . ( ) = ; ( ) = , ( ) =
c) ( + ) ( + ) + ( ) = ( ); ( ) = , ( ) =

32

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy