Matched Filtering and Pulse Compression

Why the Matched Filter is the Starting Point

The matched filter is the optimal linear filter for detecting a known signal in additive white Gaussian noise. In the imaging context, it is the adjoint operator AH\mathbf{A}^{H} β€” the simplest and fastest way to form an image. Every more sophisticated reconstruction method (LASSO, ADMM, deep unfolding) starts from or improves upon the matched-filter image.

We derive the matched filter from first principles, show its connection to pulse compression, and quantify its limitations through sidelobe analysis.

Theorem: Optimality of the Matched Filter

Consider the detection problem: observation r(t)=Ξ±s(tβˆ’Ο„0)+w(t)r(t) = \alpha s(t - \tau_0) + w(t), where s(t)s(t) is a known waveform, Ξ±\alpha is the target complex amplitude, Ο„0\tau_0 is the delay, and w(t)w(t) is white Gaussian noise with spectral density N0/2N_0/2.

The linear filter h(t)h(t) that maximizes the output SNR\text{SNR} at time Ο„0\tau_0 is:

hMF(t)=sβˆ—(Ο„0βˆ’t),h_{\text{MF}}(t) = s^*(\tau_0 - t),

and the maximum output SNR\text{SNR} is:

SNRout=2EsN0,\text{SNR}_{\text{out}} = \frac{2E_s}{N_0},

where Es=∣α∣2∫∣s(t)∣2 dtE_s = |\alpha|^2 \int |s(t)|^2\,dt is the received signal energy. The output SNR\text{SNR} depends only on signal energy, not on waveform shape.

The matched filter correlates the received signal with a time-reversed copy of the transmitted waveform. It accumulates energy coherently at the delay corresponding to the target, while noise β€” being uncorrelated with s(t)s(t) β€” averages out.

Definition:

Pulse Compression

Pulse compression is the process of transmitting a long, bandwidth-modulated waveform and applying the matched filter to achieve range resolution determined by bandwidth rather than pulse duration.

For an LFM chirp with bandwidth WW and duration TT:

  • Uncompressed pulse: range extent cT/2cT/2 (poor resolution).
  • After matched filtering: range resolution Ξ”R=c/(2W)\Delta R = c/(2W) (fine resolution).
  • Compression ratio: WTW T (the processing gain in linear units, 10log⁑10(WT)10\log_{10}(W T) in dB).

The matched filter output is approximately:

y(Ο„)β‰ˆWTβ‹…sinc(W(Ο„βˆ’Ο„0))β‹…ej2Ο€f0Ο„0,y(\tau) \approx W T \cdot \text{sinc}(W(\tau - \tau_0)) \cdot e^{j2\pi f_0 \tau_0},

a sinc function with mainlobe width 1/W1/W and peak amplitude WTW T times the input.

Example: Pulse Compression Gain for a Weather Radar

A weather radar transmits an LFM chirp with W=5W = 5 MHz and T=100T = 100 ΞΌ\mus. The peak transmit power is 250 W. Compute (a) the pulse compression ratio, (b) the effective transmit energy, and (c) the range resolution.

Definition:

Range Sidelobes and Windowing

The matched filter output for a single point target has a sinc-like shape with sidelobes at βˆ’13.3-13.3 dB relative to the peak. These range sidelobes mask weak targets near strong ones.

Windowing (or weighting) applies a taper w(f)w(f) to the frequency-domain matched filter:

Hw(f)=w(f)β‹…Sβˆ—(f),H_w(f) = w(f) \cdot S^*(f),

reducing sidelobes at the cost of mainlobe broadening:

Window Peak sidelobe Mainlobe width Mismatch loss
Rectangular βˆ’13.3-13.3 dB 1/W1/W 0 dB
Hamming βˆ’42.7-42.7 dB 1.5/W1.5/W 1.34 dB
Blackman βˆ’58-58 dB 1.7/W1.7/W 1.73 dB
Taylor (nΛ‰=5\bar{n}=5, SLL βˆ’35-35) βˆ’35-35 dB 1.3/W1.3/W 0.85 dB

Matched Filter Output and Sidelobe Control

Observe the matched filter output for an LFM chirp with two point targets. Adjust the bandwidth to see how range resolution changes, and apply different windows to suppress range sidelobes.

Parameters
50
20

Definition:

Stretch Processing (Dechirp-on-Receive)

For wideband LFM waveforms (large WW), direct digitization requires very high ADC sampling rates. Stretch processing avoids this by mixing the received signal with a reference chirp:

rbeat(t)=r(t)β‹…sβˆ—(tβˆ’Ο„ref),r_{\text{beat}}(t) = r(t) \cdot s^*(t - \tau_{\text{ref}}),

where Ο„ref\tau_{\text{ref}} is the reference delay (center of the range swath). Each target at delay Ο„0\tau_0 produces a sinusoidal beat signal at frequency:

fb=ΞΌ(Ο„0βˆ’Ο„ref),f_b = \mu(\tau_0 - \tau_{\text{ref}}),

where ΞΌ=W/T\mu = W/T is the chirp rate. An FFT of rbeat(t)r_{\text{beat}}(t) maps beat frequencies to ranges.

The required ADC bandwidth drops from WW to ΞΌβ‹…2Ξ”Rswath/c\mu \cdot 2\Delta R_{\text{swath}}/c, which is typically orders of magnitude smaller.

πŸ”§Engineering Note

Mismatch Loss and the Sidelobe-Resolution Trade-Off

Applying a window to the matched filter creates a mismatched filter β€” it is no longer the SNR-optimal processor. The mismatch loss quantifies this penalty:

Lmm=∣∫w(f)∣S(f)∣2 df∣2∫∣S(f)∣2 dfβ‹…βˆ«βˆ£w(f)∣2∣S(f)∣2 df.L_{\text{mm}} = \frac{|\int w(f)|S(f)|^2\,df|^2}{\int |S(f)|^2\,df \cdot \int |w(f)|^2|S(f)|^2\,df}.

For typical windows, Lmm=1L_{\text{mm}} = 1-22 dB. This is usually an acceptable trade-off: losing 1 dB of SNR to gain 20+ dB of sidelobe suppression is worthwhile in most imaging scenarios, where dynamic range matters more than marginal SNR.

Common Mistake: Matched Filter in Colored Noise

Mistake:

Applying the standard matched filter h(t)=sβˆ—(βˆ’t)h(t) = s^*(-t) when the noise is not white (e.g., in the presence of clutter or interference).

Correction:

The matched filter is optimal only for white Gaussian noise. In colored noise with spectral density Pn(f)P_n(f), the optimal filter is the whitening-matched filter:

Hopt(f)=Sβˆ—(f)Pn(f).H_{\text{opt}}(f) = \frac{S^*(f)}{P_n(f)}.

This pre-whitens the noise and then applies the matched filter. In STAP (Section 9.6), this generalizes to the matrix form w=Rcnβˆ’1v\mathbf{w} = \mathbf{R}_{cn}^{-1}\mathbf{v}.

Pulse Compression

The technique of using a long, bandwidth-modulated waveform and matched filtering to achieve range resolution c/(2W)c/(2W) independent of pulse duration, with processing gain WTW T.

Key Takeaway

The matched filter h(t)=sβˆ—(βˆ’t)h(t) = s^*(-t) maximizes SNR\text{SNR} in AWGN and achieves range resolution Ξ”R=c/(2W)\Delta R = c/(2W) via pulse compression. Windowing trades 1-2 dB of SNR for 20+ dB sidelobe suppression. The matched filter output is the starting point for all imaging algorithms β€” it is the adjoint AHy\mathbf{A}^{H}\mathbf{y}.