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

TL;DR

This paper proves that Gaussian code-books are optimal for achieving the capacity region in a two-user weak Gaussian interference channel, using a boundary traversal approach and calculus of variation.

Contribution

It establishes the optimality of single-letter Gaussian code-books for the weak interference channel and shows that the Han-Kobayashi region achieves the capacity boundary.

Findings

Gaussian code-books achieve the capacity region in weak interference channels.

Optimal solutions for vector inputs do not surpass single-letter solutions.

Maximum phases for time-sharing are two.

Abstract

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.