Settling the feasibility of interference alignment for the MIMO interference channel: the symmetric square case
Bresler, Guy ; Cartwright, Dustin ; Tse, David
arXiv, 1104.0888 / Harvested from arXiv
Text on arXiv
Determining the feasibility conditions for vector space interference alignment in the K-user MIMO interference channel with constant channel coefficients has attracted much recent attention yet remains unsolved. The main result of this paper is restricted to the symmetric square case where all transmitters and receivers have N antennas, and each user desires d transmit dimensions. We prove that alignment is possible if and only if the number of antennas satisfies N>= d(K+1)/2. We also show a necessary condition for feasibility of alignment with arbitrary system parameters. An algebraic geometry approach is central to the results.
Publié le : 2011-04-05
Classification:  Computer Science - Information Theory 
@article{1104.0888,
     author = {Bresler, Guy and Cartwright, Dustin and Tse, David},
     title = {Settling the feasibility of interference alignment for the MIMO
  interference channel: the symmetric square case},
     journal = {arXiv},
     volume = {2011},
     number = {0},
     year = {2011},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1104.0888}
}

Bresler, Guy; Cartwright, Dustin; Tse, David. Settling the feasibility of interference alignment for the MIMO
  interference channel: the symmetric square case. arXiv, Tome 2011 (2011) no. 0, . http://gdmltest.u-ga.fr/item/1104.0888/