PracticeVideosBlogFlashcards

3.3 Fourier Series, Fourier Transforms & Z-Transforms

Key Takeaways

  • Trigonometric and exponential Fourier series decompose arbitrary periodic waveforms into infinite sums of harmonically related sinusoidal components.

  • Waveform symmetries (even, odd, and half-wave symmetry) systematically eliminate specific harmonic terms, simplifying Fourier series coefficient evaluation.

  • The Continuous-Time Fourier Transform (CTFT) maps non-periodic continuous signals into the continuous frequency domain, with convolution in time mapping to multiplication in frequency.

  • The Z-transform provides the mathematical foundation for discrete-time signal processing, mapping difference equations into z-domain transfer functions (H(z)).

  • System stability for causal discrete-time systems requires all poles of (H(z)) to lie strictly inside the unit circle in the z-plane ((|z| < 1)).

Last updated: July 2026

3.3 Fourier Series, Fourier Transforms & Z-Transforms

Spectral frequency analysis allows communications and signal processing engineers to evaluate how signals distribute energy across the frequency spectrum. This section covers continuous-time periodic representations using Fourier Series, non-periodic continuous-time signals via the Continuous-Time Fourier Transform (CTFT), and discrete-time signals using the Z-Transform.


1. Fourier Series Representation of Periodic Signals

Any physically realizable periodic signal f(t)f(t) with period TT and fundamental frequency ω0=2πT\omega_0 = \frac{2\pi}{T} satisfying the Dirichlet conditions can be expanded into an infinite series of sinusoids.

1.1 Trigonometric Fourier Series Form

The Trigonometric Fourier Series expansion is defined as:

f(t)=a0+∑n=1∞(ancos⁡(nω0t)+bnsin⁡(nω0t))f(t) = a_0 + \sum_{n=1}^{\infty} \left( a_n \cos(n\omega_0 t) + b_n \sin(n\omega_0 t) \right)

Where the Fourier coefficients are evaluated via the integrals:

a0=1T∫0Tf(t)dt(DC Average Value)a_0 = \frac{1}{T} \int_{0}^{T} f(t) dt \quad (\text{DC Average Value}) an=2T∫0Tf(t)cos⁡(nω0t)dt(n=1,2,3,… )a_n = \frac{2}{T} \int_{0}^{T} f(t) \cos(n\omega_0 t) dt \quad (n = 1, 2, 3, \dots) bn=2T∫0Tf(t)sin⁡(nω0t)dt(n=1,2,3,… )b_n = \frac{2}{T} \int_{0}^{T} f(t) \sin(n\omega_0 t) dt \quad (n = 1, 2, 3, \dots)

1.2 Waveform Symmetry Simplifications

Recognizing waveform symmetry drastically simplifies coefficient computation:

Symmetry TypeMathematical ConditionHarmonic ImpactNon-Zero Coefficients
Even Symmetryf(−t)=f(t)f(-t) = f(t)Symmetric about y-axisa0≠0,an≠0,bn=0a_0 \ne 0, a_n \ne 0, b_n = 0
Odd Symmetryf(−t)=−f(t)f(-t) = -f(t)Anti-symmetric about origina0=0,an=0,bn≠0a_0 = 0, a_n = 0, b_n \ne 0
Half-Wave Symmetryf(t−T2)=−f(t)f\left(t - \frac{T}{2}\right) = -f(t)Shifted half-cycle inversionOnly odd harmonics (n=1,3,5…n=1,3,5\dots) exist
Quarter-Wave EvenEven + Half-WaveCombinationbn=0b_n = 0, an≠0a_n \ne 0 for odd nn only
Quarter-Wave OddOdd + Half-WaveCombinationa0=an=0a_0=a_n=0, bn≠0b_n \ne 0 for odd nn only

1.3 Exponential Fourier Series Form

Using Euler's identity, the Exponential Fourier Series offers a compact representation:

f(t)=∑n=−∞∞cnejnω0tf(t) = \sum_{n=-\infty}^{\infty} c_n e^{j n \omega_0 t}

Where complex coefficients cnc_n are given by:

cn=1T∫0Tf(t)e−jnω0tdtc_n = \frac{1}{T} \int_{0}^{T} f(t) e^{-j n \omega_0 t} dt

Relationship to trigonometric coefficients: c0=a0c_0 = a_0, and for n>0n > 0, cn=an−jbn2c_n = \frac{a_n - j b_n}{2}.


2. Continuous-Time Fourier Transform (CTFT)

For non-periodic continuous signals (T→∞T \to \infty), the discrete line spectrum becomes a continuous spectrum governed by the Continuous-Time Fourier Transform (CTFT) pair:

Forward CTFT: F(ω)=F{f(t)}=∫−∞∞f(t)e−jωtdt\text{Forward CTFT: } F(\omega) = \mathcal{F}\{f(t)\} = \int_{-\infty}^{\infty} f(t) e^{-j\omega t} dt Inverse CTFT: f(t)=F−1{F(ω)}=12π∫−∞∞F(ω)ejωtdω\text{Inverse CTFT: } f(t) = \mathcal{F}^{-1}\{F(\omega)\} = \frac{1}{2\pi} \int_{-\infty}^{\infty} F(\omega) e^{j\omega t} d\omega

2.1 Essential Properties of the Fourier Transform

  • Linearity: F{af1(t)+bf2(t)}=aF1(ω)+bF2(ω)\mathcal{F}\{a f_1(t) + b f_2(t)\} = a F_1(\omega) + b F_2(\omega)
  • Time Scaling: F{f(at)}=1∣a∣F(ωa)\mathcal{F}\{f(at)\} = \frac{1}{|a|} F\left(\frac{\omega}{a}\right)
  • Frequency Shifting: F{f(t)ejω0t}=F(ω−ω0)\mathcal{F}\{f(t) e^{j\omega_0 t}\} = F(\omega - \omega_0)
  • Duality: If F{f(t)}=F(ω)\mathcal{F}\{f(t)\} = F(\omega), then F{F(t)}=2πf(−ω)\mathcal{F}\{F(t)\} = 2\pi f(-\omega)
  • Time Convolution Theorem: F{f(t)∗g(t)}=F(ω)⋅G(ω)\mathcal{F}\{f(t) * g(t)\} = F(\omega) \cdot G(\omega)
  • Frequency Convolution Theorem: F{f(t)⋅g(t)}=12π[F(ω)∗G(ω)]\mathcal{F}\{f(t) \cdot g(t)\} = \frac{1}{2\pi} [F(\omega) * G(\omega)]
  • Parseval's Theorem: Energy equivalence between domains: E=∫−∞∞∣f(t)∣2dt=12π∫−∞∞∣F(ω)∣2dωE = \int_{-\infty}^{\infty} |f(t)|^2 dt = \frac{1}{2\pi} \int_{-\infty}^{\infty} |F(\omega)|^2 d\omega

3. Z-Transform & Discrete-Time Analysis

The Z-Transform is the discrete-time counterpart of the Laplace transform, fundamental to Digital Signal Processing (DSP) and sampled-data control systems.

3.1 Unilateral and Bilateral Z-Transforms

For a discrete sequence x[n]x[n], the bilateral Z-transform is defined as:

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

Where z=rejΩz = r e^{j\Omega} is a complex variable in the zz-plane.

3.2 Region of Convergence (ROC)

The Region of Convergence (ROC) specifies the set of zz values for which the summation converges absolutely (∑∣x[n]z−n∣<∞\sum |x[n] z^{-n}| < \infty).

                    ROC Characterization in the Z-Plane
                    
      Causal Sequence          Anti-Causal Sequence        Stable LTI System
     +---------------+          +---------------+          +---------------+
     |  |z| > |r_max| |          |  |z| < |r_min| |          | Includes Unit |
     | Exterior of   |          | Interior of   |          | Circle (|z|=1)|
     |  Outer Pole   |          |  Inner Pole   |          |   in the ROC  |
     +---------------+          +---------------+          +---------------+

3.3 Essential Z-Transform Pairs

Sequence DescriptionDiscrete-Time x[n]x[n]Z-Domain X(z)X(z)Region of Convergence (ROC)
Discrete Impulseδ[n]\delta[n]11Entire zz-plane
Causal Stepu[n]u[n]11−z−1=zz−1\frac{1}{1 - z^{-1}} = \frac{z}{z - 1}∣z∣>1\vert z\vert> 1
Causal Exponentialanu[n]a^n u[n]11−az−1=zz−a\frac{1}{1 - a z^{-1}} = \frac{z}{z - a}∣z∣>∣a∣\vert z\vert> \vert a\vert
Anti-Causal Exponential−anu[−n−1]-a^n u[-n-1]zz−a\frac{z}{z - a}∣z∣<∣a∣\vert z\vert< \vert a\vert
Ramp Weightednanu[n]n a^n u[n]az−1(1−az−1)2=az(z−a)2\frac{a z^{-1}}{(1 - a z^{-1})^2} = \frac{a z}{(z - a)^2}∣z∣>∣a∣\vert z\vert> \vert a\vert

4. Difference Equations & Discrete System Stability

Linear constant-coefficient difference equations (LCCDE) model discrete-time systems:

∑k=0Naky[n−k]=∑m=0Mbmx[n−m]\sum_{k=0}^{N} a_k y[n-k] = \sum_{m=0}^{M} b_m x[n-m]

Taking the Z-transform yields the system transfer function H(z)H(z):

H(z)=Y(z)X(z)=∑m=0Mbmz−m∑k=0Nakz−kH(z) = \frac{Y(z)}{X(z)} = \frac{\sum_{m=0}^{M} b_m z^{-m}}{\sum_{k=0}^{N} a_k z^{-k}}

BIBO Stability Criterion: A causal discrete-time LTI system is Bounded-Input Bounded-Output (BIBO) stable if and only if all poles of H(z)H(z) lie strictly inside the unit circle in the zz-plane (∣pi∣<1|p_i| < 1).


5. PRC ECE Board Exam Worked Examples

Worked Example 1: Z-Transform & ROC Determination

Problem: Find the Z-transform X(z)X(z) and ROC for x[n]=3(0.5)nu[n]−2(0.8)nu[n]x[n] = 3(0.5)^n u[n] - 2(0.8)^n u[n].

Solution:

  1. Apply linearity and standard transform pairs: X(z)=3⋅zz−0.5−2⋅zz−0.8X(z) = 3 \cdot \frac{z}{z - 0.5} - 2 \cdot \frac{z}{z - 0.8}
  2. Determine individual ROCs:
    • For 3(0.5)nu[n]  ⟹  ∣z∣>0.53(0.5)^n u[n] \implies |z| > 0.5
    • For 2(0.8)nu[n]  ⟹  ∣z∣>0.82(0.8)^n u[n] \implies |z| > 0.8
  3. Find the combined ROC (intersection): ROC={z:∣z∣>0.5}∩{z:∣z∣>0.8}  ⟹  ∣z∣>0.8\text{ROC} = \{z: |z| > 0.5\} \cap \{z: |z| > 0.8\} \implies |z| > 0.8
  4. Simplify X(z)X(z) into a single fraction: X(z)=3z(z−0.8)−2z(z−0.5)(z−0.5)(z−0.8)=3z2−2.4z−2z2+z(z−0.5)(z−0.8)=z2−1.4z(z−0.5)(z−0.8)X(z) = \frac{3z(z - 0.8) - 2z(z - 0.5)}{(z - 0.5)(z - 0.8)} = \frac{3z^2 - 2.4z - 2z^2 + z}{(z - 0.5)(z - 0.8)} = \frac{z^2 - 1.4z}{(z - 0.5)(z - 0.8)}

Worked Example 2: Discrete System Stability Evaluation

Problem: A discrete filter has H(z)=zz2−0.6z+0.25H(z) = \frac{z}{z^2 - 0.6z + 0.25}. Determine if the system is stable.

Solution:

  1. Find system poles by setting denominator to zero: z2−0.6z+0.25=0z^2 - 0.6z + 0.25 = 0.
  2. Use quadratic formula: z=0.6±(−0.6)2−4(1)(0.25)2=0.6±0.36−1.02=0.3±j0.4z = \frac{0.6 \pm \sqrt{(-0.6)^2 - 4(1)(0.25)}}{2} = \frac{0.6 \pm \sqrt{0.36 - 1.0}}{2} = 0.3 \pm j 0.4
  3. Calculate the magnitude of the complex poles ∣zp∣|z_p|: ∣zp∣=(0.3)2+(0.4)2=0.09+0.16=0.25=0.5|z_p| = \sqrt{(0.3)^2 + (0.4)^2} = \sqrt{0.09 + 0.16} = \sqrt{0.25} = 0.5
  4. Check stability: Since ∣zp∣=0.5<1.0|z_p| = 0.5 < 1.0, all poles lie strictly inside the unit circle. The filter is BIBO stable.
Test Your Knowledge

A periodic voltage waveform v(t) exhibits odd symmetry v(-t) = -v(t) and half-wave symmetry v(t - T/2) = -v(t). Which Fourier series harmonic coefficients are non-zero?

A

All even cosine terms only

B

Both even and odd cosine terms

C

All even sine terms only

D

All odd sine terms only

Test Your Knowledge

What is the Z-transform and Region of Convergence (ROC) for the causal sequence x[n] = (0.6)ⁿ u[n]?

A

z / (z - 0.6) with ROC |z| > 0.6

B

1 / (z - 0.6) with ROC |z| < 0.6

C

z / (z + 0.6) with ROC |z| > 0.6

D

z / (z - 0.6) with ROC |z| < 0.6

Test Your Knowledge

A discrete-time LTI system has transfer function H(z) = z² / (z² - 1.2z + 0.8). Is this causal system BIBO stable?

A

Yes, because all poles lie strictly inside the unit circle (|z| < 1)

B

No, because the poles lie outside the unit circle (|z| > 1)

C

No, because there is a pole at z = 0

D

Cannot be determined without knowing the input signal

Sections you finish are checked off in the contents.