{"title":"Uplink resource allocation algorithms for Single-Carrier FDMA systems","authors":"Fatma Sokmen, Tolga Girici","doi":"10.1109/EW.2010.5483441","DOIUrl":null,"url":null,"abstract":"We have focused on SC-FDMA based resource allocation in uplink cellular systems. Subchannel and power allocation constraints specific to SC-FDMA are considered. We considered a binary integer programming-based solution recently proposed for weighted sum rate maximization and extended it to different problems. We considered problems such as rate constraint satisfaction with minimum number subchannels and sum-power minimization subject to rate constraints. Besides stating the binary integer programming formulations for these problems, we propose simpler greedy algorithms for the three problems. Numerical evaluations show that the greedy algorithms perform very close to the optimal solution, with much less computation time.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 European Wireless Conference (EW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EW.2010.5483441","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39
Abstract
We have focused on SC-FDMA based resource allocation in uplink cellular systems. Subchannel and power allocation constraints specific to SC-FDMA are considered. We considered a binary integer programming-based solution recently proposed for weighted sum rate maximization and extended it to different problems. We considered problems such as rate constraint satisfaction with minimum number subchannels and sum-power minimization subject to rate constraints. Besides stating the binary integer programming formulations for these problems, we propose simpler greedy algorithms for the three problems. Numerical evaluations show that the greedy algorithms perform very close to the optimal solution, with much less computation time.