Chapter Summary

Chapter Summary

Key Points

  • 1.

    ARQ is the third axis of the MIMO tradeoff surface. Zheng-Tse (Ch. 12) gave us a two-dimensional diversity-multiplexing tradeoff dβˆ—(r)d^{*}(r) for a single block. El Gamal-Caire-Damen (2006) added the delay dimension LL β€” the number of allowed ARQ rounds β€” and produced the three-dimensional ARQ-DMT dARQ(r,L)d_\mathrm{ARQ}(r, L). Every real wireless system (LTE, 5G NR, Wi-Fi, DVB-S2X) retransmits; ARQ is not an afterthought but a fundamental resource reshaping the tradeoff curve.

  • 2.

    The ARQ-DMT has a beautiful product structure. On an ntΓ—nrn_t \times n_r i.i.d. Rayleigh block-fading channel with per-round block length Nβ‰₯nt+nrβˆ’1N \ge n_t + n_r - 1 and at most LL ARQ rounds, the optimal diversity-multiplexing-delay tradeoff is (Thm. TARQ-DMT (El Gamal-Caire-Damen 2006)) dARQ(r,L)β€…β€Š=β€…β€ŠLβ‹…dβˆ—(r/L),d_\mathrm{ARQ}(r, L) \;=\; L \cdot d^{*}(r/L), where dβˆ—(β‹…)d^{*}(\cdot) is the static Zheng-Tse DMT. Each additional round multiplies the diversity exponent by the factor dβˆ—(r/L)/dβˆ—(r/(Lβˆ’1))β‰₯1d^{*}(r/L) / d^{*}(r/(L-1)) \ge 1; the gain compounds across rounds.

  • 3.

    Incremental redundancy strictly beats Chase combining. CC-HARQ retransmits the same codeword and achieves at most Lβ‹…dβˆ—(r)L \cdot d^{*}(r) diversity (Thm. Lβ‹…dβˆ—(r)L \cdot d^{*}(r) Diversity" data-ref-type="theorem">TChase Combining Achieves at Most Lβ‹…dβˆ—(r)L \cdot d^{*}(r) Diversity) β€” inferior to IR-HARQ's Lβ‹…dβˆ—(r/L)L \cdot d^{*}(r/L) whenever dβˆ—d^{*} is strictly decreasing, i.e., for all r>0r > 0. IR earns more diversity by lowering the per-round rate to r/Lr/L where the static DMT is steeper, while still collecting LL independent fading realisations.

  • 4.

    IR-LAST codes achieve the ARQ-DMT explicitly. The 2006 El Gamal-Caire-Damen paper constructs nested lattice codes over a CDA-structured alphabet with common random dithering β€” the IR-LAST family β€” and proves they attain dARQ(r,L)d_\mathrm{ARQ}(r, L) at every (r,L)(r, L) with MMSE-GDFE lattice decoding (Thm. TIR-LAST Codes Achieve the ARQ-DMT). This was the first explicit ARQ-DMT-optimal code family; it remains the canonical information-theoretic reference construction.

  • 5.

    LDPC-based IR-HARQ asymptotically achieves the ARQ-DMT. Real systems use LDPC mother codes + circular-buffer rate matching + redundancy versions (RVs) instead of IR-LAST. Under BICM signalling with Gray labelling, the LDPC-IR scheme achieves the ARQ-DMT in the long-block-length limit (Thm. TLDPC-IR Asymptotically Achieves the ARQ-DMT). The gap from IR-LAST is a matter of coding gain at moderate SNR, not of asymptotic exponent.

  • 6.

    The round budget LL is latency-bound, not DMT-bound. The ARQ-DMT grows unboundedly in LL, but the feasible LL is set by the end-to-end latency budget: Lβ‹…Trtt≀TbudgetL \cdot T_\mathrm{rtt} \le T_\mathrm{budget}. For 5G NR eMBB with Trtt∼4T_\mathrm{rtt} \sim 4 ms, L≀4L \le 4 is typical; for URLLC with Tbudget=1T_\mathrm{budget} = 1 ms, L≀1L \le 1–22 or no HARQ at all. The system design picks the smallest LL meeting a target reliability β€” not the largest.

  • 7.

    Independence of retransmissions is a real assumption. The ARQ-DMT formula presumes H1,…,HL\mathbf{H}_{1}, \ldots, \mathbf{H}_{L} are independent β€” which requires the HARQ round-trip time TrttT_\mathrm{rtt} to exceed the channel coherence time TcohT_\mathrm{coh}. At pedestrian speeds with legacy numerology, consecutive HARQ rounds are strongly correlated and the effective diversity gain is Leffβ‹…dβˆ—(r/Leff)L_\mathrm{eff} \cdot d^{*}(r / L_\mathrm{eff}) with Leffβ‰ͺLL_\mathrm{eff} \ll L. 5G NR addresses this via per-round frequency hopping, which decorrelates rounds even at low mobility.

  • 8.

    5G NR HARQ is a direct realisation of the ARQ-DMT. NR supports 16 parallel HARQ processes per UE per direction, each running stop-and-wait with up to 4 redundancy versions drawn from a circular buffer of the LDPC mother code. Per-round MCS adaptation + RV selection + frequency hopping together implement the IR-HARQ design that the ARQ-DMT theorem analyses. The empirical BLER-vs-SNR slope of NR HARQ closely tracks the ARQ-DMT prediction in the 20–30 dB regime typical of cellular operation.

  • 9.

    The Lβ†’βˆžL \to \infty limit is ergodic capacity. As Lβ†’βˆžL \to \infty with fixed long-term rate rr, the ARQ-DMT diverges: dARQ(r,L)β†’βˆžd_\mathrm{ARQ}(r, L) \to \infty. Operationally this means the channel averages to its ergodic capacity via the infinite-repetition law of large numbers β€” so ARQ interpolates smoothly between the single-shot block-fading regime (L = 1, static DMT) and the ergodic-capacity regime (Lβ†’βˆžL \to \infty, Telatar). The ARQ-DMT is a genuine unification of these two canonical channel models.

Looking Ahead

The central construction of this chapter β€” IR-LAST codes β€” will be revisited in Chapter 17 from the lattice-coding perspective. There we will see LAST codes for the static DMT (El Gamal-Caire-Damen 2004) together with the MMSE-GDFE lattice-decoder machinery in full generality; the IR-LAST family of this chapter is a specific instantiation of that machinery with an ARQ twist.

Chapter 21 will compose the HARQ mechanism of this chapter with BICM-OFDM-STBC to describe the complete physical layer of 5G NR. The ARQ-DMT sets the information-theoretic ceiling; Chapter 21 examines how close the standardised design comes to the ceiling and where the remaining gaps live.

Chapter 22 extends the ARQ-DMT story to URLLC, where the round budget collapses to L=1L = 1 or 22 and the design must extract reliability in a single shot. The URLLC design philosophy β€” aggressive diversity via large antenna arrays, low-rate coding, and frequency-domain replicas β€” is a direct consequence of the (r,d,L)(r, d, L) tradeoff: minimising LL forces the system to spend its budget on diversity instead.

The final connection is to non-terrestrial networks (NTN): satellite links have HARQ RTTs of 20–600 ms, so the feasible LL is fundamentally constrained by orbital mechanics. The ARQ-DMT formula still applies; what changes is the latency budget, which in turn reshapes the coding + scheduling design.

Taken together, the ARQ-DMT is a lens through which the coupling between coding theory, protocol design, and latency budget can be analysed. It is the point where the information-theoretic Part III connects to the system-level Part V of this book.