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}
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.