{"title":"多用户MIMO的最优用户配对","authors":"E. Viterbo, A. Hottinen","doi":"10.1109/ISSSTA.2008.50","DOIUrl":null,"url":null,"abstract":"In this paper we show how the capacity of the uplink of a multiuser system can be increased by a scheduling strategy, which pairs the transmission of users in different time/frequency/code slots according to the channel quality. The optimal scheduling strategy is equivalent to a combinatorial optimization problem. We show how this problem can be solved efficiently by using the Hungarian method. We then show that, by using the proposed scheduling scheme, the performance of minimum mean square error detection approaches the one of maximum likelihood detection, as the number of users increases.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Optimal User Pairing for Multiuser MIMO\",\"authors\":\"E. Viterbo, A. Hottinen\",\"doi\":\"10.1109/ISSSTA.2008.50\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we show how the capacity of the uplink of a multiuser system can be increased by a scheduling strategy, which pairs the transmission of users in different time/frequency/code slots according to the channel quality. The optimal scheduling strategy is equivalent to a combinatorial optimization problem. We show how this problem can be solved efficiently by using the Hungarian method. We then show that, by using the proposed scheduling scheme, the performance of minimum mean square error detection approaches the one of maximum likelihood detection, as the number of users increases.\",\"PeriodicalId\":334589,\"journal\":{\"name\":\"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSSTA.2008.50\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSSTA.2008.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we show how the capacity of the uplink of a multiuser system can be increased by a scheduling strategy, which pairs the transmission of users in different time/frequency/code slots according to the channel quality. The optimal scheduling strategy is equivalent to a combinatorial optimization problem. We show how this problem can be solved efficiently by using the Hungarian method. We then show that, by using the proposed scheduling scheme, the performance of minimum mean square error detection approaches the one of maximum likelihood detection, as the number of users increases.