干扰MISO信道的分布式预编码器优化

D. Schmidt, Andreas Gründinger, W. Utschick, M. Honig
{"title":"干扰MISO信道的分布式预编码器优化","authors":"D. Schmidt, Andreas Gründinger, W. Utschick, M. Honig","doi":"10.1109/WSA.2008.4475571","DOIUrl":null,"url":null,"abstract":"In this paper, we examine the problem of two multiple-input-single-output (MISO) links that interfere with each other. We discuss some straightforward strategies for the users to optimize their rates and show how a certain degree of cooperation between the users can lead to an improvement of both individual links. We propose an algorithm that is based on the users exchanging 'interference prices' and is realizable in a distributed manner. The algorithm converges towards a locally sum-rate optimal solution and exhibits nearly identical performance as a non-distributed gradient ascent algorithm, outperforming the straightforward strategies over the complete range of noise powers.","PeriodicalId":255495,"journal":{"name":"2008 International ITG Workshop on Smart Antennas","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Distributed precoder optimization for interfering MISO channels\",\"authors\":\"D. Schmidt, Andreas Gründinger, W. Utschick, M. Honig\",\"doi\":\"10.1109/WSA.2008.4475571\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we examine the problem of two multiple-input-single-output (MISO) links that interfere with each other. We discuss some straightforward strategies for the users to optimize their rates and show how a certain degree of cooperation between the users can lead to an improvement of both individual links. We propose an algorithm that is based on the users exchanging 'interference prices' and is realizable in a distributed manner. The algorithm converges towards a locally sum-rate optimal solution and exhibits nearly identical performance as a non-distributed gradient ascent algorithm, outperforming the straightforward strategies over the complete range of noise powers.\",\"PeriodicalId\":255495,\"journal\":{\"name\":\"2008 International ITG Workshop on Smart Antennas\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International ITG Workshop on Smart Antennas\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WSA.2008.4475571\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International ITG Workshop on Smart Antennas","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WSA.2008.4475571","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

在本文中,我们研究了两个多输入单输出(MISO)链路相互干扰的问题。我们讨论了一些简单的策略,为用户优化他们的比率,并展示了用户之间的一定程度的合作如何导致两个单独的链接的改进。我们提出了一种基于用户交换“干扰价格”的算法,并以分布式方式实现。该算法收敛于局部和速率最优解,并表现出与非分布梯度上升算法几乎相同的性能,在整个噪声功率范围内优于直接策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed precoder optimization for interfering MISO channels
In this paper, we examine the problem of two multiple-input-single-output (MISO) links that interfere with each other. We discuss some straightforward strategies for the users to optimize their rates and show how a certain degree of cooperation between the users can lead to an improvement of both individual links. We propose an algorithm that is based on the users exchanging 'interference prices' and is realizable in a distributed manner. The algorithm converges towards a locally sum-rate optimal solution and exhibits nearly identical performance as a non-distributed gradient ascent algorithm, outperforming the straightforward strategies over the complete range of noise powers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信