最小二乘线性自适应接收机的MIMO块信道大系统容量

Yakun Sun, M. Honig
{"title":"最小二乘线性自适应接收机的MIMO块信道大系统容量","authors":"Yakun Sun, M. Honig","doi":"10.1109/GLOCOM.2005.1577904","DOIUrl":null,"url":null,"abstract":"The performance of a wireless channel with multiple antennas benefits from channel knowledge at the receiver, which is typically unknown a priori. We study the capacity of a block fading multiple-input/multiple-output (MIMO) channel with a linear receiver, which is estimated from a training sequence via a least squares (LS) algorithm. Given a fixed block size, the amount of training overhead plays a key role in balancing the quality of the receiver estimate and the data transmission time. Here we study the optimal training length, which maximizes the large system MIMO capacity, i.e., the number of transmit and receive antennas go to infinity with fixed ratio. In order to obtain a meaningful limit, the training length and packet length also increase in fixed proportion to the number of antennas. We show that the optimal amount of training grows as the square root of the block size, as the block size becomes large. Furthermore, only a slight benefit is obtained from optimizing the allocation of power across training and data symbols. Numerical results show that for a fixed block length, the capacity can be increased somewhat by adding a properly chosen diagonal loading factor to the LS algorithm.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Large system capacity of MIMO block channels with least squares linear adaptive receivers\",\"authors\":\"Yakun Sun, M. Honig\",\"doi\":\"10.1109/GLOCOM.2005.1577904\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of a wireless channel with multiple antennas benefits from channel knowledge at the receiver, which is typically unknown a priori. We study the capacity of a block fading multiple-input/multiple-output (MIMO) channel with a linear receiver, which is estimated from a training sequence via a least squares (LS) algorithm. Given a fixed block size, the amount of training overhead plays a key role in balancing the quality of the receiver estimate and the data transmission time. Here we study the optimal training length, which maximizes the large system MIMO capacity, i.e., the number of transmit and receive antennas go to infinity with fixed ratio. In order to obtain a meaningful limit, the training length and packet length also increase in fixed proportion to the number of antennas. We show that the optimal amount of training grows as the square root of the block size, as the block size becomes large. Furthermore, only a slight benefit is obtained from optimizing the allocation of power across training and data symbols. Numerical results show that for a fixed block length, the capacity can be increased somewhat by adding a properly chosen diagonal loading factor to the LS algorithm.\",\"PeriodicalId\":319736,\"journal\":{\"name\":\"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2005.1577904\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2005.1577904","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

具有多天线的无线信道的性能受益于接收机的信道知识,这通常是先验未知的。本文研究了带线性接收机的块衰落多输入/多输出(MIMO)信道的容量,该信道通过最小二乘(LS)算法从训练序列中估计。在给定固定块大小的情况下,训练开销的多少在平衡接收方估计质量和数据传输时间方面起着关键作用。这里我们研究最优训练长度,使大系统MIMO容量最大化,即发射天线和接收天线的数量以固定的比例趋于无穷大。为了得到一个有意义的极限,训练长度和分组长度也随天线数量的增加而定比例增加。我们表明,当块大小变大时,最佳训练量随着块大小的平方根而增长。此外,通过优化跨训练符号和数据符号的功率分配,只获得了很小的好处。数值结果表明,在块长度固定的情况下,通过适当选择对角加载因子,LS算法的容量可以有所提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Large system capacity of MIMO block channels with least squares linear adaptive receivers
The performance of a wireless channel with multiple antennas benefits from channel knowledge at the receiver, which is typically unknown a priori. We study the capacity of a block fading multiple-input/multiple-output (MIMO) channel with a linear receiver, which is estimated from a training sequence via a least squares (LS) algorithm. Given a fixed block size, the amount of training overhead plays a key role in balancing the quality of the receiver estimate and the data transmission time. Here we study the optimal training length, which maximizes the large system MIMO capacity, i.e., the number of transmit and receive antennas go to infinity with fixed ratio. In order to obtain a meaningful limit, the training length and packet length also increase in fixed proportion to the number of antennas. We show that the optimal amount of training grows as the square root of the block size, as the block size becomes large. Furthermore, only a slight benefit is obtained from optimizing the allocation of power across training and data symbols. Numerical results show that for a fixed block length, the capacity can be increased somewhat by adding a properly chosen diagonal loading factor to the LS algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信