Skip to content

Z-Transform, Laplace Transform, and Sampling

The Z-transform and Laplace transform extend frequency-domain analysis by including a convergence factor. Their regions of convergence distinguish signals that can have the same algebraic transform, while sampling provides the bridge from continuous-time signals to discrete-time sequences.

The bilateral Z-transform of a discrete-time sequence x[n]x[n] is

X(z)=Z ⁣{x[n]}=∑n=−∞∞x[n]z−n,z=rejΩ.X(z)=\mathcal{Z}\!\left\{x[n]\right\}=\sum_{n=-\infty}^{\infty}x[n]z^{-n}, \qquad z=re^{\mathrm{j}\Omega}.

Its region of convergence (ROC) is the set of complex values of zz for which this sum converges.

The ROC is part of the transform specification, not an optional annotation. For example, the same expression 1/(1−az−1)1/(1-az^{-1}) represents a right-sided or a left-sided sequence according to whether its ROC is outside or inside the pole at z=az=a. An algebraic expression without its ROC therefore does not uniquely identify the sequence.

SequenceZ-transformRegion of convergence
δ[n]\delta[n]11Entire zz-plane
u[n]u[n]11−z−1\dfrac{1}{1-z^{-1}}∣z∣>1\lvert z\rvert>1
anu[n]a^n u[n]11−az−1\dfrac{1}{1-az^{-1}}∣z∣>∣a∣\lvert z\rvert>\lvert a\rvert
−anu[−n−1]-a^n u[-n-1]11−az−1\dfrac{1}{1-az^{-1}}∣z∣<∣a∣\lvert z\rvert<\lvert a\rvert

Common bilateral Z-transform pairs.

If x[n]↔X(z)x[n]\leftrightarrow X(z) and y[n]↔Y(z)y[n]\leftrightarrow Y(z), the principal properties are as follows.

PropertyTime-domain operationZ-domain result
Linearityαx[n]+βy[n]\alpha x[n]+\beta y[n]αX(z)+βY(z)\alpha X(z)+\beta Y(z)
Time shiftx[n−n0]x[n-n_0]z−n0X(z)z^{-n_0}X(z)
Convolutionx[n]∗y[n]x[n]*y[n]X(z)Y(z)X(z)Y(z)
Multiplication by nnnx[n]n x[n]−zdX(z)dz-z\dfrac{\mathrm{d}X(z)}{\mathrm{d}z}
Time reversalx[−n]x[-n]X(z−1)X(z^{-1})
Initial valuex[0]x[0]lim⁡z→∞X(z)\displaystyle\lim_{z\to\infty}X(z)
Final valuelim⁡n→∞x[n]\displaystyle\lim_{n\to\infty}x[n]lim⁡z→1(1−z−1)X(z)\displaystyle\lim_{z\to 1}(1-z^{-1})X(z)

Important Z-transform properties.

The ROC must be reconsidered after every operation. In particular, pole-zero cancellation can alter an apparent ROC boundary, and time reversal maps the ROC by inversion.

For x[n]=anu[n]x[n]=a^n u[n], only samples with n≥0n\geq 0 are present. Hence

X(z)=∑n=0∞anz−n=∑n=0∞(az−1)n=11−az−1=zz−a.\begin{aligned} X(z) &=\sum_{n=0}^{\infty}a^n z^{-n} =\sum_{n=0}^{\infty}(az^{-1})^n \\ &=\frac{1}{1-az^{-1}} =\frac{z}{z-a}. \end{aligned}

The geometric series converges only when

∣az−1∣<1⟺∣z∣>∣a∣.\lvert az^{-1}\rvert<1 \quad\Longleftrightarrow\quad \lvert z\rvert>\lvert a\rvert.

Therefore the complete transform pair is

For the left-sided sequence xℓ[n]=−anu[−n−1]x_\ell[n]=-a^n u[-n-1], let m=−nm=-n. Then

Xℓ(z)=−∑n=−∞−1anz−n=−∑m=1∞(za)m=−z/a1−z/a=zz−a=11−az−1,\begin{aligned} X_\ell(z) &=-\sum_{n=-\infty}^{-1}a^n z^{-n} =-\sum_{m=1}^{\infty}\left(\frac{z}{a}\right)^m \\ &=-\frac{z/a}{1-z/a} =\frac{z}{z-a} =\frac{1}{1-az^{-1}}, \end{aligned}

but convergence now requires ∣z∣<∣a∣\lvert z\rvert<\lvert a\rvert. This proves, rather than merely states, how identical algebraic forms acquire different inverse transforms through their ROCs.

The inverse is unique only after the ROC is specified. Four standard methods are useful in examinations:

  1. Inspection: match both X(z)X(z) and its ROC to a standard pair.

  2. Partial fractions: factor a rational transform, decompose it into standard terms, and use the ROC to select the sidedness of each term.

  3. Power series or long division: expand in powers of z−1z^{-1} for an exterior ROC, or in powers of zz for an interior ROC; the expansion coefficients are the samples x[n]x[n].

  4. Contour integration or residues:

x[n]=12πj∮CX(z)zn−1 dz,x[n]=\frac{1}{2\pi\mathrm{j}}\oint_C X(z)z^{n-1}\,\mathrm{d}z,

where the counter-clockwise contour CC encircles the origin and lies wholly inside the ROC. Equivalently, sum the residues of X(z)zn−1X(z)z^{n-1} inside CC.

The discrete-time Fourier transform (DTFT) gives the frequency spectrum of an aperiodic discrete-time sequence:

The DTFT is continuous in Ω\Omega and periodic with period 2π2\pi, because e−j(Ω+2π)n=e−jΩne^{-\mathrm{j}(\Omega+2\pi)n}=e^{-\mathrm{j}\Omega n} for integer nn. Since it is the Z-transform evaluated on ∣z∣=1\lvert z\rvert=1, the DTFT exists only when the Z-transform ROC contains the unit circle. Sampling the DTFT at NN uniformly spaced frequencies Ωk=2πk/N\Omega_k=2\pi k/N gives the NN-point DFT when x[n]x[n] is an NN-sample record; the DFT and FFT are covered earlier in this chapter.

For an LTI system, the unit-circle value

H(ejΩ)=H(z)∣z=ejΩH(e^{\mathrm{j}\Omega})=H(z)\big|_{z=e^{\mathrm{j}\Omega}}

is its frequency response. Provided the unit circle is in the ROC, a complex exponential is an eigenfunction:

x[n]=ejΩn⟹y[n]=H(ejΩ)ejΩn.x[n]=e^{\mathrm{j}\Omega n} \quad\Longrightarrow\quad y[n]=H(e^{\mathrm{j}\Omega})e^{\mathrm{j}\Omega n}.

Thus the Fourier transform is to continuous time what the DTFT is to discrete time: the Z-transform generalizes the DTFT in the same way that the Laplace transform generalizes the continuous-time Fourier transform.

Causality and Stability of Rational Systems

Section titled “Causality and Stability of Rational Systems”

For a rational LTI system, assume that the displayed transfer function has no hidden unstable pole-zero cancellations. The ROC and pole locations then give the following tests.

Writing the reduced system function as

H(z)=B(z)A(z)=K∏k(z−zk)∏m(z−pm),H(z)=\frac{B(z)}{A(z)} =K\frac{\prod_k(z-z_k)}{\prod_m(z-p_m)},

zkz_k are the zeros and pmp_m are the poles. Zeros suppress particular modes, while poles determine natural modes and ROC boundaries. No pole can belong to the ROC.

System propertyZ-domain condition
CausalFor a proper rational H(z)H(z), the ROC is outside the outermost pole and includes z=∞z=\infty
BIBO stableROC includes the unit circle
Causal and BIBO stableAll poles of the reduced proper H(z)H(z) lie strictly inside the unit circle

Z-domain tests for a rational LTI system.

The last row follows by combining the first two: a causal rational system has an exterior ROC, so that ROC can include ∣z∣=1\lvert z\rvert=1 only when its outermost pole has magnitude less than one. Stability alone does not imply that every pole lies inside the unit circle for an arbitrary two-sided system; the ROC criterion is the general statement.

Zeros alone do not determine BIBO stability. Moreover, cancellation of an unstable pole can make a reduced input-output transfer function look stable while an internal realization retains an unstable hidden mode. The simple pole test is therefore an input-output statement for a reduced causal rational system; internal stability additionally requires no unstable hidden cancellations.

The unit circle in the z-plane. For a causal rational system with no hidden unstable pole-zero cancellations, BIBO stability requires every pole, including each member of a complex-conjugate pair, to lie strictly inside the unit circle.

The unit circle in the zz-plane. For a causal rational system with no hidden unstable pole-zero cancellations, BIBO stability requires every pole, including each member of a complex-conjugate pair, to lie strictly inside the unit circle.

For signal analysis and ROC arguments, the bilateral Laplace transform is

X(s)=L ⁣{x(t)}=∫−∞∞x(t)e−st dt,s=σ+jω.X(s)=\mathcal{L}\!\left\{x(t)\right\}=\int_{-\infty}^{\infty}x(t)e^{-st}\,\mathrm{d}t, \qquad s=\sigma+\mathrm{j}\omega.

Its ROC is the set of values of ss for which the integral converges. The factor e−σte^{-\sigma t} permits a wider class of signals than the ordinary Fourier transform.

For causal differential equations with initial conditions, use

Xu(s)=Lu{x(t)}=∫0−∞x(t)e−st dt.X_u(s)=\mathcal{L}_u\{x(t)\} =\int_{0^-}^{\infty}x(t)e^{-st}\,\mathrm{d}t.

The lower limit 0−0^- includes any event at the origin and allows initial conditions to enter the transformed differential equation.

For a rational bilateral transform, the ROC is a vertical half-plane or strip that contains no pole. A right-sided signal has an ROC to the right of its rightmost pole, a left-sided signal has an ROC to the left of its leftmost pole, and a two-sided signal has a strip between pole locations. Thus, as in the Z-domain, the algebraic expression and ROC must be specified together.

x(t)x(t)X(s)X(s)Bilateral ROC
δ(t)\delta(t)11All ss
u(t)u(t)1s\dfrac{1}{s}Re⁡(s)>0\operatorname{Re}(s)>0
e−atu(t)e^{-at}u(t)1s+a\dfrac{1}{s+a}Re⁡(s)>−a\operatorname{Re}(s)>-a
−e−atu(−t)-e^{-at}u(-t)1s+a\dfrac{1}{s+a}Re⁡(s)<−a\operatorname{Re}(s)<-a
sin⁡(ω0t)u(t)\sin(\omega_0t)u(t)ω0s2+ω02\dfrac{\omega_0}{s^2+\omega_0^2}Re⁡(s)>0\operatorname{Re}(s)>0
cos⁡(ω0t)u(t)\cos(\omega_0t)u(t)ss2+ω02\dfrac{s}{s^2+\omega_0^2}Re⁡(s)>0\operatorname{Re}(s)>0
tnu(t)t^n u(t), n=0,1,2,…n=0,1,2,\ldotsn!sn+1\dfrac{n!}{s^{n+1}}Re⁡(s)>0\operatorname{Re}(s)>0

Common bilateral Laplace-transform pairs.

For example,

∫0∞e−ate−st dt=1s+aonly whenRe⁡(s)>−a.\int_0^\infty e^{-at}e^{-st}\,\mathrm{d}t =\frac{1}{s+a} \quad\text{only when}\quad \operatorname{Re}(s)>-a.

The left-sided exponential in the next row has the same algebraic expression but converges in the opposite half-plane. Its ROC, not the fraction alone, selects the inverse transform.

For bilateral transforms, provided the indicated integrals and boundary terms exist, the core properties are:

PropertyTime-domain operationTransform-domain result
Linearityαx(t)+βy(t)\alpha x(t)+\beta y(t)αX(s)+βY(s)\alpha X(s)+\beta Y(s)
Time shiftx(t−t0)x(t-t_0)e−st0X(s)e^{-st_0}X(s)
Exponential shifteatx(t)e^{at}x(t)X(s−a)X(s-a)
Time differentiationdx(t)dt\dfrac{\mathrm{d}x(t)}{\mathrm{d}t}sX(s)sX(s)
Multiplication by tttx(t)t x(t)−dX(s)ds-\dfrac{\mathrm{d}X(s)}{\mathrm{d}s}
Convolutionx1(t)∗x2(t)x_1(t)*x_2(t)X1(s)X2(s)X_1(s)X_2(s)

Core bilateral Laplace-transform properties.

The differentiation, integration, and value-theorem formulas below instead use the unilateral transform and retain the initial conditions.

PropertyResult
DifferentiationLu{x′(t)}=sXu(s)−x(0−)\mathcal{L}_u\{x'(t)\}=sX_u(s)-x(0^-)
Integration$\displaystyle
\mathcal{L}_u!\left{\int_0^t x(\tau),\mathrm{d}\tau\right}
=\frac{X_u(s)}{s}$
Causal convolutionx1(t)∗x2(t)↔X1(s)X2(s)x_1(t)*x_2(t)\leftrightarrow X_1(s)X_2(s)
Initial valuex(0+)=lim⁡s→∞sXu(s)\displaystyle x(0^+)=\lim_{s\to\infty}sX_u(s)
Final value$\displaystyle
\lim_{t\to\infty}x(t)=\lim_{s\to0}sX_u(s)$, when its pole condition holds

Key unilateral Laplace-transform properties.

For an mmth derivative, the complete initial-condition formula is

Lu{x(m)(t)}=smXu(s)−∑k=0m−1sm−1−kx(k)(0−).\mathcal{L}_u\{x^{(m)}(t)\} =s^mX_u(s)-\sum_{k=0}^{m-1}s^{m-1-k}x^{(k)}(0^-).

Relation to the Fourier Transform and Stability

Section titled “Relation to the Fourier Transform and Stability”

The Fourier transform is the bilateral Laplace transform evaluated on the imaginary axis:

Substitution of s=jωs=\mathrm{j}\omega is therefore not sufficient by itself; the ROC qualification is essential. For a causal rational continuous-time LTI system with no hidden unstable cancellations, BIBO stability requires every pole to lie strictly in the open left half-plane.

More explicitly, for the reduced rational function

H(s)=K∏k(s−zk)∏m(s−pm),H(s)=K\frac{\prod_k(s-z_k)}{\prod_m(s-p_m)},

the general BIBO condition is that the ROC of H(s)H(s) contain the complete jω\mathrm{j}\omega-axis. A causal rational H(s)H(s) has an ROC to the right of its rightmost pole, so causality and BIBO stability together require Re⁡(pm)<0\operatorname{Re}(p_m)<0 for every pole. A pole on the imaginary axis is excluded from strict BIBO stability. Zeros do not determine stability, and an unstable pole-zero cancellation can conceal an internally unstable mode.

The s-plane for a causal rational system. BIBO-stable poles lie strictly in the open left half-plane. The Fourier transform is obtained from the bilateral Laplace transform only when its ROC contains the complete jω-axis.

The ss-plane for a causal rational system. BIBO-stable poles lie strictly in the open left half-plane. The Fourier transform is obtained from the bilateral Laplace transform only when its ROC contains the complete jω\mathrm{j}\omega-axis.

Fourier, Laplace, and Z Transform Comparison

Section titled “Fourier, Laplace, and Z Transform Comparison”
FeatureFourier transformLaplace transformZ-transform
Signal domainContinuous timeContinuous timeDiscrete time
Variablejω\mathrm{j}\omega (imaginary axis only)s=σ+jωs=\sigma+\mathrm{j}\omega (whole plane)z=rejΩz=re^{\mathrm{j}\Omega} (whole plane)
Definition∫−∞∞x(t)e−jωt dt\displaystyle\int_{-\infty}^{\infty}x(t)e^{-\mathrm{j}\omega t}\,\mathrm{d}t∫−∞∞x(t)e−st dt\displaystyle\int_{-\infty}^{\infty}x(t)e^{-st}\,\mathrm{d}t∑n=−∞∞x[n]z−n\displaystyle\sum_{n=-\infty}^{\infty}x[n]z^{-n}
Exists forL1L^1 is sufficient for the ordinary FT; distributions extend it furtherWider class through σ\sigma and the ROCWider class through radius rr and the ROC
Initial conditionsNot handledHandled naturallyHandled by the unilateral Z-transform
Main useSpectrum, filters, and communicationTransients, circuits, control, and stabilityDigital filters, DSP, and discrete control
Stability test for causal rational systemsNot a pole-plane testPoles strictly in the open left half-planePoles strictly inside the unit circle
Special-case relationBilateral LT on s=jωs=\mathrm{j}\omegaGeneralizes the continuous-time FTDTFT is ZT on z=ejΩz=e^{\mathrm{j}\Omega}

Complete comparison of the Fourier, Laplace, and Z transforms.

The four Fourier representations are organized by whether time is continuous or discrete and whether the signal is periodic or aperiodic.

SignalRepresentationSpectrum
Continuous-time, periodicFourier series (FS)Discrete lines, aperiodic
Continuous-time, aperiodicFourier transform (FT)Continuous, aperiodic
Discrete-time, aperiodicDTFTContinuous, 2π2\pi-periodic
Discrete-time, periodic or finiteDFTDiscrete, periodic

The Fourier family of signal representations.

Laplace generalizes the FT and Z generalizes the DTFT by adding a real convergence factor, respectively σ\sigma and radius rr. This addition provides an ROC and enables transient or initial-condition analysis.

Using the sifting property,

Thus δ(t)↔1\delta(t)\leftrightarrow1: the impulse contains all frequencies with equal magnitude. Under the same angular-frequency convention, Fourier duality supplies the companion pair

1⟷2πδ(ω).1\longleftrightarrow2\pi\delta(\omega).

For

y(t)=x(t)∗h(t)=∫−∞∞x(τ)h(t−τ) dτ,y(t)=x(t)*h(t) =\int_{-\infty}^{\infty}x(\tau)h(t-\tau)\,\mathrm{d}\tau,

the properties requested in the NTC 2079 question are:

  1. Commutative: x∗h=h∗xx*h=h*x.

  2. Associative: (x∗h1)∗h2=x∗(h1∗h2)(x*h_1)*h_2=x*(h_1*h_2).

  3. Distributive: x∗(h1+h2)=x∗h1+x∗h2x*(h_1+h_2)=x*h_1+x*h_2.

  4. Identity and shift: x∗δ(t)=x(t)x*\delta(t)=x(t) and x∗δ(t−t0)=x(t−t0)x*\delta(t-t_0)=x(t-t_0).

  5. Transform relation: x∗h↔X(ω)H(ω)x*h\leftrightarrow X(\omega)H(\omega); time-domain convolution becomes frequency-domain multiplication.

  6. Width and area: for finite-duration signals, the support endpoints add, so the nominal support duration of x∗hx*h is the sum of the two support durations unless cancellation shortens it. When the required integrals exist,

∫−∞∞(x∗h)(t) dt=(∫−∞∞x(t) dt)(∫−∞∞h(t) dt).\int_{-\infty}^{\infty}(x*h)(t)\,\mathrm{d}t =\left(\int_{-\infty}^{\infty}x(t)\,\mathrm{d}t\right) \left(\int_{-\infty}^{\infty}h(t)\,\mathrm{d}t\right).

Sampling: the Continuous-to-Discrete Bridge

Section titled “Sampling: the Continuous-to-Discrete Bridge”

Sampling turns a continuous-time signal x(t)x(t) into the sequence

x[n]=x(nTs),Ts=1fs,ωs=2πfs=2πTs,x[n]=x(nT_s), \qquad T_s=\frac{1}{f_s}, \qquad \omega_s=2\pi f_s=\frac{2\pi}{T_s},

taken every sampling interval TsT_s. It is the operation that connects the continuous transforms (Fourier and Laplace) to the discrete transforms (DTFT, DFT, and Z).

Use the angular-frequency Fourier convention established earlier:

X(ω)=∫−∞∞x(t)e−jωt dt,x(t)=12π∫−∞∞X(ω)ejωt dω.X(\omega)=\int_{-\infty}^{\infty}x(t)e^{-\mathrm{j}\omega t}\,\mathrm{d}t, \qquad x(t)=\frac{1}{2\pi}\int_{-\infty}^{\infty} X(\omega)e^{\mathrm{j}\omega t}\,\mathrm{d}\omega.

For ideal impulse sampling, define the Dirac comb

pTs(t)=∑n=−∞∞δ(t−nTs).p_{T_s}(t)=\sum_{n=-\infty}^{\infty}\delta(t-nT_s).

Its Fourier transform is another impulse train:

PTs(ω)=2πTs∑k=−∞∞δ(ω−kωs)=ωs∑k=−∞∞δ(ω−kωs).P_{T_s}(\omega) =\frac{2\pi}{T_s}\sum_{k=-\infty}^{\infty} \delta(\omega-k\omega_s) =\omega_s\sum_{k=-\infty}^{\infty} \delta(\omega-k\omega_s).

Multiplication in time becomes convolution in frequency, so

xs(t)=x(t)pTs(t)=∑n=−∞∞x(nTs)δ(t−nTs),Xs(ω)=12π[X∗PTs](ω)=1Ts∑k=−∞∞X(ω−kωs).\begin{aligned} x_s(t) &=x(t)p_{T_s}(t) =\sum_{n=-\infty}^{\infty}x(nT_s)\delta(t-nT_s),\\ X_s(\omega) &=\frac{1}{2\pi}\bigl[X*P_{T_s}\bigr](\omega)\\ &=\frac{1}{T_s}\sum_{k=-\infty}^{\infty} X(\omega-k\omega_s). \end{aligned}

Since the Fourier transform of xs(t)x_s(t) can also be taken directly,

Xs(ω)=∑n=−∞∞x[n]e−j(ωTs)n=Xd(ejΩ)∣Ω=ωTs,Xd(ejΩ)=1Ts∑k=−∞∞X ⁣(Ω−2πkTs).\begin{aligned} X_s(\omega) &=\sum_{n=-\infty}^{\infty}x[n]e^{-\mathrm{j}(\omega T_s)n} =X_d(e^{\mathrm{j}\Omega})\big|_{\Omega=\omega T_s},\\ X_d(e^{\mathrm{j}\Omega}) &=\frac{1}{T_s}\sum_{k=-\infty}^{\infty} X\!\left(\frac{\Omega-2\pi k}{T_s}\right). \end{aligned}

This is the explicit bridge from the analog Fourier transform to the 2π2\pi-periodic DTFT. Analog frequencies separated by integer multiples of fsf_s map to the same discrete frequency modulo 2π2\pi.

Equality is the ideal mathematical boundary. Practical anti-alias filters need a finite transition band, so a realizable system normally samples above 2fm2f_m and leaves a guard band.

Spectrum Replication, Aliasing, and Filtering

Section titled “Spectrum Replication, Aliasing, and Filtering”

Ideal sampling places a scaled copy of X(f)X(f) at every integer multiple of fsf_s. If fs≥2fmf_s\geq2f_m, adjacent copies remain separate and the baseband copy is intact. If fs<2fmf_s<2f_m, neighboring copies overlap: components above the folding frequency map to lower apparent frequencies. This irreversible spectral corruption is aliasing.

An analog anti-aliasing low-pass filter must therefore band-limit x(t)x(t) to below fs/2f_s/2 before the sampler. Filtering after sampling cannot separate spectral components that have already folded onto one another.

For sampled complex sinusoids,

ej2π(f+kfs)nTs=ej2πfnTs,k∈Z.e^{\mathrm{j}2\pi(f+kf_s)nT_s}=e^{\mathrm{j}2\pi f nT_s}, \qquad k\in\mathbb{Z}.

A real sinusoid at finf_{\mathrm{in}} therefore appears in the principal Nyquist interval at

No digital filter can undo this identification after the samples have been formed. A realizable design uses an analog anti-alias filter, a guard band, and often oversampling.

Ideal sampling and reconstruction. An analog anti-alias filter band-limits the input before time-domain sampling. Adequate sampling keeps the spectral replicas separate; undersampling makes them overlap and alias. An ideal reconstruction low-pass filter retains the baseband replica and rejects the images.

Ideal sampling and reconstruction. An analog anti-alias filter band-limits the input before time-domain sampling. Adequate sampling keeps the spectral replicas separate; undersampling makes them overlap and alias. An ideal reconstruction low-pass filter retains the baseband replica and rejects the images.

Assume X(ω)=0X(\omega)=0 for ∣ω∣>ωm\lvert\omega\rvert>\omega_m and ωs>2ωm\omega_s>2\omega_m. An ideal reconstruction low-pass filter rejects the images and retains the baseband copy. Since ideal sampling scales that copy by 1/Ts1/T_s, the reconstruction passband must have gain TsT_s:

Hr(ω)={Ts,∣ω∣≤ωc,0,∣ω∣>ωc,ωm≤ωc≤ωs−ωm.H_r(\omega)= \begin{cases} T_s, & \lvert\omega\rvert\leq\omega_c,\\ 0, & \lvert\omega\rvert>\omega_c, \end{cases} \qquad \omega_m\leq\omega_c\leq\omega_s-\omega_m.

A common ideal choice is ωc=ωs/2\omega_c=\omega_s/2. In the time domain, this brick-wall operation is sinc interpolation:

Each sample weights a shifted sinc pulse whose zeros occur at all the other sampling instants. This exact result assumes ideal band limitation and an ideal reconstruction filter. The ideal sinc is noncausal and infinite in duration, while the ideal brick-wall filter is unrealizable. Practical systems instead use a sample-and-hold or zero-order hold followed by an analog reconstruction (anti-imaging or smoothing) filter. Oversampling provides transition width, and practical designs may compensate the hold’s sinc-shaped passband droop.

  • Fourier series represents periodic signals; the Fourier transform represents aperiodic signals.

  • Convolution in time becomes multiplication in frequency.

  • The unit impulse has the sifting property and F ⁣{δ(t)}=1\mathcal{F}\!\left\{\delta(t)\right\}=1.

  • The Hilbert transform supplies a 90∘90^\circ phase shift and forms the analytic signal; its detailed properties and SSB application are covered in Section 4.5.

  • The Z-transform is the principal tool for discrete-time LTI systems and digital filters; its ROC is essential.

  • The four Fourier representations are FS (continuous-time periodic), FT (continuous-time aperiodic), DTFT (discrete-time aperiodic with a 2π2\pi-periodic spectrum), and DFT (discrete-time finite with a discrete, periodic spectrum).

  • The sampling condition is fs≥2fmf_s\geq2f_m. Below the Nyquist rate, aliasing folds high frequencies downward; an anti-alias filter must act before sampling.

  • Parseval’s theorem preserves energy between time and frequency. Under the angular-frequency convention, Fourier duality pairs δ(t)↔1\delta(t)\leftrightarrow1 with 1↔2πδ(ω)1\leftrightarrow2\pi\delta(\omega).

  • The FT–LT–ZT comparison, the impulse transform, and the convolution properties form the exact NTC 2079 composite question and should be reproduced together.