30,422 research outputs found
Topological Interference Management through Index Coding
This work studies linear interference networks, both wired and wireless, with
no channel state information at the transmitters (CSIT) except a coarse
knowledge of the end-to-end one-hop topology of the network that only allows a
distinction between weak (zero) and significant (non-zero) channels and no
further knowledge of the channel coefficients' realizations. The network
capacity (wired) and DoF (wireless) are found to be bounded above by the
capacity of an index coding problem for which the antidote graph is the
complement of the given interference graph. The problems are shown to be
equivalent under linear solutions. An interference alignment perspective is
then used to translate the existing index coding solutions into the wired
network capacity and wireless network DoF solutions, as well as to find new and
unified solutions to different classes of all three problems.Comment: Revised for the IEEE Transactions on Information Theor
Optimality of Orthogonal Access for One-dimensional Convex Cellular Networks
It is shown that a greedy orthogonal access scheme achieves the sum degrees
of freedom of all one-dimensional (all nodes placed along a straight line)
convex cellular networks (where cells are convex regions) when no channel
knowledge is available at the transmitters except the knowledge of the network
topology. In general, optimality of orthogonal access holds neither for
two-dimensional convex cellular networks nor for one-dimensional non-convex
cellular networks, thus revealing a fundamental limitation that exists only
when both one-dimensional and convex properties are simultaneously enforced, as
is common in canonical information theoretic models for studying cellular
networks. The result also establishes the capacity of the corresponding class
of index coding problems
A class of index coding problems with rate 1/3
An index coding problem with messages has symmetric rate if all
messages can be conveyed at rate . In a recent work, a class of index coding
problems for which symmetric rate is achievable was characterised
using special properties of the side-information available at the receivers. In
this paper, we show a larger class of index coding problems (which includes the
previous class of problems) for which symmetric rate is
achievable. In the process, we also obtain a stricter necessary condition for
rate feasibility than what is known in literature.Comment: Shorter version submitted to ISIT 201
Topological Interference Management with Alternating Connectivity
The topological interference management problem refers to the study of the
capacity of partially connected linear (wired and wireless) communication
networks with no channel state information at the transmitters (no CSIT) beyond
the network topology, i.e., a knowledge of which channel coefficients are zero
(weaker than the noise floor in the wireless case). While the problem is
originally studied with fixed topology, in this work we explore the
implications of varying connectivity, through a series of simple and
conceptually representative examples. Specifically, we highlight the
synergistic benefits of coding across alternating topologies
Elements of Cellular Blind Interference Alignment --- Aligned Frequency Reuse, Wireless Index Coding and Interference Diversity
We explore degrees of freedom (DoF) characterizations of partially connected
wireless networks, especially cellular networks, with no channel state
information at the transmitters. Specifically, we introduce three fundamental
elements --- aligned frequency reuse, wireless index coding and interference
diversity --- through a series of examples, focusing first on infinite regular
arrays, then on finite clusters with arbitrary connectivity and message sets,
and finally on heterogeneous settings with asymmetric multiple antenna
configurations. Aligned frequency reuse refers to the optimality of orthogonal
resource allocations in many cases, but according to unconventional reuse
patterns that are guided by interference alignment principles. Wireless index
coding highlights both the intimate connection between the index coding problem
and cellular blind interference alignment, as well as the added complexity
inherent to wireless settings. Interference diversity refers to the observation
that in a wireless network each receiver experiences a different set of
interferers, and depending on the actions of its own set of interferers, the
interference-free signal space at each receiver fluctuates differently from
other receivers, creating opportunities for robust applications of blind
interference alignment principles
Local Graph Coloring and Index Coding
We present a novel upper bound for the optimal index coding rate. Our bound
uses a graph theoretic quantity called the local chromatic number. We show how
a good local coloring can be used to create a good index code. The local
coloring is used as an alignment guide to assign index coding vectors from a
general position MDS code. We further show that a natural LP relaxation yields
an even stronger index code. Our bounds provably outperform the state of the
art on index coding but at most by a constant factor.Comment: 14 Pages, 3 Figures; A conference version submitted to ISIT 2013;
typos correcte
- β¦