{"title":"基于迭代多用户检测的SC-FDMA比例公平调度算法","authors":"H. Lim, Tae-Kyoung Kim, G. Im","doi":"10.1109/ICTC.2010.5674669","DOIUrl":null,"url":null,"abstract":"Single-carrier frequency division multiple access (SC-FDMA) with iterative multiuser detection, called grouped FDMA (GFDMA), allows several users to share a common set of subcarriers. In order to improve user fairness and guarantee quality-of-service (QoS) of users who share subcarrier sets, we propose a proportional fair (PF) scheduling algorithm satisfying QoS constraints. For each user selection of a subcarrier set, the scheduler considers average data rates and multiuser interference of users. Simulation results show that the proposed PF scheduling algorithm not only increases the spectral efficiency of GFDMA but also provides long-term fairness to users.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A proportional fair scheduling algorithm for SC-FDMA with iterative multiuser detection\",\"authors\":\"H. Lim, Tae-Kyoung Kim, G. Im\",\"doi\":\"10.1109/ICTC.2010.5674669\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Single-carrier frequency division multiple access (SC-FDMA) with iterative multiuser detection, called grouped FDMA (GFDMA), allows several users to share a common set of subcarriers. In order to improve user fairness and guarantee quality-of-service (QoS) of users who share subcarrier sets, we propose a proportional fair (PF) scheduling algorithm satisfying QoS constraints. For each user selection of a subcarrier set, the scheduler considers average data rates and multiuser interference of users. Simulation results show that the proposed PF scheduling algorithm not only increases the spectral efficiency of GFDMA but also provides long-term fairness to users.\",\"PeriodicalId\":149198,\"journal\":{\"name\":\"2010 International Conference on Information and Communication Technology Convergence (ICTC)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Information and Communication Technology Convergence (ICTC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTC.2010.5674669\",\"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 Conference on Information and Communication Technology Convergence (ICTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC.2010.5674669","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A proportional fair scheduling algorithm for SC-FDMA with iterative multiuser detection
Single-carrier frequency division multiple access (SC-FDMA) with iterative multiuser detection, called grouped FDMA (GFDMA), allows several users to share a common set of subcarriers. In order to improve user fairness and guarantee quality-of-service (QoS) of users who share subcarrier sets, we propose a proportional fair (PF) scheduling algorithm satisfying QoS constraints. For each user selection of a subcarrier set, the scheduler considers average data rates and multiuser interference of users. Simulation results show that the proposed PF scheduling algorithm not only increases the spectral efficiency of GFDMA but also provides long-term fairness to users.