线性接收上行虚拟mimo系统的空间多用户配对

B. Fan, Wenbo Wang, Yicheng Lin, Lin Huang, K. Zheng
{"title":"线性接收上行虚拟mimo系统的空间多用户配对","authors":"B. Fan, Wenbo Wang, Yicheng Lin, Lin Huang, K. Zheng","doi":"10.1109/WCNC.2009.4917973","DOIUrl":null,"url":null,"abstract":"This paper investigates the spatial resource allocation algorithms for the uplink Virtual-MIMO (Multiple Input and Multiple Output) systems, where K client users (each with one or multiple antennas) are served by one multiple-antenna BS (Base Station). To fully exploit the spatial multi-user diversity gain, the finding of the optimal spatial co-channel users is discussed, which is formulated as a mixed binary integer programming problem. Based on the property of hermitian matrix, simulated annealing is used to recursively find the suboptimal spatial co-channel user group. By simulation results, our proposed strategy has almost the same system throughput performance as the optimal greedy algorithm, and can maintain lower computation complexity.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Spatial Multi-User Pairing for Uplink Virtual-MIMO Systems with Linear Receiver\",\"authors\":\"B. Fan, Wenbo Wang, Yicheng Lin, Lin Huang, K. Zheng\",\"doi\":\"10.1109/WCNC.2009.4917973\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates the spatial resource allocation algorithms for the uplink Virtual-MIMO (Multiple Input and Multiple Output) systems, where K client users (each with one or multiple antennas) are served by one multiple-antenna BS (Base Station). To fully exploit the spatial multi-user diversity gain, the finding of the optimal spatial co-channel users is discussed, which is formulated as a mixed binary integer programming problem. Based on the property of hermitian matrix, simulated annealing is used to recursively find the suboptimal spatial co-channel user group. By simulation results, our proposed strategy has almost the same system throughput performance as the optimal greedy algorithm, and can maintain lower computation complexity.\",\"PeriodicalId\":186150,\"journal\":{\"name\":\"2009 IEEE Wireless Communications and Networking Conference\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Wireless Communications and Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2009.4917973\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Wireless Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2009.4917973","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

摘要

本文研究了上行虚拟多输入多输出系统的空间资源分配算法,其中K个客户端用户(每个用户有一个或多个天线)由一个多天线基站(基站)服务。为了充分利用空间多用户分集增益,讨论了最优空间同信道用户的寻找问题,并将其表述为一个混合二进制整数规划问题。基于厄米特矩阵的性质,采用模拟退火方法递归求解次优空间同信道用户群。仿真结果表明,该策略具有与最优贪心算法基本相同的系统吞吐性能,且能保持较低的计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Spatial Multi-User Pairing for Uplink Virtual-MIMO Systems with Linear Receiver
This paper investigates the spatial resource allocation algorithms for the uplink Virtual-MIMO (Multiple Input and Multiple Output) systems, where K client users (each with one or multiple antennas) are served by one multiple-antenna BS (Base Station). To fully exploit the spatial multi-user diversity gain, the finding of the optimal spatial co-channel users is discussed, which is formulated as a mixed binary integer programming problem. Based on the property of hermitian matrix, simulated annealing is used to recursively find the suboptimal spatial co-channel user group. By simulation results, our proposed strategy has almost the same system throughput performance as the optimal greedy algorithm, and can maintain lower computation complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信