Part 5: Multi-Hop Networks and Relaying

Chapter 23: Gaussian Relay Networks

Advanced~200 min

Learning Objectives

  • Compute DF and CF achievable rates for the Gaussian relay channel and compare with the cut-set bound
  • Understand the constant-gap result: CF achieves within 0.5 bits of the cut-set bound for the Gaussian relay channel
  • State the Gupta-Kumar scaling law and explain why per-node throughput vanishes in large ad hoc networks
  • Understand the Ozgur-Leveque-Tse hierarchical MIMO result and how cooperation achieves linear scaling
  • Master the noisy network coding scheme and its universality for general relay networks

Sections

Prerequisites

💬 Discussion

Loading discussions...