多天线系统中的部分反馈多用户调度

A. Salim
{"title":"多天线系统中的部分反馈多用户调度","authors":"A. Salim","doi":"10.5220/0002966401570160","DOIUrl":null,"url":null,"abstract":"In this paper we consider the greedy scheduling algorithm that routes transmission of users' packets based on their reported CSI in the uplink channel to the user with the best instantaneous channel conditions. We propose a scheduling scheme that relies on reporting partial feedback of the CSI. We compare the proposed scheme to the one that uses perfect channel information at the base station, we will see that the proposed scheme has significantly less complexity at the expense of a loss in the system's capacity.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Partial feedback multi-user scheduling in multi-antenna systems\",\"authors\":\"A. Salim\",\"doi\":\"10.5220/0002966401570160\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the greedy scheduling algorithm that routes transmission of users' packets based on their reported CSI in the uplink channel to the user with the best instantaneous channel conditions. We propose a scheduling scheme that relies on reporting partial feedback of the CSI. We compare the proposed scheme to the one that uses perfect channel information at the base station, we will see that the proposed scheme has significantly less complexity at the expense of a loss in the system's capacity.\",\"PeriodicalId\":332730,\"journal\":{\"name\":\"2010 International Conference on Wireless Information Networks and Systems (WINSYS)\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Wireless Information Networks and Systems (WINSYS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5220/0002966401570160\",\"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 Wireless Information Networks and Systems (WINSYS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0002966401570160","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文考虑了一种贪婪调度算法,该算法根据用户在上行信道上的报告CSI,将数据包的传输路由到具有最佳瞬时信道条件的用户。我们提出了一种基于报告CSI部分反馈的调度方案。我们将所提出的方案与在基站中使用完美信道信息的方案进行比较,我们将看到,所提出的方案以系统容量损失为代价,显著降低了复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Partial feedback multi-user scheduling in multi-antenna systems
In this paper we consider the greedy scheduling algorithm that routes transmission of users' packets based on their reported CSI in the uplink channel to the user with the best instantaneous channel conditions. We propose a scheduling scheme that relies on reporting partial feedback of the CSI. We compare the proposed scheme to the one that uses perfect channel information at the base station, we will see that the proposed scheme has significantly less complexity at the expense of a loss in the system's capacity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信