On the complexity of leakage interference minimization for interference alignment

Ya Feng Liu, Yu Hong Dai, Zhi-Quan Luo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

For a general MIMO interference channel, we can determine the feasibility of linear interference alignment via minimizing the leakage interference. This paper gives a complete complexity characterization of the leakage interference minimization problem. It is shown that, when each transmitter (receiver) is equipped with at least three antennas and each receiver (transmitter) is equipped with at least two antennas, the problem of checking whether the interference in the network can be perfectly aligned is strongly NP-hard. Moreover, when each transmit/receive node is equipped with two or more antennas, leakage interference minimization can not be solved (even approximately) in polynomial time, unless P = NP.

Original languageEnglish (US)
Title of host publication2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2011
Pages471-475
Number of pages5
DOIs
StatePublished - Sep 16 2011
Event2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2011 - San Francisco, CA, United States
Duration: Jun 26 2011Jun 29 2011

Publication series

NameIEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC

Other

Other2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2011
Country/TerritoryUnited States
CitySan Francisco, CA
Period6/26/116/29/11

Keywords

  • Complexity analysis
  • interference alignment
  • leakage interference minimization

Fingerprint

Dive into the research topics of 'On the complexity of leakage interference minimization for interference alignment'. Together they form a unique fingerprint.

Cite this