基于极坐标公式的低复杂度动态谱管理

R. Moraes, Paschalis Tsiaflakis, M. Moonen
{"title":"基于极坐标公式的低复杂度动态谱管理","authors":"R. Moraes, Paschalis Tsiaflakis, M. Moonen","doi":"10.1109/ICC.2013.6655183","DOIUrl":null,"url":null,"abstract":"This paper deals with the problem of power allocation in a multi-user, multicarrier communication system. This problem arises, for example, in wireless OFDM or digital subscriber line networks. Users transmitting concurrently on the same sub-carriers cause interference to each other, and this interference is a serious limitation for system performance. We consider the problem of maximizing the weighted sum of users' data rates. The optimization variables are vectors containing the powers for all users on each tone. The problem is intrinsically difficult due to the non-concavity of the utility function. We propose to change the (cartesian) power vector by its polar coordinates vector equivalent. The main contribution of this paper is to show that at least for one dimension of the polar coordinates vector, the radius, the problem is concave and thus easy to solve. We develop an algorithm based in such a polar coordinates formulation to exploit such concavity. It is demonstrated that the algorithm we propose saves considerably on computational cost compared to previous algorithms.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"68 1","pages":"3991-3995"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Reduced complexity dynamic spectrum management based on a polar coordinates formulation\",\"authors\":\"R. Moraes, Paschalis Tsiaflakis, M. Moonen\",\"doi\":\"10.1109/ICC.2013.6655183\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with the problem of power allocation in a multi-user, multicarrier communication system. This problem arises, for example, in wireless OFDM or digital subscriber line networks. Users transmitting concurrently on the same sub-carriers cause interference to each other, and this interference is a serious limitation for system performance. We consider the problem of maximizing the weighted sum of users' data rates. The optimization variables are vectors containing the powers for all users on each tone. The problem is intrinsically difficult due to the non-concavity of the utility function. We propose to change the (cartesian) power vector by its polar coordinates vector equivalent. The main contribution of this paper is to show that at least for one dimension of the polar coordinates vector, the radius, the problem is concave and thus easy to solve. We develop an algorithm based in such a polar coordinates formulation to exploit such concavity. It is demonstrated that the algorithm we propose saves considerably on computational cost compared to previous algorithms.\",\"PeriodicalId\":6368,\"journal\":{\"name\":\"2013 IEEE International Conference on Communications (ICC)\",\"volume\":\"68 1\",\"pages\":\"3991-3995\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2013.6655183\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2013.6655183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文研究了多用户、多载波通信系统中的功率分配问题。例如,在无线OFDM或数字用户线路网络中就会出现这个问题。在同一子载波上并发传输的用户之间会产生相互干扰,严重限制了系统的性能。我们考虑用户数据速率加权和的最大化问题。优化变量是包含每个音调上所有用户的功率的向量。由于效用函数的非凹性,这个问题本质上是困难的。我们建议用它的极坐标向量等价来改变(笛卡尔)功率向量。本文的主要贡献是证明了至少对于极坐标矢量的一个维度,即半径,问题是凹的,因此易于求解。我们开发了一种基于这种极坐标公式的算法来利用这种凹性。实验结果表明,本文提出的算法与以往的算法相比,大大节省了计算成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reduced complexity dynamic spectrum management based on a polar coordinates formulation
This paper deals with the problem of power allocation in a multi-user, multicarrier communication system. This problem arises, for example, in wireless OFDM or digital subscriber line networks. Users transmitting concurrently on the same sub-carriers cause interference to each other, and this interference is a serious limitation for system performance. We consider the problem of maximizing the weighted sum of users' data rates. The optimization variables are vectors containing the powers for all users on each tone. The problem is intrinsically difficult due to the non-concavity of the utility function. We propose to change the (cartesian) power vector by its polar coordinates vector equivalent. The main contribution of this paper is to show that at least for one dimension of the polar coordinates vector, the radius, the problem is concave and thus easy to solve. We develop an algorithm based in such a polar coordinates formulation to exploit such concavity. It is demonstrated that the algorithm we propose saves considerably on computational cost compared to previous algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Signature identification techniques with Zadoff-Chu sequence for OFDM systems Double-talk detection using the singular value decomposition for acoustic echo cancellation Dynamic virtual machine allocation in cloud server facility systems with renewable energy sources Approximate channel block diagonalization for open-loop Multiuser MIMO communications A location-based self-optimizing algorithm for the inter-RAT handover parameters
×
引用
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