Throughput analysis in wideband MIMO broadcast channels with partial feedback

M. J. Fakhereddin, M. Sharif, B. Hassibi
{"title":"Throughput analysis in wideband MIMO broadcast channels with partial feedback","authors":"M. J. Fakhereddin, M. Sharif, B. Hassibi","doi":"10.1109/SPAWC.2005.1506244","DOIUrl":null,"url":null,"abstract":"It has been recently shown that opportunistic transmit beamforming using partial channel state information (CSI) achieves the same throughput scaling obtained from dirty paper coding for a broadcast channel with fixed number of transmit antennas and many receivers M. Sharif et al., (2005). In this paper, we study the generalization of this scheme to wideband broadcast channels. By using orthogonal frequency division multiplexing, an L-tap wideband channel can be decomposed to N parallel narrowband channels, where N is larger than L. Neighboring subchannels are therefore highly correlated, and it is intuitive to say that each group of neighboring subchannels (forming a cluster) can be characterized by one channel quality. We show in this paper that users need only feedback the best signal-to-noise-plus-interference ratio at the center of each cluster. Our results indicate that for cluster size of order N/L/spl radic/K, where K is the number of users, this feedback scheme maintains the same throughput scaling as when full CSI is known. Simulation results show that larger cluster sizes (N/2L) can also be implemented for a small throughput hit.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2005.1506244","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

It has been recently shown that opportunistic transmit beamforming using partial channel state information (CSI) achieves the same throughput scaling obtained from dirty paper coding for a broadcast channel with fixed number of transmit antennas and many receivers M. Sharif et al., (2005). In this paper, we study the generalization of this scheme to wideband broadcast channels. By using orthogonal frequency division multiplexing, an L-tap wideband channel can be decomposed to N parallel narrowband channels, where N is larger than L. Neighboring subchannels are therefore highly correlated, and it is intuitive to say that each group of neighboring subchannels (forming a cluster) can be characterized by one channel quality. We show in this paper that users need only feedback the best signal-to-noise-plus-interference ratio at the center of each cluster. Our results indicate that for cluster size of order N/L/spl radic/K, where K is the number of users, this feedback scheme maintains the same throughput scaling as when full CSI is known. Simulation results show that larger cluster sizes (N/2L) can also be implemented for a small throughput hit.
带部分反馈的宽带MIMO广播信道吞吐量分析
最近有研究表明,使用部分信道状态信息(CSI)的机会发射波束形成,对于具有固定数量的发射天线和许多接收器的广播信道,实现了与脏纸编码相同的吞吐量缩放。本文研究了该方案在宽带广播信道中的推广。利用正交频分复用技术,一个l分接宽带信道可以分解为N个平行窄带信道,其中N大于l。因此相邻子信道高度相关,可以直观地说,每一组相邻子信道(形成一个簇)可以用一个信道质量来表征。在本文中,我们证明了用户只需要在每个集群的中心反馈最佳的信噪比。我们的研究结果表明,对于N/L/spl径向/K阶的集群大小,其中K为用户数量,该反馈方案与已知完整CSI时保持相同的吞吐量缩放。仿真结果表明,对于较小的吞吐量,也可以实现更大的集群大小(N/2L)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信
小红书