|
Contact:
Marcus Greferath
School of Math. Sciences
University College Dublin
Belfield, Dublin 4, Ireland
Phone:
+353-1-716-2588 (UCD)
+353-85-153-0951 (mobile)
Joachim Rosenthal
Institut of Mathematics
University of Zurich
Winterthurerstrasse 190
8057 Zurich, Switzerland
Phone:
+41-44-63 55884 (office)
|
|
ITW 2010 Dublin
IEEE Information Theory Workshop
Dublin, August 30 - September 3, 2010
Interference channels
Tue 31 Aug, 16.20-18.00, Room 3
Contributed session
|
|
Amin Jafarian and Sriram Vishwanath
On Achievable Rates for Classes of Non-Linear Deterministic Interference Channels
|
|
Abstract:
This paper extends the literature on interference alignment to more
certain classes of deterministic channels which incorporate
non-linear input-output relationships. It is found that the
concept of alignment extends naturally to these deterministic
interference channels, and in many cases, the achieved degrees of
freedom (DoF) can be shown to be optimal. A key contribution of the
paper is the connection it builds between interference alignment and
number theory.
Tue 31 Aug, 16.20-16.40, Room 3
|
|
|
Stefano Rini, Daniela Tuninetti, and Natasha Devroye
Outer Bounds for the Interference Channel with a Cognitive Relay
|
|
Abstract:
In this paper, we first present an outer bound for a general
interference channel with a cognitive relay, i.e., a relay that has
non-causal knowledge of both independent messages transmitted
in the interference channel. This outer bound reduces to the
capacity region of the deterministic broadcast channel and of the
deterministic cognitive interference channel the through nulling of
certain channel inputs. It does not, however, reduce to that of
certain deterministic interference channels for which capacity is
known. As such, we subsequently tighten the bound for channels
whose outputs satisfy an "invertibility" condition. This second
outer bound now reduces to the capacity of the special class of
deterministic interference channels for which capacity is known.
The second outer bound is further tightened for the high-SNR
deterministic approximation of the Gaussian
channel by exploiting the special structure of the interference. We
provide an example that suggests that this third bound is tight in
at least some parameter regimes for the high-SNR deterministic
approximation of the Gaussian channel. Another example shows that
the third bound is capacity in the special case where there are no
direct links between the non-cognitive transmitters.
Tue 31 Aug, 16.40-17.00, Room 3
|
|
|
Mahtab Mirmohseni, Bahareh Akhbari, and Mohammad Reza Aref
Capacity Regions for Some Classes of Causal Cognitive Interference Channels With Delay
|
|
Abstract:
In this paper, we investigate Causal Cognitive Interference Channel
(CC-IFC) with delay in which the cognitive user transmission can
depend on L future received symbols as well as the past ones. We
study two special cases: CC-IFC without delay (L=1), where the
cognitive user can use only current and past received symbols, and
CC-IFC with a block length delay (L=n), wherein the entire
received sequence can be used. In each case, we obtain an inner
bound on the capacity region. Our coding schemes are based on the
generalized block Markov superposition coding and instantaneous
relaying for CC-IFC without delay, and non-causal partial
Decode-and-Forward (DF) for CC-IFC with a block length
delay. Further, providing converse proofs, we show that the derived
inner bounds are tight in some cases. Hence, we characterize the
capacity regions for the classes of degraded and semi-deterministic
CC-IFC without delay and CC-IFC with a block length delay, under
strong interference conditions.
Tue 31 Aug, 17.00-17.20, Room 3
|
|
|
Jubin Jose and Sriram Vishwanath
Sum Capacity of K User Gaussian Degraded Interference Channels
|
|
Abstract:
This paper studies a family of genie-MAC (multiple access channel)
outer bounds for K-user Gaussian interference channels. This
family is inspired by existing genie-aided bounding mechanisms, but
differs from current approaches in its optimization problem
formulation and application. The fundamental idea behind these
bounds is to create a group of genie receivers that form multiple
access channels that can decode a subset of the original
interference channel's messages. The MAC sum capacity of each of the
genie receivers provides an outer bound on the sum of rates for this
subset. The genie-MAC outer bounds are used to derive new
sum-capacity results. In particular, this paper derives sum-capacity
in closed-form for the class of K-user Gaussian degraded
interference channels. The sum-capacity achieving scheme is shown to
be a successive interference cancellation scheme. This result
generalizes a known result for two-user channels to K-user
channels.
Tue 31 Aug, 17.20-17.40, Room 3
|
|
|
Ron Dabora
The Capacity Region of the Interference Channel with a Relay in the Strong Interference Regime subject to Phase Fading
|
|
Abstract:
The interference channel with a relay (ICR) is the fundamental
building block of cooperation in wireless networks consisting of
multiple communicating pairs. This work considers ICRs in which the
links are subject to i.i.d. phase fading. Strong interference
conditions are derived for the case where the links from the sources
to the relay are good, leading to the characterization of the
capacity region of the ICR for such scenarios. This is the first
time the capacity region of this model is characterized for a
non-degraded, non-cognitive scenario when all links are active and
the SNRs are finite.
Tue 31 Aug, 17.40-18.00, Room 3
|
Back to previous page
Return to conference mainpage
|
|
