OFDMA与SCFDMA的上行调度比较

E. Yaacoub, Z. Dawy
{"title":"OFDMA与SCFDMA的上行调度比较","authors":"E. Yaacoub, Z. Dawy","doi":"10.1109/ICTEL.2010.5478799","DOIUrl":null,"url":null,"abstract":"Uplink scheduling is compared between OFDMA and SCFDMA systems. Two low complexity scheduling algorithms are presented. Both algorithms perform utility maximization scheduling, with the second having the property of ensuring that all subcarriers allocated to a single user are consecutive. Furthermore, the case of independent fading over the subcarriers of a single resource block is compared to the case of identical fading corresponding to full correlation between the subcarriers of a resource block. Simulation results related to these different cases are presented and analyzed.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A comparison of uplink scheduling in OFDMA and SCFDMA\",\"authors\":\"E. Yaacoub, Z. Dawy\",\"doi\":\"10.1109/ICTEL.2010.5478799\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Uplink scheduling is compared between OFDMA and SCFDMA systems. Two low complexity scheduling algorithms are presented. Both algorithms perform utility maximization scheduling, with the second having the property of ensuring that all subcarriers allocated to a single user are consecutive. Furthermore, the case of independent fading over the subcarriers of a single resource block is compared to the case of identical fading corresponding to full correlation between the subcarriers of a resource block. Simulation results related to these different cases are presented and analyzed.\",\"PeriodicalId\":208094,\"journal\":{\"name\":\"2010 17th International Conference on Telecommunications\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 17th International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTEL.2010.5478799\",\"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 17th International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTEL.2010.5478799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

对OFDMA和SCFDMA系统的上行调度进行了比较。提出了两种低复杂度调度算法。这两种算法都执行效用最大化调度,第二种算法具有确保分配给单个用户的所有子载波是连续的特性。此外,将单个资源块的子载波独立衰落的情况与对应于资源块的子载波之间完全相关的相同衰落的情况进行了比较。给出了不同情况下的仿真结果并进行了分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A comparison of uplink scheduling in OFDMA and SCFDMA
Uplink scheduling is compared between OFDMA and SCFDMA systems. Two low complexity scheduling algorithms are presented. Both algorithms perform utility maximization scheduling, with the second having the property of ensuring that all subcarriers allocated to a single user are consecutive. Furthermore, the case of independent fading over the subcarriers of a single resource block is compared to the case of identical fading corresponding to full correlation between the subcarriers of a resource block. Simulation results related to these different cases are presented and analyzed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信