Digital Communications

Compress-and-Forward

/kuhm-PRES and FOR-werd/
A cooperative relaying strategy for the three-node relay channel in which the relay never decodes the source message. Instead it quantizes its noisy received observation, compresses the quantization using Wyner-Ziv coding against the destination's correlated direct-link signal, and forwards only the compression bin index. The destination then combines the recovered relay description with its own observation to decode. Because it sidesteps the decoding bottleneck of decode-and-forward, compress-and-forward (CF) excels when the relay sits near the destination, approaching the cut-set bound within a constant gap of 0.5 bit per dimension in the Gaussian relay channel.
Category: Digital Communications
Relay role: Quantize, no decoding
Gaussian gap: ≤ 0.5 bit/dim

How the Relay Compresses Instead of Decoding

Compress-and-forward emerged from Cover and El Gamal's 1979 framework for the relay channel, where it was originally called the "Theorem 6" or estimate-and-forward strategy. Unlike amplify-and-forward, which simply scales and retransmits the analog received signal (and with it the relay's own noise), CF performs a digital quantization of the relay observation YR into a reproduction ŶR. The relay does not attempt to recover the transmitted bits at all. This is the defining contrast with decode-and-forward, whose achievable rate is hard-limited by the source-to-relay link capacity.

The clever part is exploiting the destination's prior knowledge. The destination already receives a degraded, correlated copy of the source signal over the direct link. CF treats that direct-link observation as decoder side information and applies Wyner-Ziv lossy source coding: the relay bins its quantization codewords (Slepian-Wolf style) and transmits only the bin index, at a rate reduced by the mutual information the destination can supply on its own. The destination first decodes the bin index, uses its side information to pick the correct codeword within the bin, then performs joint maximum-likelihood decoding of the original message using both signal paths.

The performance hinges on a budget equation: the Wyner-Ziv description rate must fit within the relay-to-destination link capacity CRD. Choosing the quantization noise variance Nq too small produces a description too rich to transmit; too large, and excessive quantization noise corrupts the combined estimate. The optimum sets Nq so the compression rate exactly saturates CRD, which is why CF rewards a strong relay-to-destination channel.

Achievable Rate and the Wyner-Ziv Constraint

CF achievable rate (Gaussian relay channel):
RCF = I(X; YD, ŶR | XR)

Wyner-Ziv compression constraint:
I(YR; ŶR | XR, YD) ≤ I(XR; YD | X) ≡ CRD

Optimal Gaussian quantization noise:
Nq = NR × (1 + SNRSR + SNRSD) / (2CRD − 1)

Where YR = relay observation, ŶR = quantized reproduction, YD = destination direct-link signal, X / XR = source / relay transmit symbols, NR = relay noise power, SNRSR and SNRSD = source-to-relay and source-to-destination SNRs. The CF rate stays within 0.5 bit of the cut-set bound for all channel gains.

Relaying Strategy Comparison

StrategyRelay processingLimited by S→R link?Best relay positionNoise behaviorComplexity
Compress-and-ForwardQuantize + Wyner-Ziv compressNoNear destinationAdds quantization noise NqHigh (binning + joint decode)
Decode-and-ForwardFull decode + re-encodeYes (rate ≤ CSR)Near sourceNoise-free re-transmissionMedium
Amplify-and-ForwardScale analog signalNoMidpointAmplifies relay noiseLow
Quantize-and-ForwardQuantize, no side-info binningNoNear destinationHigher Nq than CFMedium
Common Questions

Frequently Asked Questions

When does compress-and-forward outperform decode-and-forward?

CF wins when the relay sits closer to the destination than to the source. Decode-and-forward must fully decode the source message, so its rate is capped by the source-to-relay capacity CSR; a weak first hop throttles the entire route. CF never decodes and so escapes that limit, instead forwarding a compressed description that the destination resolves using its direct-link signal as side information. With a strong relay-to-destination link, CF approaches the cut-set bound within 0.5 bit. When the relay is near the source and can decode reliably, DF is preferable.

Why does compress-and-forward use Wyner-Ziv coding instead of plain quantization?

The destination already holds a correlated noisy copy of the source from the direct link. Wyner-Ziv lossy coding with decoder side information lets the relay compress at a lower rate than ordinary quantization, conveying only what the destination lacks. The relay bins quantization codewords (Slepian-Wolf style) and sends just the bin index; the destination uses its direct-link observation to pick the correct codeword inside the bin. This binning gain reduces the required relay-to-destination rate by I(YR; YD), directly raising end-to-end rate.

How does the relay quantization distortion affect achievable rate in compress-and-forward?

It is a budget trade-off against CRD. Fine quantization (small Nq) preserves the observation but needs a description rate that may exceed the relay-to-destination link. Coarse quantization fits the budget but injects more quantization noise into the combined estimate. The optimum sets Nq so the Wyner-Ziv compression rate exactly equals CRD; in Gaussian channels Nq scales with the relay noise and the source-link SNRs, which is why a high-capacity relay-to-destination channel lets the relay quantize finely and deliver near-optimal rate.

Cooperative Links

Build the RF Front End for Your Relay

Whether your cooperative network needs low-noise relay receivers or millimeter-wave backhaul converters, our engineering team supplies the hardware behind compress-and-forward links. Let us spec the front end for your topology.

Get in Touch