Mimo广播信道的自适应正交波束形成

J. Duplicy, D. Palomar, L. Vandendorpe
{"title":"Mimo广播信道的自适应正交波束形成","authors":"J. Duplicy, D. Palomar, L. Vandendorpe","doi":"10.1109/CAMSAP.2007.4497969","DOIUrl":null,"url":null,"abstract":"This paper addresses both the user selection and the linear precoding design of a MIMO broadcast channel where the number of users is assumed to be greater than the number of transmit antennas. The optimization criterion considered is the sum-rate. A greedy algorithm tackling jointly the two issues is developed. It sequentially adds new users so as their beamformers build up an orthonormal basis which is optimized with the help of the channel knowledge assumed to be exhaustive. This solution benefits asymptotically (in the limit of a large number of users) from the full multiplexing and multiuser diversity gains alike the capacity achieving dirty paper coding. Moreover, it exhibits better results than existing schemes and offers some advantages resulting from the choice of an orthogonal structure.","PeriodicalId":220687,"journal":{"name":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Adaptive Orthogonal Beamforming for the Mimo Broadcast Channel\",\"authors\":\"J. Duplicy, D. Palomar, L. Vandendorpe\",\"doi\":\"10.1109/CAMSAP.2007.4497969\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses both the user selection and the linear precoding design of a MIMO broadcast channel where the number of users is assumed to be greater than the number of transmit antennas. The optimization criterion considered is the sum-rate. A greedy algorithm tackling jointly the two issues is developed. It sequentially adds new users so as their beamformers build up an orthonormal basis which is optimized with the help of the channel knowledge assumed to be exhaustive. This solution benefits asymptotically (in the limit of a large number of users) from the full multiplexing and multiuser diversity gains alike the capacity achieving dirty paper coding. Moreover, it exhibits better results than existing schemes and offers some advantages resulting from the choice of an orthogonal structure.\",\"PeriodicalId\":220687,\"journal\":{\"name\":\"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAMSAP.2007.4497969\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMSAP.2007.4497969","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

本文研究了假设用户数量大于发射天线数量的MIMO广播信道的用户选择和线性预编码设计。所考虑的优化准则是求和速率。提出了一种贪心算法,将这两个问题结合起来解决。它顺序地增加新用户,使他们的波束形成器建立一个标准正交基,该基在假定的穷举信道知识的帮助下进行优化。该方案渐近地受益于(在大量用户的限制下)完全复用和多用户分集增益,类似于实现脏纸编码的容量。此外,它比现有的方案具有更好的效果,并且由于选择正交结构而具有一些优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Adaptive Orthogonal Beamforming for the Mimo Broadcast Channel
This paper addresses both the user selection and the linear precoding design of a MIMO broadcast channel where the number of users is assumed to be greater than the number of transmit antennas. The optimization criterion considered is the sum-rate. A greedy algorithm tackling jointly the two issues is developed. It sequentially adds new users so as their beamformers build up an orthonormal basis which is optimized with the help of the channel knowledge assumed to be exhaustive. This solution benefits asymptotically (in the limit of a large number of users) from the full multiplexing and multiuser diversity gains alike the capacity achieving dirty paper coding. Moreover, it exhibits better results than existing schemes and offers some advantages resulting from the choice of an orthogonal structure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信