ITITPRMay 2

On the Optimality of Gaussian Code-books for Signaling over a Two-Users Weak Gaussian Interference Channel

arXiv:2501.1494124.62 citationsh-index: 44
Predicted impact top 56% in IT · last 90 daysOriginality Highly original
AI Analysis

Solves the long-standing open problem of optimal code-book structure for the two-user weak Gaussian interference channel, providing a theoretical foundation for practical code design.

The paper proves that the capacity region of a two-user weak Gaussian interference channel is achieved using single-letter Gaussian code-books, with at most two time-sharing phases. The result is established via calculus of variations and extends to the general interference case.

This article shows that the capacity region of a two users weak Gaussian interference channel can be achieved using single letter Gaussian code-books. The approach relies on traversing the boundary in incremental steps. Starting from a corner point with Gaussian code-books, and relying on calculus of variation, it is shown that the end point in each step is achieved using Gaussian code-books. Optimality of Gaussian code-books is first established by limiting the random coding to independent and identically distributed scalar (single-letter) samples. Then, it is shown that the value of any optimum solution for vector inputs does not exceed that of the single-letter case. It is also shown that the maximum number of phases needed to realize the optimum time-sharing is two. It is established that the solution to the Han-Kobayashi achievable rate region, with single letter Gaussian code-books, achieves the optimum boundary. Even though the article focuses on weak interference, the results are applicable to the general case.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes