Fair power allocation for sum-rate maximization in multiuser OFDMA

Hussein Al-Shatri, T. Weber
{"title":"Fair power allocation for sum-rate maximization in multiuser OFDMA","authors":"Hussein Al-Shatri, T. Weber","doi":"10.1109/WSA.2010.5456425","DOIUrl":null,"url":null,"abstract":"Multiuser OFDMA is a promising multiaccess technique for serving users with many non-interfering resources. In the present paper, the problem of the optimum power allocation for maximizing the sum rate with total fairness and total power constraints is tackled. If the sum rate would be a priori known, it could be simply distributed uniformly among the users. Then for each user, the minimum required power for obtaining the given rate can be easily found in a closed form using convex optimization techniques. The bisection method can be applied for finding the maximum sum rate that satisfies the total power constraint. The performance of the proposed method is investigated by simulations. The results show that there is an absolute loss in the sum rate independent of the number of resources per user as compared to waterfilling. Additionally, it is shown that our method is significantly better than waterfilling in typical scenarios in terms of the outage capacity.","PeriodicalId":311394,"journal":{"name":"2010 International ITG Workshop on Smart Antennas (WSA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International ITG Workshop on Smart Antennas (WSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WSA.2010.5456425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Multiuser OFDMA is a promising multiaccess technique for serving users with many non-interfering resources. In the present paper, the problem of the optimum power allocation for maximizing the sum rate with total fairness and total power constraints is tackled. If the sum rate would be a priori known, it could be simply distributed uniformly among the users. Then for each user, the minimum required power for obtaining the given rate can be easily found in a closed form using convex optimization techniques. The bisection method can be applied for finding the maximum sum rate that satisfies the total power constraint. The performance of the proposed method is investigated by simulations. The results show that there is an absolute loss in the sum rate independent of the number of resources per user as compared to waterfilling. Additionally, it is shown that our method is significantly better than waterfilling in typical scenarios in terms of the outage capacity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多用户OFDMA中实现和速率最大化的公平功率分配
多用户OFDMA是一种很有前途的多址技术,可以为用户提供多种互不干扰的资源。本文研究了在全公平和全功率约束条件下,以总速率最大化为目标的最优功率分配问题。如果总和率是先验已知的,那么它可以简单地均匀分布在用户之间。然后,对于每个用户,使用凸优化技术可以很容易地以封闭形式找到获得给定速率所需的最小功率。二分法可用于求满足总功率约束的最大和速率。通过仿真验证了该方法的性能。结果表明,与充水相比,与每个用户的资源数量无关的总和速率存在绝对损失。此外,在典型情况下,我们的方法在停电能力方面明显优于充水。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
High-efficiency super-gain antenna arrays Order-recursive precoding for cooperative multi-point transmission Frequency prediction of the channel transfer function in multiple antenna systems Optimal MISO UWB pre-equalizer design with spectral mask constraints Synchronization aspects while using reciprocity for precoding in MIMO-OFDM
×
引用
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