On the complexity of leakage interference minimization for interference alignment

Ya-Feng Liu, Yu-Hong Dai, Z. Luo
{"title":"On the complexity of leakage interference minimization for interference alignment","authors":"Ya-Feng Liu, Yu-Hong Dai, Z. Luo","doi":"10.1109/SPAWC.2011.5990455","DOIUrl":null,"url":null,"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.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2011.5990455","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

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.
干涉对准中泄漏干扰最小化的复杂性
对于一般的MIMO干扰通道,我们可以通过最小化泄漏干扰来确定线性干扰对准的可行性。本文给出了泄漏干扰最小化问题的完全复杂性表征。结果表明,当每个发射(接收)端至少配置三根天线,每个接收(发射)端至少配置两根天线时,检查网络中干扰是否能够完全对准的问题是强NP-hard问题。而且,当每个发射/接收节点都有两个或多个天线时,泄漏干扰最小化问题无法在多项式时间内解决(甚至近似解决),除非P = NP。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信