在MIMO信道上各向同性高斯输入有多好?

D. Hoesli, A. Lapidoth
{"title":"在MIMO信道上各向同性高斯输入有多好?","authors":"D. Hoesli, A. Lapidoth","doi":"10.1109/ISIT.2004.1365325","DOIUrl":null,"url":null,"abstract":"For a MIMO Ricean fading channel with perfect side information at the receiver we derive an analytic upper bound on the difference between capacity and the mutual information that is induced by an isotropic Gaussian input. We show that if the number of receiver antennas is at least equal to the number of transmitter antennas, then, as the signal-to-noise ratio tends to infinity, such an input is asymptotically optimal. But otherwise such an isotropic input might be suboptimal. We also propose an iterative algorithm to calculate the optimal power allocation.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"How good is an isotropic gaussian input on a MIMO Ricean channel?\",\"authors\":\"D. Hoesli, A. Lapidoth\",\"doi\":\"10.1109/ISIT.2004.1365325\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a MIMO Ricean fading channel with perfect side information at the receiver we derive an analytic upper bound on the difference between capacity and the mutual information that is induced by an isotropic Gaussian input. We show that if the number of receiver antennas is at least equal to the number of transmitter antennas, then, as the signal-to-noise ratio tends to infinity, such an input is asymptotically optimal. But otherwise such an isotropic input might be suboptimal. We also propose an iterative algorithm to calculate the optimal power allocation.\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365325\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365325","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

对于接收端侧信息完备的MIMO Ricean衰落信道,我们推导出了容量与各向同性高斯输入诱导的互信息之差的解析上界。我们证明,如果接收天线的数量至少等于发射天线的数量,那么,当信噪比趋于无穷大时,这样的输入是渐近最优的。但除此之外,这样的各向同性输入可能不是最优的。我们还提出了一种迭代算法来计算最优功率分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
How good is an isotropic gaussian input on a MIMO Ricean channel?
For a MIMO Ricean fading channel with perfect side information at the receiver we derive an analytic upper bound on the difference between capacity and the mutual information that is induced by an isotropic Gaussian input. We show that if the number of receiver antennas is at least equal to the number of transmitter antennas, then, as the signal-to-noise ratio tends to infinity, such an input is asymptotically optimal. But otherwise such an isotropic input might be suboptimal. We also propose an iterative algorithm to calculate the optimal power allocation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A new optimal double periodical construction of one target two-dimensional arrays Distributed power and admission control for time-varying wireless networks Optimal Bregman prediction and Jensen's equality Permutation codes: achieving the diversity-multiplexing tradeoff Subtree decomposition for network coding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1