不完全CSI下OFDMA下行系统的最优资源分配

Rohit Aggarwal, M. Assaad, C. E. Koksal, Philip Schniter
{"title":"不完全CSI下OFDMA下行系统的最优资源分配","authors":"Rohit Aggarwal, M. Assaad, C. E. Koksal, Philip Schniter","doi":"10.1109/SPAWC.2011.5990409","DOIUrl":null,"url":null,"abstract":"In this paper, we address the problem of joint scheduling and resource allocation in the downlink of an orthogonal frequency division multiple access (OFDMA)-based wireless network when the per-user SNR is known only in distribution. In particular, we consider sum-utility maximization over user schedules, powers, and code rates, subject to an instantaneous sum-power constraint. We consider both a “continuous” scenario where, during a time-slot, each OFDMA subchannel can be time-shared among multiple users and/or code rates, and a “discrete” scenario where no time-sharing is allowed. For the non-convex optimization problem arising in the continuous case, we propose an efficient exact solution. For the mixed-integer optimization problem arising in the discrete case, we propose a polynomial-complexity approximate solution and derive a bound on its optimality gap. We also provide a numerical study of goodput maximization for the SNR distribution that results from the use of pilot-aided MMSE channel estimation.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal resource allocation in OFDMA downlink systems with imperfect CSI\",\"authors\":\"Rohit Aggarwal, M. Assaad, C. E. Koksal, Philip Schniter\",\"doi\":\"10.1109/SPAWC.2011.5990409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the problem of joint scheduling and resource allocation in the downlink of an orthogonal frequency division multiple access (OFDMA)-based wireless network when the per-user SNR is known only in distribution. In particular, we consider sum-utility maximization over user schedules, powers, and code rates, subject to an instantaneous sum-power constraint. We consider both a “continuous” scenario where, during a time-slot, each OFDMA subchannel can be time-shared among multiple users and/or code rates, and a “discrete” scenario where no time-sharing is allowed. For the non-convex optimization problem arising in the continuous case, we propose an efficient exact solution. For the mixed-integer optimization problem arising in the discrete case, we propose a polynomial-complexity approximate solution and derive a bound on its optimality gap. We also provide a numerical study of goodput maximization for the SNR distribution that results from the use of pilot-aided MMSE channel estimation.\",\"PeriodicalId\":102244,\"journal\":{\"name\":\"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2011.5990409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2011.5990409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了当每用户信噪比仅在分布中已知时,基于正交频分多址(OFDMA)的无线网络下行链路中的联合调度和资源分配问题。特别地,我们考虑了受瞬时和功率约束的用户调度、功率和代码率的和效用最大化。我们既考虑了一个“连续”场景,在一个时隙中,每个OFDMA子信道可以在多个用户和/或码率之间分时共享,也考虑了一个“离散”场景,不允许分时共享。对于连续情况下的非凸优化问题,我们给出了一个有效的精确解。对于离散情况下的混合整数优化问题,提出了一个多项式复杂度的近似解,并给出了其最优性差的一个界。我们还对使用导频辅助MMSE信道估计所产生的信噪比分布的goodput最大化进行了数值研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal resource allocation in OFDMA downlink systems with imperfect CSI
In this paper, we address the problem of joint scheduling and resource allocation in the downlink of an orthogonal frequency division multiple access (OFDMA)-based wireless network when the per-user SNR is known only in distribution. In particular, we consider sum-utility maximization over user schedules, powers, and code rates, subject to an instantaneous sum-power constraint. We consider both a “continuous” scenario where, during a time-slot, each OFDMA subchannel can be time-shared among multiple users and/or code rates, and a “discrete” scenario where no time-sharing is allowed. For the non-convex optimization problem arising in the continuous case, we propose an efficient exact solution. For the mixed-integer optimization problem arising in the discrete case, we propose a polynomial-complexity approximate solution and derive a bound on its optimality gap. We also provide a numerical study of goodput maximization for the SNR distribution that results from the use of pilot-aided MMSE channel estimation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信