{"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)场景中,在用户之间分配共享信道资源(子载波和功率)的问题称为资源分配问题。这个问题本质上是非线性的,同时也具有离散结构。本文提出了一种基于线性规划的快速算法。该算法分为两个阶段。首先对原整数规划问题进行线性化处理,然后放宽整数约束,利用单纯形算法求解。在第二阶段,利用第一阶段获得的子载波分配,使用贪婪算法将比特独立分配给每个用户。仿真结果表明,该算法可以达到与整数规划技术非常接近的性能,同时速度明显加快。
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.