Search arXivSearch

arXiv · 2501.14941

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

Abstract

This article establishes that the capacity region of the two-user weak Gaussian interference channel can be achieved using single-letter Gaussian codebooks. The converse is established by showing that successive decoding can be employed for at least one of the receivers. It is further shown that the upper concave envelope of the achievable rate region can be attained using at most two time-sharing phases. In one phase, both users transmit simultaneously, while in the second phase, when present, only one user is active. Furthermore, the boundary of the capacity region can be traversed continuously through incremental reallocations of power between the two messages transmitted by each user. Finally, it is proven that the Han-Kobayashi achievable rate region with single-letter Gaussian codebooks attains the optimal boundary of the capacity region.

Explore related subjects

Keep this discovery

BibTeXRIS

Amir K. Khandani. 2026-09-07. On the Optimality of Gaussian Code-books for Signaling over a Two-Users Weak Gaussian Interference Channel. https://arxiv.org/abs/2501.14941

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

The maximum entropy state

We give an algorithm for calculating the maximum entropy state as the least fixed point of a Scott continuous mapping on the domain of classical states in their Bayesian order.

math.PR

Multiplicative comparisons of Rényi entropies for weighted Bernoulli sums

We establish improved multiplicative bounds relating the Rényi entropies of different orders for weighted sums of independent Bernoulli random variables. In particular, we prove a logarithmic bound between the zeroth-order and infinity-order Rényi entropies, which yields a polynomial improvement over the square-root bound of Jain, Sah, and Sawhney. Additionally, we obtain explicit constant-factor bounds for comparisons among Rényi entropies of nonzero orders.

math.PR

Oracle-free Boltzmann Sampling for Powersets

We propose an approach for sampling powersets under the Boltzmann distribution in an oracle-free way, i.e. without numerically evaluating the associated generating function. Our approach relies on a Poissonised infinite occupancy model and thinning. It yields an explicit sampler for bounded counting sequences and extends under mild growth conditions. We implement the sampler and find runtimes comparable to existing Boltzmann samplers.

cs.DM