Unit 5.2: Discrete-Time Systems and the Z-Transform#

Colophon#

Scope and Background Reading#

This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and Laplace transforms, we present the definition, define the properties and give some applications of the use of the z-transform in the analysis of signals that are represented as sequences and systems represented by difference equations.

The material in this presentation and notes is based on Chapter 9 of [Karris, 2012] from the Required Reading List. Additional coverage is to be found in Chapter 13 of [Boulet, 2006] from the Recommended Reading List.

Agenda#

  • Introduction

  • The Z-Transform

  • Properties of the Z-Transform

  • Some Selected Z-Transforms

  • Relationship between Laplace and Z-Transform

  • Stability Regions

Introduction#

CT to DT System

In the remainder of this course we turn our attention to how we model and analyse the behaviour of the central block in this picture.

Nature of the signals#

Nature of the signals

The signals we process in discrete time systems are sequences of values x[n] where n is an index.

A sequence can be obtained in real-time, e.g. as the output of a ADC, or can be stored in digital memory; processed and re-stored; or processed and output in real-time, for example in digital music.

Nature of the systems#

  • The input to a discrete time system is a squence of values x[n]

  • The output is also a sequence y[n]

  • The block represents the operations that convert x[n] into y[n].

  • This processing takes the form of a difference equation

  • This is analogous to the representation of continuous-time operations by differential equations.

Transfer function model of a DT system#

  • In CT systems we use the Laplace transform to simplify the analysis of the differential equations

  • In DT systems the z-Transform allows us to simplify the analysis of the difference equations

  • In CT systems application of the Laplace transform allows us to represent systems as transfer functions and solve convolution problems by multiplication

  • The z-transform provides analogous tools for the analysis of DT systems.

The Z-Transform#

Z{f[n]}=F(z)=n=0f[n]zn
Z1{F(z)}=f[n]=12πjF(z)zk1dz

Sampling and the Z-Transform#

In the last lecture we showed that sampling could be represented as the multiplication of a CT signal by a periodic train of impulses:

xs(t)=x(t)n=0δ(tnTs)

By the sampling property of δ(t)

xs(t)=n=0x(nTs)δ(tnTs)

Using the Laplace transform pairs δ(t)1 and δ(tT)esT we obtain:

Xs(s)=L{n=0x(nTs)δ(tnTs)}=n=0x(nTs)ensTs

By substitution of z=esTs and representing samples x(nTs) as sequence x[n]:

X(z)=n=0x[n]zn

Properties of the z-Transform#

 

Property

Discrete Time Domain

Z Transform

1

Linearity

af1[n]+bf2[n]+

aF1(z)+bF2(z)+

2

Shift of x[n]u0[n]

f[nm]u0[nm]

zmF(z)

3

Left shift

f[nm]

zmF(z)+n=0m1f[nm]zn

4

Right shift

f[n+m]

zmF(z)+n=m1f[n+m]zn

5

Multiplication by an

anf[n]

F(za)

6

Multiplication by ensTs

ensTsf[n]

F(esTsz)

7

Multiplication by n

nf[n]

zddzF(z)

8

Multiplication by n2

n2f[n]

zddzF(z)+z2d2dz2F(z)

9

Summation in time

m=0nf[m]

zz1F(z)

10

Time convolution

f1[n]f2[n]

F1(z)F2(z)

11

Frequency convolution

f1[n]f2[n]

1j2πxF1(v)F2(zv)v1dv

12

Initial value theorem

f[0]=limzF(z)

13

Final value theorem

limnf[n]=limz1(z1)F(z)

For proofs refer to Section 9.2 of [Karris, 2012].

Some Selected Common z-Transforms#

The Geometric Sequence#

f[n]={0n=1,2,3,ann=0,1,2,3,
F(z)=n=0f[n]zn=n=0anzn=n=0(az1)n

After some analysis1, this can be shown to have a closed-form expression2

F(z)=11az1=zza

Notes

  1. See Karris pp 9-12—9-13[Karris, 2012] for the details.

  2. This function converges only if

    |z|<|a|

    and the region of convergence is outside the circle centred at z=0 with radius

    r=|a|.

Region of convergence#

Region of convergence

The Delta Sequence#

δ[n]={1n=00otherwise
Z{δ[n]}=Δ(z)=n=0δ[n]zn=1+n=10zn=1
δ[n]1

The Unit Step#

u0[n]={0n<01n0

Unit step sequence

Z-Transform of Unit Step#

Z{u0[n]}U0(z)=n=0u0[n]zn=n=0zn

This is a special case of the geometric sequence with a=1 so

U0(z)=11z1=zz1

Region of convergence is

|z|>1

Exponential Decay Sequence#

f[n]=enaTsu0[n]
F(z)=n=0enasTszn=1+eaTsz1+e2aTsz2+ea3Tsz3+

This is a geometric sequence with a=eaTs, so

Z{enaTsu0[n]}=11eaTsz1=zzeaTs

Region of convergence is

|eaTsz1|<1

Ramp Function#

f[n]=nu0[n]
Z{nu0[n]}=n=0nzn=0+z1+2z2+3z3+

We recognize this as a signal u0[n] multiplied by n for which we have the property

nf[n]zddzF(z)

After applying the property and some manipulation, we arrive at:

nu0[n]z(z1)2

z-Transform Tables#

As usual, we can rely on this and similar analysis to have been tabulated for us and in practice we can rely on tables of transform pairs, such as this one.

 

f[n]

F(z).

Region of Convergence

1.

δ[n]

1

2

δ[nm]

zm

3

anu0[n]

zza

z∣>a

4

u0[n]

zz1

z∣>1

5

(eanTs)u0[n]

zzeaTs

eaTsz1∣<1

6

(cosnaTs)u0[n]

z2zcosaTsz22zcosaTs+1

z∣>1

7

(sinnaTs)u0[n]

zsinaTsz22zcosaTs+1

z∣>1

8

(ancosnaTs)u0[n]

z2azcosaTsz22azcosaTs+a2

z∣>1

9

(ansinnaTs)u0[n]

azsinaTsz22azcosaTs+a2

z∣>1

10

u0[n]u0[nm]

zm1zm1(z1)

11

nu0[n]

z(z1)2

12

n2u0[n]

z(z+1)(z1)3

13

[n+1]u0[n]

z2(z1)2

14

annu0[n]

az(za)2

15

ann2u0[n]

az(z+a)(za)3

16

ann[n+1]u0[n]

2az2(za)3

Relationship Between the Laplace and Z-Transform#

Given that we can represent a sampled signal in the complex frequency domain as the infinite sum of each sequence value delayed by an integer multiple of the sampling time:

F(s)=n=0f[n]ensTs

And by definition, the z-transform of such a sequence is:

F(z)=n=0f[n]zn

It follows that

z=esTs

And

s=1Tslnz

Mapping of s to z#

Since s and z are both complex variables, z=esTs is a mapping from the s-domain to the z-domain and z=(lnz)/Ts is a mapping from the z to s-domain.

Mapping of s to z

Now, since

s=σ+jω
z=eσTs+jωTs=eσTsejωTs=|z|ejθ

where

|z|=eσTs

and

θ=ωTs.

Introduction of sampling frequency#

Now, since Ts=1/fs then ωs=2π/fs or fs=ωs/(2π) and Ts=2π/ωs

We let

θ=ωTs=ω2πωs=2πωωs

Hence by substitution:

z=eσtej2πω/ωs

Interpretation of the mapping s to z#

  • The quantity ej2πω/ωs defines a unit-circle in the z-plane centred at the origin.

  • And of course the term σ represents the (stability) boundary between the left- and right-half planes of the s-plane.

  • What are the consequences of this?

Case I: σ<0#

  • When σ<0 we see that from

    |z|=eσTs

    that

    |z|<1
  • The left-half plane of the s-domain maps into the unit circle in the z-plane.

  • Different negative values of σ map onto concentric circles with radius less than unity.

Case II: σ>0#

  • When σ>0 we see that from

    |z|=eσTs

    that

    |z|>1
  • The right-half plane of the s-domain maps outside the unit circle in the z-plane.

  • Different positive values of σ map onto concentric circles with radius greater than unity.

Case III: σ=0#

  • When σ=0,

    |z|=1

    and

    θ=2πωωs
  • All values of ω lie on the circumference of the unit circle.

Stability Region - s-Plane#

Stability Region - s-Plane

Stability Region - z-Plane#

Stability Region - z-Plane

Frequencies in the z-Domain#

  • As a consequence of the result for Case III above, we can explore how frequencies (that is is values of s=±jω) map onto the z-plane.

  • We already know that these frequencies will map onto the unit circle and by θ=2πω/ωs the angles are related to the sampling frequency.

  • Let’s see how

Mapping of multiples of sampling frequency#

ω [radians/sec]

z

θ [radians]

0

1

0

ωs/8

1

π/4

ωs/4

1

π/2

3ωs/8

1

3π/4

ωs/2

1

π

5ωs/8

1

5π/4

3ωs/4

1

3π/2

7ωs/8

1

7π/4

ωs

1

2π

Mapping of s-plane to z-plane#

Mapping of s-plane to z-plane

Mapping z-plane to s-plane#

There is no unique mapping of z to s since

s=1Tslnz

but for a complex variable

lnz=lnz±j2nπ

This is in agreement with the theoretical idea that in the frequency domain, sampling creates an infinite number of spectra, each of which is centred around ±nωs.

Frequency aliasing#

  • It’s worth observing that any stable complex pole in the s-plane s=σ+jω will have complex conjugate pair s=σjω.

  • Providing ω<ωs/2 these poles will be mapped to the upper and lower half-plane of the z-plane respectively.

  • If ω>ωs/2, an upper-half plane pole will be mapped to the lower-half plane and will have an effective frequency of ωs/2ω.

  • Similarly, its conjugate pair will move into the upper-half plane.

This is another way of looking at aliasing.

  • Also, any poles with frequency ω>ωs will also be aliased back into into the unit circle.

Summary#

  • Introduction

  • The Z-Transform

  • Properties of the Z-Transform

  • Some Selected Z-Transforms

  • Relationship Between Laplace and Z-Transform

  • Stability Regions

Next session

  • The Inverse Z-Transform – an examples class

Homework#

Problems 1 to 3 in Section 9.10 Exercises of [Karris, 2012] explore the z-Transform

References#

See Bibliography.