Academic
Publications
On the complexity of leakage interference minimization for interference alignment

On the complexity of leakage interference minimization for interference alignment,10.1109/SPAWC.2011.5990455,Ya-Feng Liu,Yu-Hong Dai,Zhi-Quan Luo

On the complexity of leakage interference minimization for interference alignment   (Citations: 1)
BibTex | RIS | RefWorks Download
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 anten- nas, leakage interference minimization can not be solved (even approximately) in polynomial time, unless P = NP.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: