{"title":"A novel QoS-guaranteed proportional fairness with joint space-time-frequency scheduling","authors":"Weijie Huang, Rong-fang Song","doi":"10.1109/APCC.2009.5375670","DOIUrl":null,"url":null,"abstract":"For the downlink of MIMO-OFDM system, a novel proportional fairness with joint space-time-frequency scheduling is proposed in this paper. On one hand, by space-time-frequency scheduling one can gain multiuser spatial multiplexing on the same subcarrier in one timeslot. On the other hand, with modified traditional proportional fairness, the system can provide QoS guarantee for various service types. The combination of space-time-frequency scheduling and novel proportional fairness makes the system perform well in respect of QoS provision without sacrificing much throughput.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 15th Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2009.5375670","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
For the downlink of MIMO-OFDM system, a novel proportional fairness with joint space-time-frequency scheduling is proposed in this paper. On one hand, by space-time-frequency scheduling one can gain multiuser spatial multiplexing on the same subcarrier in one timeslot. On the other hand, with modified traditional proportional fairness, the system can provide QoS guarantee for various service types. The combination of space-time-frequency scheduling and novel proportional fairness makes the system perform well in respect of QoS provision without sacrificing much throughput.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
