Optimal Decentralized Linear Precoding for Wideband Non-Cooperative Interference Systems based on Game Theory

G. Scutari, D. Palomar, S. Barbarossa
{"title":"Optimal Decentralized Linear Precoding for Wideband Non-Cooperative Interference Systems based on Game Theory","authors":"G. Scutari, D. Palomar, S. Barbarossa","doi":"10.1109/CAMSAP.2007.4497971","DOIUrl":null,"url":null,"abstract":"In this paper we formulate the problem of finding the optimal pre- coding/multiplexing strategy in an infrastructureless multiuser scenario as a noncooperative game. We first consider the theoretical problem of maximizing mutual information on each link, given constraints on the spectral mask and transmit power. Then, to accommodate practical implementation aspects, we focus on the competitive maximization of the transmission rate on each link, using finite order constellations, under the same constraints as above plus a constraint on the average error probability. We prove that in both cases a NE always exists and the optimal precoding/multiplexing strategy leads to a (pure strategy) diagonal transmission for all the users. Thanks to this result, we can reduce both original complicated matrix-valued games to a simpler unified vector power control game. Thus, we derive sufficient conditions for the uniqueness of the NE of such a game, that are proved to have a broader validity than conditions known in the literature for special cases of our game. Finally, we show that the Nash equilibria of the vector game can be reached using the so-called asynchronous iterative waterfilling algorithm.","PeriodicalId":220687,"journal":{"name":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMSAP.2007.4497971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper we formulate the problem of finding the optimal pre- coding/multiplexing strategy in an infrastructureless multiuser scenario as a noncooperative game. We first consider the theoretical problem of maximizing mutual information on each link, given constraints on the spectral mask and transmit power. Then, to accommodate practical implementation aspects, we focus on the competitive maximization of the transmission rate on each link, using finite order constellations, under the same constraints as above plus a constraint on the average error probability. We prove that in both cases a NE always exists and the optimal precoding/multiplexing strategy leads to a (pure strategy) diagonal transmission for all the users. Thanks to this result, we can reduce both original complicated matrix-valued games to a simpler unified vector power control game. Thus, we derive sufficient conditions for the uniqueness of the NE of such a game, that are proved to have a broader validity than conditions known in the literature for special cases of our game. Finally, we show that the Nash equilibria of the vector game can be reached using the so-called asynchronous iterative waterfilling algorithm.
基于博弈论的宽带非合作干扰系统的最优分散线性预编码
本文将无基础设施多用户场景下的最优预编码/多路复用策略问题表述为非合作博弈。我们首先考虑在给定频谱掩模和发射功率约束下,各链路互信息最大化的理论问题。然后,为了适应实际实现方面,我们在与上述相同的约束条件下加上对平均误差概率的约束,使用有限阶星座,关注每个链路上传输速率的竞争最大化。我们证明了在这两种情况下,网元总是存在的,并且最优预编码/复用策略导致所有用户的(纯策略)对角传输。由于这个结果,我们可以将原来复杂的矩阵值博弈简化为一个更简单的统一的矢量功率控制博弈。因此,我们推导出了这种博弈的NE的唯一性的充分条件,这些条件被证明比我们的博弈的特殊情况的文献中已知的条件具有更广泛的有效性。最后,我们证明了使用所谓的异步迭代注水算法可以达到向量博弈的纳什均衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信