4,818 research outputs found
On the Achievability of Interference Alignment in the K-User Constant MIMO Interference Channel
Interference alignment in the K-user MIMO interference channel with constant
channel coefficients is considered. A novel constructive method for finding the
interference alignment solution is proposed for the case where the number of
transmit antennas equals the number of receive antennas (NT = NR = N), the
number of transmitter-receiver pairs equals K = N + 1, and all interference
alignment multiplexing gains are one. The core of the method consists of
solving an eigenvalue problem that incorporates the channel matrices of all
interfering links. This procedure provides insight into the feasibility of
signal vector spaces alignment schemes in finite dimensional MIMO interference
channels.Comment: submitted to IEEE Workshop on Statistical Signal Processing (SSP09
Robust Lattice Alignment for K-user MIMO Interference Channels with Imperfect Channel Knowledge
In this paper, we consider a robust lattice alignment design for K-user
quasi-static MIMO interference channels with imperfect channel knowledge. With
random Gaussian inputs, the conventional interference alignment (IA) method has
the feasibility problem when the channel is quasi-static. On the other hand,
structured lattices can create structured interference as opposed to the random
interference caused by random Gaussian symbols. The structured interference
space can be exploited to transmit the desired signals over the gaps. However,
the existing alignment methods on the lattice codes for quasi-static channels
either require infinite SNR or symmetric interference channel coefficients.
Furthermore, perfect channel state information (CSI) is required for these
alignment methods, which is difficult to achieve in practice. In this paper, we
propose a robust lattice alignment method for quasi-static MIMO interference
channels with imperfect CSI at all SNR regimes, and a two-stage decoding
algorithm to decode the desired signal from the structured interference space.
We derive the achievable data rate based on the proposed robust lattice
alignment method, where the design of the precoders, decorrelators, scaling
coefficients and interference quantization coefficients is jointly formulated
as a mixed integer and continuous optimization problem. The effect of imperfect
CSI is also accommodated in the optimization formulation, and hence the derived
solution is robust to imperfect CSI. We also design a low complex iterative
optimization algorithm for our robust lattice alignment method by using the
existing iterative IA algorithm that was designed for the conventional IA
method. Numerical results verify the advantages of the proposed robust lattice
alignment method
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
Achievable Sum DoF of the K-User MIMO Interference Channel with Delayed CSIT
This paper considers a -user multiple-input-multiple-output (MIMO)
interference channel (IC) where 1) the channel state information obtained by
the transmitters (CSIT) is completely outdated, and 2) the number of transmit
antennas at each transmitter, i.e., , is greater than the number of receive
antennas at each user, i.e., . The usefulness of the delayed CSIT was
firstly identified in a -phase Retrospective Interference Alignment (RIA)
scheme proposed by Maddah-Ali et al for the Multiple-Input-Single-Output
Broadcast Channel, but the extension to the MIMO IC is a non-trivial step as
each transmitter only has the message intended for the corresponding user.
Recently, Abdoli et al focused on a Single-Input-Single-Output IC and solved
such bottleneck by inventing a -phase RIA with distributed overheard
interference retransmission. In this paper, we propose two -phase RIA
schemes suitable for the MIMO IC by generalizing and integrating some key
features of both Abdoli's and Maddah-Ali's works. The two schemes jointly yield
the best known sum Degrees-of-Freedom (DoF) performance so far. For the case
, the achieved sum DoF is asymptotically given by
when
On Precoding for Constant K-User MIMO Gaussian Interference Channel with Finite Constellation Inputs
This paper considers linear precoding for constant channel-coefficient
-User MIMO Gaussian Interference Channel (MIMO GIC) where each
transmitter- (Tx-), requires to send independent complex symbols
per channel use that take values from fixed finite constellations with uniform
distribution, to receiver- (Rx-) for . We define the
maximum rate achieved by Tx- using any linear precoder, when the
interference channel-coefficients are zero, as the signal to noise ratio (SNR)
tends to infinity to be the Constellation Constrained Saturation Capacity
(CCSC) for Tx-. We derive a high SNR approximation for the rate achieved by
Tx- when interference is treated as noise and this rate is given by the
mutual information between Tx- and Rx-, denoted as . A set of
necessary and sufficient conditions on the precoders under which
tends to CCSC for Tx- is derived. Interestingly, the precoders designed for
interference alignment (IA) satisfy these necessary and sufficient conditions.
Further, we propose gradient-ascent based algorithms to optimize the sum-rate
achieved by precoding with finite constellation inputs and treating
interference as noise. Simulation study using the proposed algorithms for a
3-user MIMO GIC with two antennas at each node with for all , and
with BPSK and QPSK inputs, show more than 0.1 bits/sec/Hz gain in the ergodic
sum-rate over that yielded by precoders obtained from some known IA algorithms,
at moderate SNRs.Comment: 15 pages, 9 figure
Achievable sum DoF of the K-user MIMO interference channel with delayed CSIT
This paper considers a K-user multiple-inputmultiple-output (MIMO) interference channel (IC) where 1) the channel state information obtained by the transmitters (CSIT) is completely outdated, and 2) the number of transmit antennas at each transmitter, i.e., M, is greater than the number of receive antennas at each user, i.e., N. The usefulness of the delayed CSIT was firstly identified in a K-phase Retrospective Interference Alignment (RIA) scheme proposed by Maddah-Ali et al for the Multiple-Input-Single-Output Broadcast Channel, but the extension to the MIMO IC is a non-trivial step as each transmitter only has the message intended for the corresponding user. Recently, Abdoli et al focused on a Single-Input-SingleOutput IC and solved such bottleneck by inventing a K-phase RIA with distributed overheard interference retransmission. In this paper, we propose two K-phase RIA schemes suitable for the MIMO IC by generalizing and integrating some key features of both Abdoli’s and Maddah-Ali’s works. The two schemes jointly yield the best known sum Degrees-of-Freedom (DoF) performance so far. For the case M N ≥K, the achieved sum DoF is asymptotically given by 64 15N when K→∞
- …