Throughput analysis for MIMO systems in the high SNR regime

N. Prasad, M. Varanasi
{"title":"Throughput analysis for MIMO systems in the high SNR regime","authors":"N. Prasad, M. Varanasi","doi":"10.1109/ISIT.2006.261822","DOIUrl":null,"url":null,"abstract":"Outage capacity and throughput are the two key metrics through which the fundamental limits of delay-sensitive wireless MIMO links can be studied. In this paper, we show that these metrics are intimately related, and consequently, as in the case of outage capacity, the growth rate of throughput with SNR rho is t log rho for a general class of fading channels (with channel state information at the receiver (CSIR) and with or without CSI at the transmitter (CSIT)) whose channel matrix is of rank t with probability one. However, while asymptotically tight affine lower bounds of the form t log rho + 0(1) were recently derived for outage capacity for such channels, in the sense that the limit as rho rarr infin of the difference between the outage capacity and the lower bound is zero, such affine lower bounds are not possible in general for the throughput. Using the t log rho + O(1) bounds on outage capacity however, lower bounds on throughput are specified where the high SNR limit of the ratio of the throughput and its lower bound is unity. These bounds reveal that the throughput optimal outage probability approaches zero as rho rarr infin. An important exception is the scenario where both the transmitter and receiver have CSI under the long-term power constraint (LTPC), for which we obtain a lower bound of the form t log rho + O(1) which is asymptotically tight (in the stronger sense) and interestingly, this lower bound is identical to the asymptotic delay-limited capacity. The throughputs of MISO and SIMO fading channels are extensively analyzed and it is shown that asymptotically, isotropic Gaussian input is throughput optimal, correlation is detrimental whereas increase in the Rice factor is beneficial and that throughput is schur-concave in the correlation eigenvalues","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261822","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Outage capacity and throughput are the two key metrics through which the fundamental limits of delay-sensitive wireless MIMO links can be studied. In this paper, we show that these metrics are intimately related, and consequently, as in the case of outage capacity, the growth rate of throughput with SNR rho is t log rho for a general class of fading channels (with channel state information at the receiver (CSIR) and with or without CSI at the transmitter (CSIT)) whose channel matrix is of rank t with probability one. However, while asymptotically tight affine lower bounds of the form t log rho + 0(1) were recently derived for outage capacity for such channels, in the sense that the limit as rho rarr infin of the difference between the outage capacity and the lower bound is zero, such affine lower bounds are not possible in general for the throughput. Using the t log rho + O(1) bounds on outage capacity however, lower bounds on throughput are specified where the high SNR limit of the ratio of the throughput and its lower bound is unity. These bounds reveal that the throughput optimal outage probability approaches zero as rho rarr infin. An important exception is the scenario where both the transmitter and receiver have CSI under the long-term power constraint (LTPC), for which we obtain a lower bound of the form t log rho + O(1) which is asymptotically tight (in the stronger sense) and interestingly, this lower bound is identical to the asymptotic delay-limited capacity. The throughputs of MISO and SIMO fading channels are extensively analyzed and it is shown that asymptotically, isotropic Gaussian input is throughput optimal, correlation is detrimental whereas increase in the Rice factor is beneficial and that throughput is schur-concave in the correlation eigenvalues
高信噪比下MIMO系统的吞吐量分析
中断容量和吞吐量是研究延迟敏感无线MIMO链路基本限制的两个关键指标。在本文中,我们证明了这些指标是密切相关的,因此,在中断容量的情况下,对于信道矩阵秩为t且概率为1的一般衰落信道(接收器(CSIR)具有信道状态信息,发射器(CSIT)具有或不具有CSI),具有SNR rho的吞吐量增长率为t log rho。然而,虽然最近对此类信道的中断容量导出了形式为t log rho + 0(1)的渐近紧仿射下界,即中断容量与下界之差的极限rho rrr inin为零,但对于吞吐量来说,这种仿射下界通常是不可能的。然而,使用中断容量的t log + O(1)边界,指定吞吐量的下界,其中吞吐量之比的高信噪比极限与其下界为1。这些边界表明,吞吐量最优中断概率趋近于零。一个重要的例外是在长期功率约束(LTPC)下发射机和接收机都有CSI的情况,对此我们得到了形式为t log rho + O(1)的下界,它是渐近紧密的(在更强的意义上),有趣的是,这个下界与渐近延迟限制容量相同。对MISO和SIMO衰落信道的吞吐量进行了广泛的分析,表明渐近各向同性高斯输入是吞吐量最优的,相关性是有害的,而Rice因子的增加是有益的,吞吐量在相关特征值上是斜凹的
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信