3,326 research outputs found
Achievable Regions for Interference Channels with Generalized and Intermittent Feedback
In this paper, we first study a two-user interference channel with
generalized feedback. We establish an inner bound on its capacity region. The
coding scheme that we employ for the inner bound is based on an appropriate
combination of Han-Kobayash rate splitting and compress-and-forward at the
senders. Each sender compresses the channel output that is observes using a
compression scheme that is \`a-la Lim et al. noisy network coding and
Avestimeher et al. quantize-map-and-forward. Next, we study an injective
deterministic model in which the senders obtain output feedback only
intermittently. Specializing the coding scheme of the model with generalized
feedback to this scenario, we obtain useful insights onto effective ways of
combining noisy network coding with interference alignment techniques. We also
apply our results to linear deterministic interference channels with
intermittent feedback.Comment: To appear in Proc. of the 2014 IEEE International Symposium on
Information Theory, 6 pages, 2 figure
A Relay Can Increase Degrees of Freedom in Bursty Interference Networks
We investigate the benefits of relays in multi-user wireless networks with
bursty user traffic, where intermittent data traffic restricts the users to
bursty transmissions. To this end, we study a two-user bursty MIMO Gaussian
interference channel with a relay, where two Bernoulli random states govern the
bursty user traffic. We show that an in-band relay can provide a degrees of
freedom (DoF) gain in this bursty channel. This beneficial role of in-band
relays in the bursty channel is in direct contrast to their role in the
non-bursty channel which is not as significant to provide a DoF gain. More
importantly, we demonstrate that for certain antenna configurations, an in-band
relay can help achieve interference-free performances with increased DoF. We
find the benefits particularly substantial with low data traffic, as the DoF
gain can grow linearly with the number of antennas at the relay. In this work,
we first derive an outer bound from which we obtain a necessary condition for
interference-free DoF performances. Then, we develop a novel scheme that
exploits information of the bursty traffic states to achieve them.Comment: submitted to the IEEE Transactions on Information Theor
On Two-Pair Two-Way Relay Channel with an Intermittently Available Relay
When multiple users share the same resource for physical layer cooperation
such as relay terminals in their vicinities, this shared resource may not be
always available for every user, and it is critical for transmitting terminals
to know whether other users have access to that common resource in order to
better utilize it. Failing to learn this critical piece of information may
cause severe issues in the design of such cooperative systems. In this paper,
we address this problem by investigating a two-pair two-way relay channel with
an intermittently available relay. In the model, each pair of users need to
exchange their messages within their own pair via the shared relay. The shared
relay, however, is only intermittently available for the users to access. The
accessing activities of different pairs of users are governed by independent
Bernoulli random processes. Our main contribution is the characterization of
the capacity region to within a bounded gap in a symmetric setting, for both
delayed and instantaneous state information at transmitters. An interesting
observation is that the bottleneck for information flow is the quality of state
information (delayed or instantaneous) available at the relay, not those at the
end users. To the best of our knowledge, our work is the first result regarding
how the shared intermittent relay should cooperate with multiple pairs of users
in such a two-way cooperative network.Comment: extended version of ISIT 2015 pape
Robust Signaling for Bursty Interference
This paper studies a bursty interference channel, where the presence/absence
of interference is modeled by a block-i.i.d.\ Bernoulli process that stays
constant for a duration of symbols (referred to as coherence block) and
then changes independently to a new state. We consider both a quasi-static
setup, where the interference state remains constant during the whole
transmission of the codeword, and an ergodic setup, where a codeword spans
several coherence blocks. For the quasi-static setup, we study the largest rate
of a coding strategy that provides reliable communication at a basic rate and
allows an increased (opportunistic) rate when there is no interference. For the
ergodic setup, we study the largest achievable rate. We study how non-causal
knowledge of the interference state, referred to as channel-state information
(CSI), affects the achievable rates. We derive converse and achievability
bounds for (i) local CSI at the receiver-side only; (ii) local CSI at the
transmitter- and receiver-side, and (iii) global CSI at all nodes. Our bounds
allow us to identify when interference burstiness is beneficial and in which
scenarios global CSI outperforms local CSI. The joint treatment of the
quasi-static and ergodic setup further allows for a thorough comparison of
these two setups.Comment: 67 pages, 39 figure
- …