The Finite State MAC With Cooperative Encoders and Delayed CSI

DOI10.1109/TIT.2014.2346494MaRDI QIDQ2986097zbMATH OpenOpenAlexFDO

Authors Ziv Goldfeld, Haim Permuter, Benjamin M. Zaidel

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.7083

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: In this paper, we consider the finite-state multiple access channel (MAC) with partially cooperative encoders and delayed channel state information (CSI). Here partial cooperation refers to the communication between the encoders via finite-capacity links. The channel states are assumed to be governed by a Markov process. Full CSI is assumed at the receiver, while at the transmitters, only delayed CSI is available. The capacity region of this channel model is derived by first solving the case of the finite-state MAC with a common message. Achievability for the latter case is established using the notion of strategies, however, we show that optimal codes can be constructed directly over the input alphabet. This results in a single codebook construction that is then leveraged to apply simultaneous joint decoding. Simultaneous decoding is crucial here because it circumvents the need to rely on the capacity region's corner points, a task that becomes increasingly cumbersome with the growth in the number of messages to be sent. The common message result is then used to derive the capacity region for the case with partially cooperating encoders. Next, we apply this general result to the special case of the Gaussian vector MAC with diagonal channel transfer matrices, which is suitable for modeling, e.g., orthogonal frequency division multiplexing (OFDM)-based communication systems. The capacity region of the Gaussian channel is presented in terms of a convex optimization problem that can be solved efficiently using numerical tools. The region is derived by first presenting an outer bound on the general capacity region and then suggesting a specific input distribution that achieves this bound. Finally, numerical results are provided that give valuable insight into the practical implications of optimally using conferencing to maximize the transmission rates.

Recommendations

• On Cooperative Multiple Access Channels With Delayed CSI at Transmitters
• Cooperation in the Low Power Regime for the MAC Using Multiplexed Rateless Codes
• The Unbounded Benefit of Encoder Cooperation for the k-User MAC
• Cooperative Multiple-Access Channels With Distributed State Information
• Channel State Feedback Over the MIMO-MAC
• Capacity Region of Finite State Multiple-Access Channels With Delayed State Information at the Transmitters
• Message and State Cooperation in Multiple Access Channels
• On State-Dependent Degraded Broadcast Channels With Cooperation
• Cooperative Multiple-Access Encoding With States Available at One Transmitter
• Fundamental Limits of Many-User MAC With Finite Payloads and Fading

Cited in

(1)

• MAC With Action-Dependent State Information at One Encoder

This page was built for publication: The Finite State MAC With Cooperative Encoders and Delayed CSI

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986097)