Capacity-Achieving Distributions in Gaussian Multiple Access Channel With Peak Power Constraints

摘要

This paper addresses a two-user Gaussian multiple access channel (MAC) under peak power constraints at the transmitters. It is shown that generating the code-books of both users according to discrete distributions with a finite number of mass points achieves the largest weighted sum-rate in the network. This verifies that any point on the boundary of the capacity region of a two-user MAC under peak power constraints at both transmitters is achieved by discrete distributions with a finite number of mass points. Although the capacity-achieving distributions are not necessarily unique, it is verified that only discrete distributions with a finite number of mass points can achieve a point on the boundary of the capacity region. It is shown that there exist an infinite number of sum-rate-optimal points on the boundary of the capacity region. In contrast to the Gaussian MAC with average power constraints, we verify that time division (TD) cannot achieve any of the sum-rate-optimal points in the Gaussian MAC with peak power constraints. Using the so-called I-MMSE identity of Guo et al., the largest achievable sum-rate by orthogonal code division (OCD) is characterized where it is shown that Walsh–Hadamard spreading codes of length 2 are optimal. In the symmetric case where the peak power constraints at both transmitters are identical, we verify that OCD can achieve a sum-rate that is strictly larger than the highest sum-rate achieved by TD. Finally, it is demonstrated that there are values for the maximum peak power at the transmitters such that OCD can not achieve any of the sum-rate-optimal points on the boundary of the capacity region.