具有有限速率反馈的机会多天线下行传输

A. Tajer, Xiaodong Wang
{"title":"具有有限速率反馈的机会多天线下行传输","authors":"A. Tajer, Xiaodong Wang","doi":"10.1109/ALLERTON.2008.4797539","DOIUrl":null,"url":null,"abstract":"Multiple-antenna downlink transmission offers significant capacity improvement when the transmit-side channel state information (CSI) is available. The sum-rate capacity with infinite-rate feedback (full or partial CSI) scales linearly with the number of transmit antennas (multiplexing gain) and double logarithmically with the number of users (multiuser diversity gain). In this paper we present a new scheduling scheme which requires only finite-rate feedback and yet retains the optimal multiplexing and multiuser diversity gains achievable by dirty-paper coding and show that its sum-rate throughput scales like Nt log log KNr where Nt and Nr are the number of transmit and receive antennas and K is the number of users. While our scheduling schemes is asymptotically optimal, it also exhibits a good performance for practical network sizes. We also show that by appropriate design of the feedback mechanism, we can refrain the aggregate amount of feedback from increasing with the number of users and for asymptotically large networks the total number of feedback bits is bounded by Nt log Nt. We also demonstrate that despite having an opportunistic user selection, fairness among the users is maintained and all are equality likely to be scheduled.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Opportunistic multi-antenna downlink transmission with finite-rate feedback\",\"authors\":\"A. Tajer, Xiaodong Wang\",\"doi\":\"10.1109/ALLERTON.2008.4797539\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple-antenna downlink transmission offers significant capacity improvement when the transmit-side channel state information (CSI) is available. The sum-rate capacity with infinite-rate feedback (full or partial CSI) scales linearly with the number of transmit antennas (multiplexing gain) and double logarithmically with the number of users (multiuser diversity gain). In this paper we present a new scheduling scheme which requires only finite-rate feedback and yet retains the optimal multiplexing and multiuser diversity gains achievable by dirty-paper coding and show that its sum-rate throughput scales like Nt log log KNr where Nt and Nr are the number of transmit and receive antennas and K is the number of users. While our scheduling schemes is asymptotically optimal, it also exhibits a good performance for practical network sizes. We also show that by appropriate design of the feedback mechanism, we can refrain the aggregate amount of feedback from increasing with the number of users and for asymptotically large networks the total number of feedback bits is bounded by Nt log Nt. We also demonstrate that despite having an opportunistic user selection, fairness among the users is maintained and all are equality likely to be scheduled.\",\"PeriodicalId\":120561,\"journal\":{\"name\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2008.4797539\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2008.4797539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

当传输端信道状态信息(CSI)可用时,多天线下行传输可显著提高传输容量。具有无限速率反馈(全部或部分CSI)的和速率容量与发射天线数量(多路复用增益)成线性关系,与用户数量(多用户分集增益)成双对数关系。本文提出了一种新的调度方案,该方案只需要有限速率反馈,但保留了脏纸编码可实现的最优复用和多用户分集增益,并证明了其和速率吞吐量尺度为Nt log log KNr,其中Nt和Nr为发射和接收天线的数量,K为用户的数量。虽然我们的调度方案是渐近最优的,但它在实际网络规模下也表现出良好的性能。我们还表明,通过适当的反馈机制设计,我们可以抑制反馈的总量随着用户数量的增加而增加,并且对于渐近大的网络,反馈位的总数以Nt log Nt为界。我们还证明,尽管有机会性的用户选择,但用户之间的公平性是保持的,并且所有用户都是平等的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Opportunistic multi-antenna downlink transmission with finite-rate feedback
Multiple-antenna downlink transmission offers significant capacity improvement when the transmit-side channel state information (CSI) is available. The sum-rate capacity with infinite-rate feedback (full or partial CSI) scales linearly with the number of transmit antennas (multiplexing gain) and double logarithmically with the number of users (multiuser diversity gain). In this paper we present a new scheduling scheme which requires only finite-rate feedback and yet retains the optimal multiplexing and multiuser diversity gains achievable by dirty-paper coding and show that its sum-rate throughput scales like Nt log log KNr where Nt and Nr are the number of transmit and receive antennas and K is the number of users. While our scheduling schemes is asymptotically optimal, it also exhibits a good performance for practical network sizes. We also show that by appropriate design of the feedback mechanism, we can refrain the aggregate amount of feedback from increasing with the number of users and for asymptotically large networks the total number of feedback bits is bounded by Nt log Nt. We also demonstrate that despite having an opportunistic user selection, fairness among the users is maintained and all are equality likely to be scheduled.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信