Prerequisites

Before You Begin

This chapter builds on information-theoretic foundations, OFDM/OFDMA system design, diversity techniques, and multi-user access. If any item feels unfamiliar, revisit the linked material first.

  • Entropy, mutual information, and channel capacity (Shannon limit)(Review ch02)

    Self-check: Can you state the capacity of an AWGN channel and explain what happens as blocklength nn \to \infty?

  • OFDM system model, cyclic prefix, and subcarrier allocation(Review ch11)

    Self-check: Can you describe how OFDM converts a frequency-selective channel into parallel flat-fading subchannels?

  • Diversity techniques: spatial, frequency, and time diversity; combining methods(Review ch12)

    Self-check: Can you derive the outage probability scaling PoutSNRLP_{\mathrm{out}} \propto \text{SNR}^{-L} for LL-branch MRC in Rayleigh fading?

  • Multiple access schemes: TDMA, FDMA, CDMA, OFDMA, and random access (ALOHA)(Review ch19)

    Self-check: Can you compute the throughput of slotted ALOHA and explain why it peaks at 1/e1/e?

  • Basic queueing theory: M/M/1 queue, arrival rate, service rate, stability condition

    Self-check: Can you write the mean delay for an M/M/1 queue with arrival rate λ\lambda and service rate μ\mu?

  • Compressed sensing basics: sparsity, RIP, and 1\ell_1 recovery

    Self-check: Do you know that O(slog(n/s))O(s \log(n/s)) measurements suffice to recover an ss-sparse vector in Rn\mathbb{R}^n?

Notation for This Chapter

Symbols introduced in this chapter. See also the NGlobal Notation Table master table in the front matter.

SymbolMeaningIntroduced
nnBlocklength (number of channel uses per codeword)s01
ε\varepsilonBlock error probability (decoding failure probability)s01
CCShannon capacity (bits per channel use)s01
VVChannel dispersion (bits2^2 per channel use)s01
Q1()Q^{-1}(\cdot)Inverse of the Gaussian Q-functions01
R(n,ε)R^*(n, \varepsilon)Maximum achievable rate at blocklength nn and error probability ε\varepsilons01
LLDiversity order (number of independent diversity branches)s02
KtotalK_{\mathrm{total}}Total number of mMTC devices in the cells03
KaK_aNumber of active devices in a given slots03
A\mathbf{A}Pilot (sensing) matrix for compressed sensing activity detections03
Δ(t)\Delta(t)Age of Information at the monitor at time tts04
Δˉ\bar{\Delta}Time-average Age of Informations04
ρ=λ/μ\rho = \lambda / \muServer utilisation (traffic intensity)s04
BBMessage size in bits (unsourced random access)s03