OFDMA系统的资源分配

C. Turgu, C. Toker
{"title":"OFDMA系统的资源分配","authors":"C. Turgu, C. Toker","doi":"10.1109/SIU.2009.5136458","DOIUrl":null,"url":null,"abstract":"In an OFDMA (Orthogonal Frequency Division Multiple Access) scenario in which the users of a multiuser system share the common channel simulataneously, the issue of allocating the shared channel resources (subcarrier and power) among the users is called the resource allocation problem. This problem, which is nonlinear due to its nature, also has a discrete structure. In this paper, a fast algorithm based on linear programming is proposed. The algorithm is composed of two phases. In the first one, the original integer programming problem is first linearized and then after relaxing the integer constraints a solution is obtained by the aid of the Simplex Algorithm. In the second phase, by exploiting the sub-carrier allocation obtained in first phase, bits are allocated to each user independently using the Greedy Algorithm. The simulation results have demonstrated that, the proposed algorithm can achieve a performance very close to that of the integer programming techniques while being significantly faster.","PeriodicalId":219938,"journal":{"name":"2009 IEEE 17th Signal Processing and Communications Applications Conference","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resource allocation for OFDMA systems\",\"authors\":\"C. Turgu, C. Toker\",\"doi\":\"10.1109/SIU.2009.5136458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In an OFDMA (Orthogonal Frequency Division Multiple Access) scenario in which the users of a multiuser system share the common channel simulataneously, the issue of allocating the shared channel resources (subcarrier and power) among the users is called the resource allocation problem. This problem, which is nonlinear due to its nature, also has a discrete structure. In this paper, a fast algorithm based on linear programming is proposed. The algorithm is composed of two phases. In the first one, the original integer programming problem is first linearized and then after relaxing the integer constraints a solution is obtained by the aid of the Simplex Algorithm. In the second phase, by exploiting the sub-carrier allocation obtained in first phase, bits are allocated to each user independently using the Greedy Algorithm. The simulation results have demonstrated that, the proposed algorithm can achieve a performance very close to that of the integer programming techniques while being significantly faster.\",\"PeriodicalId\":219938,\"journal\":{\"name\":\"2009 IEEE 17th Signal Processing and Communications Applications Conference\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE 17th Signal Processing and Communications Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIU.2009.5136458\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE 17th Signal Processing and Communications Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2009.5136458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在多用户系统用户同时共享公共信道的OFDMA (Orthogonal Frequency Division Multiple Access)场景中,在用户之间分配共享信道资源(子载波和功率)的问题称为资源分配问题。这个问题本质上是非线性的,同时也具有离散结构。本文提出了一种基于线性规划的快速算法。该算法分为两个阶段。首先对原整数规划问题进行线性化处理,然后放宽整数约束,利用单纯形算法求解。在第二阶段,利用第一阶段获得的子载波分配,使用贪婪算法将比特独立分配给每个用户。仿真结果表明,该算法可以达到与整数规划技术非常接近的性能,同时速度明显加快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resource allocation for OFDMA systems
In an OFDMA (Orthogonal Frequency Division Multiple Access) scenario in which the users of a multiuser system share the common channel simulataneously, the issue of allocating the shared channel resources (subcarrier and power) among the users is called the resource allocation problem. This problem, which is nonlinear due to its nature, also has a discrete structure. In this paper, a fast algorithm based on linear programming is proposed. The algorithm is composed of two phases. In the first one, the original integer programming problem is first linearized and then after relaxing the integer constraints a solution is obtained by the aid of the Simplex Algorithm. In the second phase, by exploiting the sub-carrier allocation obtained in first phase, bits are allocated to each user independently using the Greedy Algorithm. The simulation results have demonstrated that, the proposed algorithm can achieve a performance very close to that of the integer programming techniques while being significantly faster.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信