OFDMA Downlink Resource Allocation for Ergodic Capacity Maximization with Imperfect Channel Knowledge

I. Wong, B. Evans
{"title":"OFDMA Downlink Resource Allocation for Ergodic Capacity Maximization with Imperfect Channel Knowledge","authors":"I. Wong, B. Evans","doi":"10.1109/GLOCOM.2007.708","DOIUrl":null,"url":null,"abstract":"In this paper, we derive an optimal resource allocation algorithm for ergodic weighted-sum capacity maximization in OFDMA systems assuming the availability of only partial (imperfect) CSI. Using a dual optimization framework, we show that the optimal power allocation is multi-level waterfilling based on the conditional expected value of the channel-to-noise ratio, and the optimal user is selected based on the maximum weighted conditional expected capacity penalized by the required power. The algorithm is shown to have O(MK) complexity for an OFDMA system with K used subcarriers and M active users, and achieves relative duality gaps of less than 10-5 (99.99999% optimal).","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"157 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2007.708","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

In this paper, we derive an optimal resource allocation algorithm for ergodic weighted-sum capacity maximization in OFDMA systems assuming the availability of only partial (imperfect) CSI. Using a dual optimization framework, we show that the optimal power allocation is multi-level waterfilling based on the conditional expected value of the channel-to-noise ratio, and the optimal user is selected based on the maximum weighted conditional expected capacity penalized by the required power. The algorithm is shown to have O(MK) complexity for an OFDMA system with K used subcarriers and M active users, and achieves relative duality gaps of less than 10-5 (99.99999% optimal).
不完全信道知识下的遍历容量最大化OFDMA下行资源分配
在本文中,我们推导了OFDMA系统中,假设只有部分(不完全)CSI可用性的遍历加权和容量最大化的最优资源分配算法。利用二元优化框架,研究了基于信道噪声比条件期望值的多级注水分配方案,以及基于最大加权条件期望容量对所需功率的惩罚来选择最优用户。结果表明,对于具有K个使用子载波和M个活跃用户的OFDMA系统,该算法的复杂度为0 (MK),相对对偶性差小于10-5(99.99999%最优)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信