Capacity Results for Finite-Field X-Channels with Delayed CSIT

01/09/2018
by   Alireza Vahid, et al.
0

We establish the capacity region of the two-user Finite-Field Fading X-Channel with delayed channel state information at the transmitters. We consider the most general case in which each transmitter has a common message for both receivers and a private message for each one of them. We derive a new set of outer-bounds for this problem that rely on an extremal entropy inequality. This inequality quantifies the ability of each transmitter in favoring one receiver over the other in terms of the delivered entropy when both receivers must obtain a baseline entropy. We show that the outer-bounds can be achieved by treating the X-Channel as a combination of a number of well-known problems such as the interference channel and the multicast channel. The capacity-achieving strategies of these sub-problems must be interleaved and carried on simultaneously in certain regimes in order to achieve the X-Channel outer-bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2019

Capacity Region of Erasure Broadcast Channels with Common Message and Feedback

Jolfaei et al. used feedback to create transmit signals that are simulta...
research
02/07/2018

On Capacity of Non-Coherent Diamond Networks

There is a vast body of work on the capacity bounds for a "coherent" wir...
research
06/29/2018

Multicasting Energy and Information Simultaneously

Communication systems for multicasting information and energy simultaneo...
research
04/28/2021

Topological Content Delivery with Feedback and Random Receiver Cache

We study the problem of content delivery in two-user interference channe...
research
01/03/2018

The Capacity on Degraded Relay Broadcast Channel

The relay broadcast channel (RBC) is considered, in which a transmitter ...
research
11/18/2019

Cooperative Multiple-Access Channels with Distributed State Information

This paper studies a memoryless state-dependent multiple access channel ...
research
05/01/2021

Content Delivery over Broadcast Erasure Channels with Distributed Random Cache

We study the content delivery problem between a transmitter and two rece...

Please sign up or login with your details

Forgot password? Click here to reset