23 research outputs found
On Cooperative Multiple Access Channels with Delayed CSI at Transmitters
We consider a cooperative two-user multiaccess channel in which the
transmission is controlled by a random state. Both encoders transmit a common
message and, one of the encoders also transmits an individual message. We study
the capacity region of this communication model for different degrees of
availability of the states at the encoders, causally or strictly causally. In
the case in which the states are revealed causally to both encoders but not to
the decoder we find an explicit characterization of the capacity region in the
discrete memoryless case. In the case in which the states are revealed only
strictly causally to both encoders, we establish inner and outer bounds on the
capacity region. The outer bound is non-trivial, and has a relatively simple
form. It has the advantage of incorporating only one auxiliary random variable.
We then introduce a class of cooperative multiaccess channels with states known
strictly causally at both encoders for which the inner and outer bounds agree;
and so we characterize the capacity region for this class. In this class of
channels, the state can be obtained as a deterministic function of the channel
inputs and output. We also study the model in which the states are revealed,
strictly causally, in an asymmetric manner, to only one encoder. Throughout the
paper, we discuss a number of examples; and compute the capacity region of some
of these examples. The results shed more light on the utility of delayed
channel state information for increasing the capacity region of state-dependent
cooperative multiaccess channels; and tie with recent progress in this
framework.Comment: 54 pages. To appear in IEEE Transactions on Information Theory. arXiv
admin note: substantial text overlap with arXiv:1201.327
The Benefit of Encoder Cooperation in the Presence of State Information
In many communication networks, the availability of channel state information
at various nodes provides an opportunity for network nodes to work together, or
"cooperate." This work studies the benefit of cooperation in the multiple
access channel with a cooperation facilitator, distributed state information at
the encoders, and full state information available at the decoder. Under
various causality constraints, sufficient conditions are obtained such that
encoder cooperation through the facilitator results in a gain in sum-capacity
that has infinite slope in the information rate shared with the encoders. This
result extends the prior work of the authors on cooperation in networks where
none of the nodes have access to state information.Comment: Extended version of paper presented at ISIT 2017 in Aachen. 20 pages,
1 figur
Cognitive Wyner Networks with Clustered Decoding
We study an interference network where equally-numbered transmitters and
receivers lie on two parallel lines, each transmitter opposite its intended
receiver. We consider two short-range interference models: the "asymmetric
network," where the signal sent by each transmitter is interfered only by the
signal sent by its left neighbor (if present), and a "symmetric network," where
it is interfered by both its left and its right neighbors. Each transmitter is
cognizant of its own message, the messages of the transmitters to its
left, and the messages of the transmitters to its right. Each receiver
decodes its message based on the signals received at its own antenna, at the
receive antennas to its left, and the receive antennas to its
right. For such networks we provide upper and lower bounds on the multiplexing
gain, i.e., on the high-SNR asymptotic logarithmic growth of the sum-rate
capacity. In some cases our bounds meet, e.g., for the asymmetric network. Our
results exhibit an equivalence between the transmitter side-information
parameters and the receiver side-information parameters in the sense that increasing/decreasing or by a positive
integer has the same effect on the multiplexing gain as
increasing/decreasing or by . Moreover---even in
asymmetric networks---there is an equivalence between the left side-information
parameters and the right side-information parameters .Comment: Second revision submitted to IEEE Transactions on Information Theor