Cooperative Multiple-Access Channels With Distributed State Information

  title={Cooperative Multiple-Access Channels With Distributed State Information},
  author={Lorenzo Miretti and Mari Kobayashi and D. Gesbert and Paul de Kerret},
  journal={IEEE Transactions on Information Theory},
This paper studies a memoryless state-dependent multiple access channel (MAC) where two transmitters wish to convey a message to a receiver under the assumption of causal and imperfect channel state information at transmitters (CSIT) and imperfect channel state information at receiver (CSIR). In order to emphasize the limitation of transmitter cooperation between physically distributed nodes, we focus on the so-called distributed CSIT assumption, i.e., where each transmitter has its individual… Expand

Figures from this paper

Interference Mitigation for Cooperative MIMO Channels with Asymmetric Feedback
This work proposes a method for distributed precoding design which optimally minimizes the expected interference and shows that this trick helps in transforming an otherwise difficult robust optimization problem into a convex formulation. Expand
Team MMSE Precoding with Applications to Cell-free Massive MIMO
This article studies a novel distributed precoding design, coined team minimum mean-square error (TMMSE) precoding, which rigorously generalizes classical centralized MMSE precoding to distributedExpand
Entanglement-Enabled Communication for the Internet of Things
  • Janis Nötzel, Stephen Diadamo
  • Computer Science
  • 2020 International Conference on Computer, Information and Telecommunication Systems (CITS)
  • 2020
A beneficial impact of entanglement-modulated coding for multi-access scenarios where many senders attempt to reach one receiver is demonstrated, a scenario with an increased likelihood in the internet of things. Expand


Multiple Access Channels With States Causally Known at Transmitters
A generalization of the proved capacity region of a two-user MAC with independent states, each known strictly causally to one encoder, is proposed whereby the encoders compress also the past transmitted codewords along with the past state sequences. Expand
On the Capacity of Memoryless Finite-State Multiple-Access Channels With Asymmetric State Information at the Encoders
  • G. Como, S. Yüksel
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 2011
A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence,Expand
Capacity With Causal and Noncausal Side Information: A Unified View
  • S. Jafar
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 2006
Applications of these capacity bounds are demonstrated through examples of random access channels and indicate that the excessive MAC layer overheads common in present wireless systems may be avoided through coding across multiple-access blocks. Expand
The Multiple-Access Channel With Causal Side Information: Common State
We show that if a memoryless multiple-access channel (MAC) is governed by an independent and identically distributed state sequence, then-unlike the single-user case-the capacity region is typicallyExpand
The Multiple-Access Channel With Causal Side Information: Double State
It is shown that, even in the strictly causal case, the state information at the encoders can increase the capacity region, but it cannot, however, increase the sum-rate capacity. Expand
On the capacity of some channels with channel state information
It is shown that variable-rate coding is not needed to achieve capacity and, even when the CSIT is not perfect, the capacity achieving power allocation is of the waferfilling type. Expand
Channels with Side Information at the Transmitter
In this paper a type of channel with side information is studied and its capacity determined. Expand
Team Methods for Device Cooperation in Wireless Networks
This chapter provides a general formulation for TD methods for device cooperation in wireless networks, introduced relevant decentralized information models and classes of decision-making solutions, and illustrates these various approaches through the prism of one specific example, namely the problem of decentralized MIMO beamforming (precoding) in wireless Networks. Expand
Precoding for Cooperative MIMO Channels with Asymmetric Feedback
This work proposes a method for joint distributed precoding and feedback design under asymmetric feedback rate constraints and optimize the number of spatial data streams under practical complexity constraints. Expand
Achieving Vanishing Rate Loss in Decentralized Network MIMO
This paper considerably strengthens the previous intriguing DoF result by showing that it is possible to achieve asymptotically the same sum rate as that attained by Zero-Forcing precoding in a centralized setting endowed with the best-quality CSI. Expand