Optimal User Pairing for Multiuser MIMO
- 1 August 2008
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19437439,p. 242-246
- https://doi.org/10.1109/isssta.2008.50
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.Keywords
This publication has 7 references indexed in Scilit:
- Low-Complexity Space–Time–Frequency Scheduling for MIMO Systems With SDMAIEEE Transactions on Vehicular Technology, 2007
- Capacity-Based Uplink Scheduling Using Long-Term Channel KnowledgePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- An overview of scheduling algorithms in MIMO-based fourth-generation wireless systemsIEEE Network, 2005
- Multiuser diversity for MIMO wireless systems with linear receiversPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Algorithms for the Assignment and Transportation ProblemsJournal of the Society for Industrial and Applied Mathematics, 1957
- Variants of the hungarian method for assignment problemsNaval Research Logistics Quarterly, 1956
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955