MISO干扰信道分布式异步优化的统一观点

Stefan Wesemann, W. Rave, G. Fettweis
{"title":"MISO干扰信道分布式异步优化的统一观点","authors":"Stefan Wesemann, W. Rave, G. Fettweis","doi":"10.1109/SPAWC.2014.6941496","DOIUrl":null,"url":null,"abstract":"We adopt the power gain description of wireless networks in order to provide conceptual insights on existing distributed asynchronous beamforming algorithms. From this common viewpoint, we compare the asynchronous distributed pricing (ADP) algorithm and the asynchronous scaled gradient projection (SGP) algorithm in terms of local subproblems, required information exchange and convergence behavior. We illustrate the underlying mechanisms that ensure the convergence to a stationary point of a sum utility function (i.e., complementary user actions, step size bounds), and we point out the algorithms' pros and limitations.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"7 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Unifying viewpoints on distributed asynchronous optimization for MISO interference channels\",\"authors\":\"Stefan Wesemann, W. Rave, G. Fettweis\",\"doi\":\"10.1109/SPAWC.2014.6941496\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We adopt the power gain description of wireless networks in order to provide conceptual insights on existing distributed asynchronous beamforming algorithms. From this common viewpoint, we compare the asynchronous distributed pricing (ADP) algorithm and the asynchronous scaled gradient projection (SGP) algorithm in terms of local subproblems, required information exchange and convergence behavior. We illustrate the underlying mechanisms that ensure the convergence to a stationary point of a sum utility function (i.e., complementary user actions, step size bounds), and we point out the algorithms' pros and limitations.\",\"PeriodicalId\":420837,\"journal\":{\"name\":\"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"volume\":\"7 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2014.6941496\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2014.6941496","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们采用无线网络的功率增益描述,以便对现有的分布式异步波束形成算法提供概念性的见解。从这个共同的观点出发,我们比较了异步分布式定价(ADP)算法和异步缩放梯度投影(SGP)算法在局部子问题、所需信息交换和收敛行为方面的差异。我们说明了确保收敛到和效用函数的平稳点的潜在机制(即,互补用户操作,步长界限),并指出了算法的优点和局限性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Unifying viewpoints on distributed asynchronous optimization for MISO interference channels
We adopt the power gain description of wireless networks in order to provide conceptual insights on existing distributed asynchronous beamforming algorithms. From this common viewpoint, we compare the asynchronous distributed pricing (ADP) algorithm and the asynchronous scaled gradient projection (SGP) algorithm in terms of local subproblems, required information exchange and convergence behavior. We illustrate the underlying mechanisms that ensure the convergence to a stationary point of a sum utility function (i.e., complementary user actions, step size bounds), and we point out the algorithms' pros and limitations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Unifying viewpoints on distributed asynchronous optimization for MISO interference channels Sparse channel estimation including the impact of the transceiver filters with application to OFDM Towards a principled approach to designing distributed MAC protocols Information rates employing 1-bit quantization and oversampling at the receiver Suppression of pilot-contamination in massive MIMO systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1