Prerequisites & Notation

Before You Begin

This chapter treats equalization as an inference problem. Readers should be comfortable with the material below; if any item feels unsteady, revisit the linked chapter before proceeding.

  • Maximum-likelihood estimation and detection under Gaussian noise(Review ch02)

    Self-check: Can you derive the log-likelihood of a Gaussian observation and reduce ML detection to a quadratic form?

  • Wiener filtering and the orthogonality principle(Review ch09)

    Self-check: Can you state the Wiener–Hopf equations and solve them in the frequency domain?

  • Discrete-time linear systems: convolution, zz-transform, DTFT

    Self-check: Can you compute H(ejω)H(e^{j\omega}) given a causal FIR with taps {h[0],h[1],h[2]}\{h[0], h[1], h[2]\}?

  • Jointly Gaussian random vectors and conditional expectation(Review ch03)

    Self-check: Can you write E[xy]\mathbb{E}[\mathbf{x}|\mathbf{y}] in closed form when (x,y)(\mathbf{x}, \mathbf{y}) are jointly Gaussian?

  • Dynamic programming on a graph / shortest-path thinking

    Self-check: Do you recognize Bellman's principle of optimality as the engine behind Viterbi?

Notation for This Chapter

Symbols introduced or used heavily in this chapter. The channel impulse response is denoted {h[k]}k=0L\{h[k]\}_{k=0}^{L} and the channel memory is LL (one fewer than the number of taps). We write M=AM = |\mathcal{A}| for the size of the modulation alphabet.

SymbolMeaningIntroduced
h[k]h[k], LLDiscrete-time channel impulse response taps and channel memory (so L+1L+1 taps total)s01
h\mathbf{h}Column vector [h[0],h[1],,h[L]]T[h[0], h[1], \ldots, h[L]]^T of channel tapss01
H(f)H(f) or H(ejω)H(e^{j\omega})DTFT of the channel impulse responses01
x[n]x[n], y[n]y[n], w[n]w[n]Transmitted symbols, received samples, and AWGN sampless01
A\mathcal{A}, MMModulation alphabet and its size M=AM = |\mathcal{A}|s01
x^ML\hat{\mathbf{x}}_{\text{ML}}Maximum-likelihood sequence estimates01
skSs_k \in \mathcal{S}Trellis state at time kk; S=ML|\mathcal{S}| = M^Ls02
λk(s)\lambda_k(s)Viterbi path metric: minimum cumulative squared error reaching state ss at time kks02
WZF(f)W_{\text{ZF}}(f), WMMSE(f)W_{\text{MMSE}}(f)Frequency responses of the ZF and MMSE linear equalizerss03
N0N_0, SNR\text{SNR}Noise power spectral density and input signal-to-noise ratios03
wff\mathbf{w}_{\text{ff}}, wfb\mathbf{w}_{\text{fb}}Feedforward and feedback filter taps of the DFEs04
Δ\DeltaDecision delay of the equalizer (in symbols)s04