State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results
From MaRDI portal
Publication:4562147
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: i) each user wishes to communicate an independent message to the common receiver, and ii) 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.
Cited in
(4)- Channel Capacity and State Estimation for State-Dependent Gaussian Channels
- Capacity Characterization for State-Dependent Gaussian Channel With a Helper
- State-Dependent Gaussian Interference Channels: Can State Be Fully Canceled?
- State estimation with multi-level vector quantisation and communication uncertainty
This page was built for publication: State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4562147)
