Berkeley Notes
  • Introduction
  • EE120
    • Introduction to Signals and Systems
    • The Fourier Series
    • The Fourier Transform
    • Generalized transforms
    • Linear Time-Invariant Systems
    • Feedback Control
    • Sampling
    • Appendix
  • EE123
    • The DFT
    • Spectral Analysis
    • Sampling
    • Filtering
  • EECS126
    • Introduction to Probability
    • Random Variables and their Distributions
    • Concentration
    • Information Theory
    • Random Processes
    • Random Graphs
    • Statistical Inference
    • Estimation
  • EECS127
    • Linear Algebra
    • Fundamentals of Optimization
    • Linear Algebraic Optimization
    • Convex Optimization
    • Duality
  • EE128
    • Introduction to Control
    • Modeling Systems
    • System Performance
    • Design Tools
    • Cascade Compensation
    • State-Space Control
    • Digital Control Systems
    • Cayley-Hamilton
  • EECS225A
    • Hilbert Space Theory
    • Linear Estimation
    • Discrete Time Random Processes
    • Filtering
  • EE222
    • Real Analysis
    • Differential Geometry
    • Nonlinear System Dynamics
    • Stability of Nonlinear Systems
    • Nonlinear Feedback Control
Powered by GitBook
On this page
  • Laplace Transform
  • Properties of the Laplace Transform
  • The Unilateral Laplace Transform
  • The Z Transform
  • Properties of the Z-Transform
  • Unilateral Z-Transform

Was this helpful?

  1. EE120

Generalized transforms

PreviousThe Fourier TransformNextLinear Time-Invariant Systems

Last updated 3 years ago

Was this helpful?

Laplace Transform

It turns out the CTFT is just a specific case of a more general transform called the Laplace transform.

Definition 32

X(s)=∫−∞∞x(t)e−stdt for s∈CX(s) = \int_{-\infty}^{\infty}{x(t)e^{-st}dt} \text { for } s\in\mathbb{C}X(s)=∫−∞∞​x(t)e−stdt for s∈C

Notice that the Fourier Transform is merely X(jω)X(j\omega)X(jω). Like the Fourier Transform, the Laplace Transform does not always converge. The values of sss for which the transform does converge is known as the region of convergence (ROC). If the ROC contains the imaginary axis, then the signal has a well-defined Fourier Transform.

Unlike the Fourier Transform, there is no easy way to take the Inverse Laplace Transform. However, for many LTI systems/signals, we can use partial fraction expansion and then use known Laplace Transform pairs in order to compute the inverse.

Two useful features of laplace transforms are their poles and zeros. Suppose

X(s)=N(s)D(s).X(s) = \frac{N(s)}{D(s)}.X(s)=D(s)N(s)​.

The poles of the system are {s∣D(s)=0}\{s | D(s)=0\}{s∣D(s)=0} and the zeros are {s∣N(s)=0}\{s | N(s)=0\}{s∣N(s)=0}

Properties of the Laplace Transform

The properties of the Laplace transform are largely the same as the properties of the Fourier Transform. One must just be careful about the Region of Convergence. For all these properties, assume that x(t)↔X(s)x(t) \leftrightarrow X(s)x(t)↔X(s) and y(t)↔Y(s)y(t) \leftrightarrow Y(s)y(t)↔Y(s) with original region of convergence RRR. Linearity:

ax(t)+by(t)↔aX(s)+bY(s)ax(t) + by(t) \leftrightarrow aX(s) + bY(s)ax(t)+by(t)↔aX(s)+bY(s)

Time Shift:

x(t−t0)↔e−st0X(s)x(t-t_0) \leftrightarrow e^{-s t_0}X(s)x(t−t0​)↔e−st0​X(s)

Time/Frequency Scaling:

Conjugation:

Derivative:

Convolution/Multiplication:

Frequency Shift:

The Unilateral Laplace Transform

In the normal laplace transform, we integrate over all the real numbers. For the Unilateral Laplace Transform we only integrate over the right half of the real numbers.

The because the unilateral laplace transform is basically the same as the original, the properties of it are largely the same as well. However, Convolution and Differentiation change.

This should be clear because the unilateral laplace transform only considers the right half of the reals, so unless the signal itself is right-sided, the convolution is going to blend together the left side of the signal with the right side.

Unlike the regular Laplace transform, differentiating a signal introduces initial conditions for the the Unilateral Laplace Transform. This actually makes it useful for solving differential equations because given the differential equation, we can take the Unilateral Laplace Transform of both sides, solve for our variable in the Laplace domain, and then take the inverse Laplace Transform to convert back to the time domain.

The Z Transform

Just like the Laplace Transform generalizes the CTFT, the Z-Transform generalizes the DTFT.

Properties of the Z-Transform

Linearity:

Time Shift:

Scaling:

Time Reversal:

Derivative:

Convolution/Multiplication:

Theorem 8 (Initial Value Theorem)

Unilateral Z-Transform

Like the Laplace Transform, the Z-Transform has a unilateral variant.

Like before, convolution with the Unilateral transform is only valid for right sided signals. The time-delay property also changes for the unilateral z-transform.

Notice how this property can now help us solve difference equations because we can simply take the unilateral z-transform of both sides, solve for our output, and then convert back to the time domain.

x(at)↔1∣a∣X(sa), ROC: s∈aRx(at) \leftrightarrow \frac{1}{|a|}X(\frac{s}{a})\text{, ROC: }s\in aRx(at)↔∣a∣1​X(as​), ROC: s∈aR

x∗(t)↔X∗(s∗)x^*(t) \leftrightarrow X^*(s^*)x∗(t)↔X∗(s∗)

ddtx(t)↔sX(s),ddsX(s)↔−tx(t)\frac{d}{dt}x(t) \leftrightarrow s X(s), \frac{d}{ds}X(s) \leftrightarrow -t x(t)dtd​x(t)↔sX(s),dsd​X(s)↔−tx(t)

(x∗y)(t)↔X(s)Y(s)(x*y)(t) \leftrightarrow X(s)Y(s)(x∗y)(t)↔X(s)Y(s)

es0tx(t)↔X(s−s0), ROC: s∈R+s0e^{s_0 t}x(t) \leftrightarrow X(s - s_0)\text{, ROC: }s\in R+s_0es0​tx(t)↔X(s−s0​), ROC: s∈R+s0​

X(s)=∫0−∞x(t)e−stdt\mathcal{X}(s)=\int_{0^-}^{\infty}{x(t)e^{-st}dt}X(s)=∫0−∞​x(t)e−stdt

Convolution: (x1∗x2)(t)↔X1(s)X2(s)(x_1*x_2)(t) \leftrightarrow \mathcal{X}_1(s)\mathcal{X}_2(s)(x1​∗x2​)(t)↔X1​(s)X2​(s) if x1x_1x1​ and x2x_2x2​ are right sided (i.e 0 for t<0t<0t<0)

Differentiation: dndtn↔snX(s)−∑k=1nsn−kdk−1dtk−1x(0−)\frac{d^n}{dt^n}\leftrightarrow s^n\mathcal{X}(s)-\sum_{k=1}^{n}{s^{n-k}\frac{d^{k-1}}{dt^{k-1}}x(0^-)}dtndn​↔snX(s)−∑k=1n​sn−kdtk−1dk−1​x(0−)

X(z)=∑n=−∞∞x[n]z−nX(z) = \sum_{n=-\infty}^{\infty}{x[n]z^{-n}}X(z)=∑n=−∞∞​x[n]z−n

When z=ejωz = e^{j\omega}z=ejω, we recover the DTFT

X(ejω)=∑n=−∞∞x[n]e−jωnX(e^{j\omega})=\sum_{n=-\infty}^{\infty}{x[n]e^{-j\omega n}}X(ejω)=∑n=−∞∞​x[n]e−jωn

We know that the DTFT will be well defined as long as the region of convergence of the Z-transform contains the unit circle (because that represents all points ejω)e^{j\omega})ejω). Unlike the ROC of the laplace transform, which is a rectangular section of the plane, the ROC of the Z-transform is a circular section. This means the only possible shapes for the ROC of a Z-transform are a ring, the interior of a circle, the exterior of a circle, or the empty set. For right-sided signals, the ROC is the exterior of the circle defined by the outermost pole. Like the Laplace transform, the best way to take the inverse Z transform is to use partial fraction decomposition.

ax[n]+by[n]↔aX(z)+bY(z)ax[n] + by[n] \leftrightarrow aX(z) + bY(z)ax[n]+by[n]↔aX(z)+bY(z)

x[n−n0]↔z−n0X(z)x[n-n_0] \leftrightarrow z^{-n_0}X(z)x[n−n0​]↔z−n0​X(z)

z0nx[n]↔X(zz0)z_0^nx[n] \leftrightarrow X\left(\frac{z}{z_0}\right)z0n​x[n]↔X(z0​z​)

x[−n]↔X(z−1)x[-n] \leftrightarrow X(z^{-1})x[−n]↔X(z−1)

−nx[n]↔zdX(z)dz-nx[n] \leftrightarrow z\frac{dX(z)}{dz}−nx[n]↔zdzdX(z)​

(x∗y)[n]↔X(z)Y(z)(x*y)[n] \leftrightarrow X(z)Y(z)(x∗y)[n]↔X(z)Y(z)

Given X(z)X(z)X(z) and x[n]=0x[n]=0x[n]=0 for n<0n<0n<0, then

x[0]=lim⁡z→∞X(z).x[0] = \lim_{z\rightarrow\infty}{X(z)}.x[0]=limz→∞​X(z).

X(z)=∑n=0∞x[n]z−n\mathcal{X}(z) = \sum_{n=0}^{\infty}{x[n]z^{-n}}X(z)=∑n=0∞​x[n]z−n

x[n−n0]↔z−n0X(s)+∑k=1n0−1z−n0+kx[−k]x[n-n_0] \leftrightarrow z^{-n_0}\mathcal{X}(s)+\sum_{k=1}^{n_0-1}{z^{-n_0+k}x[-k]}x[n−n0​]↔z−n0​X(s)+∑k=1n0​−1​z−n0​+kx[−k]