Strong converse proven for multiuser Gaussian communication channels

Information Spectrum Methods for MUltiple-Access Channels--Part III : The Strong Converse in the $K$-User Gaussian Case

Information Theory

Summary

This paper looks at communication systems where multiple users send messages to a single receiver over noisy channels. It proves that if the combined message rates go beyond a certain limit, the chance of correctly decoding the messages drops to zero, no matter what coding method is used. The authors build on previous mathematical tools to show this for any number of users and provide a simpler proof than earlier work. This result helps confirm the exact limits of reliable communication in these scenarios.

What this means in practice

  • For network schedulers: Design scheduling algorithms that respect fundamental capacity limits for multiuser wireless uplinks involving Gaussian noise.
  • For wireless system engineers: Develop coding and resource allocation strategies ensuring reliable data transmission within the proven capacity bounds of multiuser Gaussian channels.

A theory result. No direct application yet.

Authors

Te Sun Han, Hideki Yagi

Abstract

This paper, Part III of a series, treats $K$-user multiple-access channels (MACs). Its starting point is a pair of fundamental lemmas, a random-coding lemma of Feinstein type and a converse lemma of Verdú--Han type, which are the $K$-user extensions of the two lemmas underlying Han's information spectrum approach to the general two-user MAC. From them we derive the capacity region of the general $K$-user MAC with cost constraint and show that it contains the polymatroid capacity region of the $K$-user Gaussian MAC. We then prove, by an elementary information spectrum calculation that adapts a diffuse--exceptional subspace decomposition used in recent second-order converses for the Gaussian MAC, that for every subset $\cS$ of users and every independent input satisfying the power constraints, the conditional information spectral-sup rate of the $K$-user Gaussian MAC does not exceed $\frac12\log(1+P_\cS/N)$, where $P_\cS$ is the total power of the users in $\cS$, with a probability bound that does not depend on the input. Consequently, the strong converse for the $K$-user Gaussian MAC, in the sense that the error probability tends to one for every rate tuple outside the capacity region, follows directly from the converse lemma, without the wringing technique and without hypothesis-testing meta-converses. This strong converse was first established by Fong and Tan, whose per-blocklength bounds yield it, through wringing and quantization. It is the key ingredient in the converse parts of the coding theorems for mixed Gaussian MACs in Part I, where the $\varepsilon$-strong converse would not suffice.