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}
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.