Cooperative Multiple-Access Channels with Distributed State Information
Lorenzo Miretti, Mari Kobayashi, David Gesbert, Paul de Kerret

TL;DR
This paper characterizes the capacity of a memoryless state-dependent multiple access channel with distributed, imperfect channel state information at transmitters and receiver, proposing optimal coding schemes and analyzing specific Gaussian channel scenarios.
Contribution
It provides a capacity characterization for distributed CSIT/CSIR MACs and introduces optimal coding strategies based on Shannon strategies, including for Gaussian channels with feedback.
Findings
Optimal schemes use Shannon strategies based on current CSIT.
Capacity achieved with distributed linear precoding in Gaussian channels.
Sending more data streams than transmit antennas is suboptimal in distributed CSIT scenarios.
Abstract
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 channel knowledge, while the message can be assumed to be partially or entirely shared a priori between transmitters by exploiting some on-board memory. Under this setup, the first part of the paper characterizes the common message capacity of the channel at hand for arbitrary CSIT and CSIR structure. The optimal scheme builds on Shannon strategies, i.e. optimal codes are constructed by letting the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
