Cooperative beamforming for the MISO interference channel

J. Lindblom, E. Karipidis
{"title":"Cooperative beamforming for the MISO interference channel","authors":"J. Lindblom, E. Karipidis","doi":"10.1109/EW.2010.5483473","DOIUrl":null,"url":null,"abstract":"A distributed beamforming algorithm is proposed for the two-user multiple-input single-output (MISO) interference channel (IFC). The algorithm is iterative and uses as bargaining value the interference that each transmitter generates towards the receiver of the other user. It enables cooperation among the transmitters in order to increase both users' rates by lowering the overall interference. In every iteration, as long as both rates keep on increasing, the transmitters mutually decrease the generated interference. They choose their beamforming vectors distributively, solving the constrained optimization problem of maximizing the useful signal power for a given level of generated interference. The algorithm is equally applicable when the transmitters have either instantaneous or statistical channel state information (CSI). The difference is that the core optimization problem is solved in closed-form for instantaneous CSI, whereas for statistical CSI an efficient solution is found numerically via semidefinite programming. The outcome of the proposed algorithm is approximately Pareto-optimal. Extensive numerical illustrations are provided, comparing the proposed solution to the Nash equilibrium, zero-forcing, Nash bargaining, and maximum sum-rate operating points.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 European Wireless Conference (EW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EW.2010.5483473","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

Abstract

A distributed beamforming algorithm is proposed for the two-user multiple-input single-output (MISO) interference channel (IFC). The algorithm is iterative and uses as bargaining value the interference that each transmitter generates towards the receiver of the other user. It enables cooperation among the transmitters in order to increase both users' rates by lowering the overall interference. In every iteration, as long as both rates keep on increasing, the transmitters mutually decrease the generated interference. They choose their beamforming vectors distributively, solving the constrained optimization problem of maximizing the useful signal power for a given level of generated interference. The algorithm is equally applicable when the transmitters have either instantaneous or statistical channel state information (CSI). The difference is that the core optimization problem is solved in closed-form for instantaneous CSI, whereas for statistical CSI an efficient solution is found numerically via semidefinite programming. The outcome of the proposed algorithm is approximately Pareto-optimal. Extensive numerical illustrations are provided, comparing the proposed solution to the Nash equilibrium, zero-forcing, Nash bargaining, and maximum sum-rate operating points.
MISO干扰信道的协同波束形成
针对双用户多输入单输出干扰信道(IFC),提出了一种分布式波束形成算法。该算法是迭代的,并使用每个发射器对其他用户的接收器产生的干扰作为讨价还价值。它使发射机之间的合作能够通过降低总体干扰来提高两个用户的速率。在每一次迭代中,只要两种速率都持续增加,发射机相互减少产生的干扰。他们分布式地选择波束形成矢量,解决了给定干扰水平下有效信号功率最大化的约束优化问题。该算法同样适用于发射器具有瞬时或统计信道状态信息(CSI)的情况。不同之处在于,对于瞬时CSI,核心优化问题以封闭形式解决,而对于统计CSI,则通过半定规划在数值上找到有效的解决方案。该算法的结果近似为帕累托最优。提供了大量的数值实例,比较了所提出的解决方案的纳什均衡,零强迫,纳什议价,和最大和利率操作点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信