Chapter Summary

Chapter 16 Summary

Key Points

  • 1.

    A WSS process is mean-square continuous if and only if its autocorrelation rxx(τ)r_{xx}(\tau) is continuous at τ=0\tau = 0, equivalently if the process has finite average power.

  • 2.

    The m.s. derivative X(t)X'(t) exists if and only if (2πf)2Px(f)df<\int (2\pi f)^2 P_x(f)\, df < \infty; the PSD of the derivative is (2πf)2Px(f)(2\pi f)^2 P_x(f), showing that differentiation amplifies high frequencies.

  • 3.

    Higher-order m.s. derivatives require faster PSD decay: the nn-th derivative exists iff (2πf)2nPx(f)df<\int (2\pi f)^{2n} P_x(f)\, df < \infty. Bandlimited processes are infinitely differentiable.

  • 4.

    The m.s. integral abX(t)dt\int_a^b X(t)\,dt exists whenever X(t)X(t) is m.s.-continuous — integration is a smoothing operation that does not require differentiability.

  • 5.

    A bandlimited WSS process (PSD vanishing for f>W|f| > W) can be perfectly reconstructed from Nyquist-rate samples X(nTs)X(nT_s) with Ts=1/(2W)T_s = 1/(2W) via sinc interpolation, in the mean-square sense.

  • 6.

    The sampling theorem for random processes justifies the discrete-time models used throughout digital communications, including the OFDM transceiver chain.

  • 7.

    The Karhunen-Loève expansion X(t)=nZnϕn(t)X(t) = \sum_n Z_n \phi_n(t) diagonalizes the autocorrelation operator, with eigenfunctions ϕn\phi_n and uncorrelated coefficients ZnZ_n of variance λn\lambda_n.

  • 8.

    The KL expansion minimizes the NN-term mean-square truncation error among all orthonormal expansions — it is the continuous-time analogue of PCA.

Looking Ahead

With the mean-square calculus and KL expansion in hand, we are prepared for Part V: Markov chains and Poisson processes. Chapter 17 develops discrete-time Markov chains, where the Chapman-Kolmogorov equation replaces the autocorrelation as the fundamental descriptor of temporal dependence. The KL expansion will reappear in the MIMO chapters (Book MIMO) as the eigendecomposition of spatial channel covariance, and in detection theory (Book FSI) as the tool for converting continuous-time hypothesis tests into equivalent discrete problems.