Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (2024)

Colophon#

  • The source code for this page is dt_systems/2/z_transform.ipynb.

  • You can view the notes for this presentation as a webpage (HTML).

  • This page is downloadable as a PDF file.

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#

Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (1)

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#

Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (2)

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#

\[\mathcal{Z}\left\{f[n]\right\} = F(z) = \sum_{n=0}^{\infty} f[n]z^{-n}\]

\[\mathcal{Z}^{ - 1}\left\{ {F(z)} \right\} = f[n] = \frac{1}{2\pi j}\oint\limits_{} {F(z){z^{k - 1}}\,dz}\]

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:

\[x_s(t) = x(t)\sum_{n=0}^{\infty}\delta(t-nT_s)\]

By the sampling property of \(\delta(t)\)

\[x_s(t) = \sum_{n=0}^{\infty}x(nT_s)\delta(t-nT_s)\]

Using the Laplace transform pairs \(\delta(t) \Leftrightarrow 1\) and \(\delta(t-T) \Leftrightarrow e^{-sT}\) we obtain:

\[X_s(s) = \mathcal{L}\left\{\sum_{n=0}^{\infty}x(nT_s)\delta(t-nT_s)\right\} = \sum_{n=0}^{\infty}x(nT_s)e^{-nsT_s}\]

By substitution of \(z = e^{sT_s}\) and representing samples \(x(nT_s)\) as sequence \(x[n]\):

\[X(z) = \sum_{n=0}^{\infty}x[n]z^{-n}\]

Properties of the z-Transform#

Property

Discrete Time Domain

\(\displaystyle{\mathcal{Z}}\) Transform

1

Linearity

\(\displaystyle{af_1[n]+bf_2[n]+\cdots}\)

\(\displaystyle{aF_1(z)+bF_2(z)+\cdots}\)

2

Shift of \(\displaystyle{x[n]u_0[n]}\)

\(\displaystyle{f[n-m]u_0[n-m]}\)

\(\displaystyle{z^{-m}F(z)}\)

3

Left shift

\(\displaystyle{f[n-m]}\)

\(\displaystyle{z^{-m}F(z)+\sum_{n=0}^{m-1}f[n-m]z^{-n}}\)

4

Right shift

\(\displaystyle{f[n+m]}\)

\(\displaystyle{z^{m}F(z)+\sum_{n=-m}^{-1}f[n+m]z^{-n}}\)

5

Multiplication by \(\displaystyle{a^n}\)

\(\displaystyle{a^nf[n]}\)

\(\displaystyle{F\left(\frac{z}{a}\right)}\)

6

Multiplication by \(\displaystyle{e^{-nsT_s}}\)

\(\displaystyle{e^{-nsT_s}f[n]}\)

\(\displaystyle{F\left(e^{sT_s}z\right)}\)

7

Multiplication by \(\displaystyle{n}\)

\(\displaystyle{nf[n]}\)

\(\displaystyle{-z\frac{d}{dz}F(z)}\)

8

Multiplication by \(\displaystyle{n^2}\)

\(\displaystyle{n^2f[n]}\)

\(\displaystyle{-z\frac{d}{dz}F(z)+z^2\frac{d^2}{dz^2}F(z)}\)

9

Summation in time

\(\displaystyle{\sum_{m=0}^{n}f[m]}\)

\(\displaystyle{\frac{z}{z-1}F(z)}\)

10

Time convolution

\(\displaystyle{f_1[n]*f_2[n]}\)

\(\displaystyle{F_1(z)F_2(z)}\)

11

Frequency convolution

\(\displaystyle{f_1[n]f_2[n]}\)

\(\displaystyle{\frac{1}{j2\pi }\oint {x{F_1}(v){F_2}\left( {\frac{z}{v}} \right)} {v^{ - 1}}dv}\)

12

Initial value theorem

\(\displaystyle{f[0]=\lim_{z\to\infty}F(z)}\)

13

Final value theorem

\(\displaystyle{\lim_{n\to\infty}f[n]=\lim_{z\to 1}(z-1)F(z)}\)

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

Some Selected Common z-Transforms#

The Geometric Sequence#

\[\begin{split}f[n] = \left\{ {\begin{array}{*{20}{c}}0&{n = - 1, - 2, - 3, \ldots }\\a^n&{n = 0,1,2,3, \ldots }\end{array}} \right.\end{split}\]

\[F(z) = \sum_{n=0}^{\infty}f[n]z^{-n} = \sum_{n=0}^{\infty}a^n z^{-n} = \sum_{n=0}^{\infty}\left(az^{-1}\right)^n\]

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

\[F(z) = \frac{1}{1-az^{-1}}=\frac{z}{z -a}\]

Notes

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

  2. This function converges only if

    \(\displaystyle{|z| < |a|}\)

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

    \(\displaystyle{r=|a|}\).

Region of convergence#

Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (3)

The Delta Sequence#

\[\begin{split}\delta [n] = \left\{ {\begin{array}{*{20}{c}}1&{n = 0}\\0&\mathrm{otherwise}\end{array}} \right.\end{split}\]

\[\mathcal{Z}\left\{\delta [n]\right\} = \Delta(z) = \sum_{n=0}^{\infty}\delta[n]z^{-n} = 1 + \sum_{n=1}^{\infty}0z^{-n} =1\]

\[\delta [n] \Leftrightarrow 1\]

The Unit Step#

\[\begin{split}{u_0}[n] = {\rm{ }}\left\{ {\begin{array}{*{20}{c}}0&{n < 0}\\1&{n \ge 0}\end{array}} \right.\end{split}\]

Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (4)

Z-Transform of Unit Step#

\[\mathcal{Z}\left\{u_0 [n]\right\} U_0(z) = \sum_{n=0}^{\infty}u_0[n]z^{-n} =\sum_{n=0}^{\infty}z^{-n}\]

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

\[U_0(z) = \frac{1}{1-z^{-1}} = \frac{z}{z - 1}\]

Region of convergence is

\[|z| > 1\]

Exponential Decay Sequence#

\[f[n] = e^{-naT_s}{u_0}[n]\]

\[F(z) = \sum_{n=0}^{\infty}e^{-nasT_s}z^{-n} =1+e^{-aT_s}z^{-1}+e^{-2aT_s}z^{-2}+e^{-a3T_s}z^{-3}+\cdots\]

This is a geometric sequence with \(a = e^{-aT_s}\), so

\[\mathcal{Z}\left\{e^{-naT_s}{u_0}[n]\right\} = \frac{1}{1-e^{-aT_s}z^{-1}} = \frac{z}{z-e^{-aT_s}}\]

Region of convergence is

\[|e^{-aT_s}z^{-1}| < 1\]

Ramp Function#

\[f[n] = nu_0[n]\]

\[\mathcal{Z}\left\{nu_0[n]\right\}=\sum_{n=0}^{\infty} nz^{-n} = 0 + z^{-1}+2z^{-2}+3z^{-3}+\cdots\]

We recognize this as a signal \(u_0[n]\) multiplied by \(n\) for which we have the property

\[nf[n] \Leftrightarrow -z\frac{d}{dz}F(z)\]

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

\[nu_0[n] \Leftrightarrow \frac{z}{(z-1)^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.

\(\displaystyle{\delta[n]}\)

\(\displaystyle{1}\)

2

\(\displaystyle{\delta[n-m]}\)

\(\displaystyle{z^{-m}}\)

3

\(\displaystyle{a^nu_0[n]}\)

\(\displaystyle{\frac{z}{z-a}}\)

\(\mid z \mid > a\)

4

\(\displaystyle{u_0[n]}\)

\(\displaystyle{\frac{z}{z-1}}\)

\(\mid z \mid > 1\)

5

\(\displaystyle{(e^{-anT_s})u_0[n]}\)

\(\displaystyle{\frac{z}{z-e^{-aT_s}}}\)

\(\displaystyle{\mid e^{-aT_s}z^{-1} \mid < 1}\)

6

\(\displaystyle{(\cos naT_s)u_0[n]}\)

\(\displaystyle{\frac{z^2 - z\cos aT_s}{z^2 -2z\cos aT_s + 1}}\)

\({ \mid z \mid> 1}\)

7

\(\displaystyle{(\sin naT_s)u_0[n]}\)

\(\displaystyle{\frac{z\sin aT_s}{z^2 -2z\cos aT_s + 1}}\)

\({\mid z \mid > 1}\)

8

\(\displaystyle{(a^n\cos naT_s)u_0[n]}\)

\(\displaystyle{\frac{z^2 - az\cos aT_s}{z^2 -2az\cos aT_s + a^2}}\)

\({\mid z \mid > 1}\)

9

\(\displaystyle{(a^n\sin naT_s)u_0[n]}\)

\(\displaystyle{\frac{az\sin aT_s}{z^2 -2az\cos aT_s + a^2}}\)

\({\mid z \mid > 1}\)

10

\(\displaystyle{u_0[n]-u_0[n-m]}\)

\(\displaystyle{\frac{z^m-1}{z^{m-1}(z-1)}}\)

11

\(\displaystyle{nu_0[n]}\)

\(\displaystyle{\frac{z}{(z-1)^2}}\)

12

\(\displaystyle{n^2u_0[n]}\)

\(\displaystyle{\frac{z(z+1)}{(z-1)^3}}\)

13

\(\displaystyle{[n+1]u_0[n]}\)

\(\displaystyle{\frac{z^2}{(z-1)^2}}\)

14

\(\displaystyle{a^n n u_0[n]}\)

\(\displaystyle{\frac{az}{(z-a)^2}}\)

15

\(\displaystyle{a^n n^2 u_0[n]}\)

\(\displaystyle{\frac{az(z+a)}{(z-a)^3}}\)

16

\(\displaystyle{a^n n[n+1] u_0[n]}\)

\(\displaystyle{\frac{2az^2}{(z-a)^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) = \sum_{n=0}^{\infty}f[n]e^{-nsT_s}\]

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

\[F(z) = \sum_{n=0}^{\infty}f[n]z^{-n}\]

It follows that

\[z = e^{sT_s}\]

And

\[s = \frac{1}{T_s}\ln z\]

Mapping of s to z#

Since \(s\) and \(z\) are both complex variables, \(z=e^{sT_s}\) is a mapping from the \(s\)-domain to the \(z\)-domain and \(z = (\ln z)/T_s\) is a mapping from the \(z\) to \(s\)-domain.

Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (5)

Now, since

\[s = \sigma + j\omega\]

\[z = e^{\sigma T_s + j\omega T_s} = e^{\sigma T_s}e^{j\omega T_s} = |z|e^{j\theta}\]

where

\[|z| = e^{\sigma Ts}\]

and

\[\theta = \omega T_s.\]

Introduction of sampling frequency#

Now, since \(T_s = 1/f_s\) then \(\omega_s = 2\pi/f_s\) or \(f_s = \omega_s/(2\pi)\) and \(T_s = 2\pi/\omega_s\)

We let

\[\theta = \omega T_s = \omega\frac{2\pi}{\omega_s} = 2\pi\frac{\omega}{\omega_s}\]

Hence by substitution:

\[z = e^{\sigma t}e^{j2\pi\omega/\omega_s}\]

Interpretation of the mapping s to z#

  • The quantity \(e^{j2\pi\omega/\omega_s}\) defines a unit-circle in the \(z\)-plane centred at the origin.

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

  • What are the consequences of this?

Case I: \(\sigma < 0\)#

  • When \(\sigma < 0\) we see that from

    \[|z| = e^{\sigma T_s}\]

    that

    \[|z| < 1\]

  • The left-half plane of the \(s\)-domain maps into the unit circle in the \(z\)-plane.

  • Different negative values of \(\sigma\) map onto concentric circles with radius less than unity.

Case II: \(\sigma > 0\)#

  • When \(\sigma > 0\) we see that from

    \[|z| = e^{\sigma T_s}\]

    that

    \[|z| > 1\]

  • The right-half plane of the \(s\)-domain maps outside the unit circle in the \(z\)-plane.

  • Different positive values of \(\sigma\) map onto concentric circles with radius greater than unity.

Case III: \(\sigma = 0\)#

  • When \(\sigma = 0\),

    \[|z| = 1\]

    and

    \[\theta = \frac{2\pi\omega}{\omega_s}\]

  • All values of \(\omega\) lie on the circumference of the unit circle.

Stability Region - s-Plane#

Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (6)

Stability Region - z-Plane#

Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (7)

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=\pm j\omega\)) map onto the \(z\)-plane.

  • We already know that these frequencies will map onto the unit circle and by \(\theta = 2\pi\omega/\omega_s\) the angles are related to the sampling frequency.

  • Let’s see how

Mapping of multiples of sampling frequency#

\(\omega\) [radians/sec]

\(\mid z\mid \)

\(\theta\) [radians]

1

\(\omega_s/8\)

1

\(\pi/4\)

\(\omega_s/4\)

1

\(\pi/2\)

\(3\omega_s/8\)

1

\(3\pi/4\)

\(\omega_s/2\)

1

\(\pi\)

\(5\omega_s/8\)

1

\(5\pi/4\)

\(3\omega_s/4\)

1

\(3\pi/2\)

\(7\omega_s/8\)

1

\(7\pi/4\)

\(\omega_s\)

1

\(2\pi\)

Mapping of s-plane to z-plane#

Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (8)

Mapping z-plane to s-plane#

There is no unique mapping of \(z\) to \(s\) since

\[s = \frac{1}{T_s} \ln z\]

but for a complex variable

\[\ln z = \ln z \pm j2n\pi\]

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 \(\pm n\omega_s\).

Frequency aliasing#

  • It’s worth observing that any stable complex pole in the \(s\)-plane \(s=-\sigma + j\omega\) will have complex conjugate pair \(s = -\sigma - j\omega\).

  • Providing \(\omega < \omega_s/2\) these poles will be mapped to the upper and lower half-plane of the \(z\)-plane respectively.

  • If \(\omega > \omega_s/2\), an upper-half plane pole will be mapped to the lower-half plane and will have an effective frequency of \(\omega_s/2 - \omega\).

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

This is another way of looking at aliasing.

  • Also, any poles with frequency \(\omega > \omega_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.

Discrete-Time Systems and the Z-Transform — EG-247 Digital Signal Processing (2024)

FAQs

What is discrete-time system using Z transform? ›

The z-transform method of analysis of discrete-time systems parallels the Laplace trans- form method of analysis of continuous-time systems, with some minor differences. In fact, we shall see that the z-transform is the Laplace transform in disguise.

What is z transform in digital signal processing? ›

In mathematics and signal processing, the Z-transform converts a discrete-time signal, which is a sequence of real or complex numbers, into a complex valued frequency-domain (the z-domain or z-plane) representation. It can be considered a discrete-time equivalent of the Laplace transform (the s-domain or s-plane).

What are discrete-time systems in digital signal processing? ›

Discrete-time systems are signal processing entities that process discrete-time signals, i.e., sequences of signal values that are generally obtained as equidistant samples of continuous-time waveforms along the time axis.

What is the difference between discrete signal processing and digital signal processing? ›

A discrete time signal is quantised in time only, a digital signal is quantised both in time and amplitude. Neither a continuous amplitude discrete-time signal, nor a quantized discrete-time signal are digital signals.

Where are Z transforms used? ›

The Z transform converts discrete time domain signals to discrete frequency domain signals. In mathematics as well as digital signal processing, it has a wide range of applications. It is primarily used to analyze and process digital data.

What is an example of a discrete-time control system? ›

The examples are a furnace, chemical reactors and a set of machine parts functioning together to perform a particular operations such as servo system etc. Data Conversion Process: Signal Sampling, Quantizing and Encoding Signal sampling is the first step of transmission of analog signal over digital signal.

What is the application of z-transform in modern technology? ›

Z transform is used to convert discrete time domain signal into discrete frequency domain signal. It also having wide range of applications in mathematics and digital signal processing. It is mostly used to analyze and process digital data.

What is z transformation used for? ›

The Z-Transform is a cornerstone concept in signal processing, and it's used to manipulate and analyze discrete, finite signals.

What are the disadvantages of z-transform? ›

Limitations – The primary limitation of the Z-transform is that using Z-transform, the frequency domain response cannot be obtained and cannot be plotted.

What is an example of a discrete-time signal? ›

It is hard to think of examples of real-world discrete-time signals, since most real-world signals are continuous; however, if you took the temperature reading of a room every day at the same time, the result would be a discrete-time signal.

What are the two types of discrete-time systems? ›

The discrete time systems can be classified as follows:
  • Static/Dynamic.
  • Causal/Non-Causal.
  • Time invariant/Time variant.
  • Linear/Non-Linear.
  • Stable/Unstable.

What are the advantages of z transform? ›

Stability Analysis: The z-transform is better suited for analyzing the stability of discrete-time systems than the Laplace transform. It is because the z-transform provides a way to analyze the poles and zeros of the transfer function of a system, which are important indicators of stability.

What are the 3 types of signal processors? ›

Equalizers, reverbs, and dynamics are the most common signal processors. As you can probably imagine, there are many more effects, but they are not nearly as common as EQ, reverb, and dynamics.

Is every discrete-time signal a digital signal? ›

A digital signal, on the other hand, is a signal that only changes at discrete time instants ánd can take a discrete set of different values. So, all digital signals are discrete time signals; but not all discrete time signals are digital.

Is digital signal processing useful? ›

DSP can clarify or standardize digital signals, but it can also perform various other tasks, such as filtering, compression and modulation. DSP algorithms can also help differentiate between orderly signals and noise, but they are not always perfect. All communications circuits contain some noise.

What is the z-transform of a discrete equation? ›

The formula for Z-Transform is given as X(z) = Σ x[n] * z⁻ⁿ, where x[n] is a finite length signal, [0, N] is the sequence support interval, z is any complex number, and N is an integer.

Is z-transform continuous or discrete? ›

The Z-Transform is a mathematical technique used in the field of signal processing and system analysis. It is a discrete-time equivalent of the Laplace Transform (deals with continuous time signals) and is particularly useful when dealing with digital signals.

What is z-transform discrete correlation function? ›

The z -transformed discrete correlation function (ZDCF) is a method for estimating the CCF of sparse, unevenly sampled light curves. Unlike the commonly used interpolation method, it does not assume that the light curves are smooth and it does provide errors on its estimates.

What is the z-transform of a discrete-time signal in Matlab? ›

Z transform is used to convert discrete time signals into the frequency domain. Discrete time signal includes real as well as imaginary values (Complex numbers). In Matlab ztrans function is used to find the z transform of any signal. We can pass one, two, or three arguments through ztrans function.

Top Articles
Latest Posts
Article information

Author: The Hon. Margery Christiansen

Last Updated:

Views: 6295

Rating: 5 / 5 (70 voted)

Reviews: 85% of readers found this page helpful

Author information

Name: The Hon. Margery Christiansen

Birthday: 2000-07-07

Address: 5050 Breitenberg Knoll, New Robert, MI 45409

Phone: +2556892639372

Job: Investor Mining Engineer

Hobby: Sketching, Cosplaying, Glassblowing, Genealogy, Crocheting, Archery, Skateboarding

Introduction: My name is The Hon. Margery Christiansen, I am a bright, adorable, precious, inexpensive, gorgeous, comfortable, happy person who loves writing and wants to share my knowledge and understanding with you.