33,746 research outputs found
Interference alignment for the MIMO interference channel
We study vector space interference alignment for the MIMO interference
channel with no time or frequency diversity, and no symbol extensions. We prove
both necessary and sufficient conditions for alignment. In particular, we
characterize the feasibility of alignment for the symmetric three-user channel
where all users transmit along d dimensions, all transmitters have M antennas
and all receivers have N antennas, as well as feasibility of alignment for the
fully symmetric (M=N) channel with an arbitrary number of users.
An implication of our results is that the total degrees of freedom available
in a K-user interference channel, using only spatial diversity from the
multiple antennas, is at most 2. This is in sharp contrast to the K/2 degrees
of freedom shown to be possible by Cadambe and Jafar with arbitrarily large
time or frequency diversity.
Moving beyond the question of feasibility, we additionally discuss
computation of the number of solutions using Schubert calculus in cases where
there are a finite number of solutions.Comment: 16 pages, 7 figures, final submitted versio
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
Transmit Optimization with Improper Gaussian Signaling for Interference Channels
This paper studies the achievable rates of Gaussian interference channels
with additive white Gaussian noise (AWGN), when improper or circularly
asymmetric complex Gaussian signaling is applied. For the Gaussian
multiple-input multiple-output interference channel (MIMO-IC) with the
interference treated as Gaussian noise, we show that the user's achievable rate
can be expressed as a summation of the rate achievable by the conventional
proper or circularly symmetric complex Gaussian signaling in terms of the
users' transmit covariance matrices, and an additional term, which is a
function of both the users' transmit covariance and pseudo-covariance matrices.
The additional degrees of freedom in the pseudo-covariance matrix, which is
conventionally set to be zero for the case of proper Gaussian signaling,
provide an opportunity to further improve the achievable rates of Gaussian
MIMO-ICs by employing improper Gaussian signaling. To this end, this paper
proposes widely linear precoding, which efficiently maps proper
information-bearing signals to improper transmitted signals at each transmitter
for any given pair of transmit covariance and pseudo-covariance matrices. In
particular, for the case of two-user Gaussian single-input single-output
interference channel (SISO-IC), we propose a joint covariance and
pseudo-covariance optimization algorithm with improper Gaussian signaling to
achieve the Pareto-optimal rates. By utilizing the separable structure of the
achievable rate expression, an alternative algorithm with separate covariance
and pseudo-covariance optimization is also proposed, which guarantees the rate
improvement over conventional proper Gaussian signaling.Comment: Accepted by IEEE Transactions on Signal Processin
Robust Linear Precoder Design for Multi-cell Downlink Transmission
Coordinated information processing by the base stations of multi-cell
wireless networks enhances the overall quality of communication in the network.
Such coordinations for optimizing any desired network-wide quality of service
(QoS) necessitate the base stations to acquire and share some channel state
information (CSI). With perfect knowledge of channel states, the base stations
can adjust their transmissions for achieving a network-wise QoS optimality. In
practice, however, the CSI can be obtained only imperfectly. As a result, due
to the uncertainties involved, the network is not guaranteed to benefit from a
globally optimal QoS. Nevertheless, if the channel estimation perturbations are
confined within bounded regions, the QoS measure will also lie within a bounded
region. Therefore, by exploiting the notion of robustness in the worst-case
sense some worst-case QoS guarantees for the network can be asserted. We adopt
a popular model for noisy channel estimates that assumes that estimation noise
terms lie within known hyper-spheres. We aim to design linear transceivers that
optimize a worst-case QoS measure in downlink transmissions. In particular, we
focus on maximizing the worst-case weighted sum-rate of the network and the
minimum worst-case rate of the network. For obtaining such transceiver designs,
we offer several centralized (fully cooperative) and distributed (limited
cooperation) algorithms which entail different levels of complexity and
information exchange among the base stations.Comment: 38 Pages, 7 Figures, To appear in the IEEE Transactions on Signal
Processin
- …