{"title":"多用户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":"{\"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}","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}
Fair power allocation for sum-rate maximization in multiuser OFDMA
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.