Skip to main content

State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results

Author(s): Yang, Wei; Liang, Yingbin; Shamai Shitz, Shlomo; Poor, H Vincent

To refer to this page use:
Abstract: This paper studies a two-user state-dependent Gaussian multiple-access channel (MAC) with state noncausally known at one encoder. Two scenarios are considered: 1) each user wishes to communicate an independent message to the common receiver; and 2) the two encoders send a common message to the receiver and the non-cognitive encoder (i.e., the encoder that does not know the state) sends an independent individual message (this model is also known as the MAC with degraded message sets). For both scenarios, new outer bounds on the capacity region are derived, which improve uniformly over the best known outer bounds. In the first scenario, the two corner points of the capacity region as well as the sum rate capacity are established, and it is shown that a single-letter solution is adequate to achieve both the corner points and the sum rate capacity. Furthermore, the full capacity region is characterized in situations in which the sum rate capacity is equal to the capacity of the helper problem. The proof exploits the optimal-transportation idea of Polyanskiy and Wu (which was used previously to establish an outer bound on the capacity region of the interference channel) and the worst case Gaussian noise result for the case in which the input and the noise are dependent.
Publication Date: 22-May-2018
Citation: Yang, Wei, Liang, Yingbin, Shamai Shitz, Shlomo, Poor, H Vincent. (2018). State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results. IEEE Transactions on Information Theory, 64 (12), 7866 - 7882. doi:10.1109/tit.2018.2839643
DOI: doi:10.1109/tit.2018.2839643
ISSN: 0018-9448
EISSN: 1557-9654
Pages: 7866 - 7882
Type of Material: Journal Article
Journal/Proceeding Title: IEEE Transactions on Information Theory
Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.