By Topic

Degrees of Freedom of Interference Channels With CoMP Transmission and Reception

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
V. Sreekanth Annapureddy ; Coordinated Science Laboratory and the Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA ; Aly El Gamal ; Venugopal V. Veeravalli

We study the degrees of freedom (DoF) of the K -user interference channel with coordinated multipoint (CoMP) transmission and reception. Each message is jointly transmitted by M_{t} successive transmitters, and is jointly received by M_{r} successive receivers. We refer to this channel as the CoMP channel with a transmit cooperation order of M_{t} and receive cooperation order of M_{r} . Since the channel has a total of K transmit antennas and K receive antennas, the maximum possible DoF is equal to K . We show that the CoMP channel has K DoF if and only if M_{t} + M_{r} \geq K+1 . The key idea is that the zero forcing of the interference corresponding to the i{{\rm th}} message at the decoder of the j{{\rm th}} message, where j \ne i , can be viewed as a shared responsibility between the M_{t} transmitters carrying the i{{\rm th}} message, and the M_{r} receivers decoding the j{{\rm th}} message. For the general case, we derive an outer bound that states that the DoF is bounded above by \left \lceil (K+M_{t}+M_{r}-2)/2\right \rceil . For the special case with only CoMP transmission, i.e, M_{r} = 1 , we propose a scheme that can achieve (K+M_{t}-1)/2 DoF for all K < 10 , and conjecture that the result holds true for all K . In the proposed coding scheme, the M_{t} transmitters carrying each message are used to cancel the interference introduced by this message at the first M_{t}-1 receivers, thereby allowing each of these receivers to enjoy 1 DoF, and asymptotic interference alignment is used to align the interfering signals at each other receiver to occupy half the signal space. The achievability proofs are based on the notion of algebraic independence from algebraic geometry.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 9 )