By Topic

Low Complexity Joint User and Mode Selection Algorithm for Multiuser MIMO Downlink Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jin-Sung Kim ; Sch. of Electr. Eng., Korea Univ., Seoul, South Korea ; Kyoung-Jae Lee ; Inkyu Lee

In multiuser multiple-input multiple-output (MIMO) downlink systems, orthogonal space division multiplexing (OSDM) techniques have been studied to approach the optimum performance of dirty paper coding with low complexity. Assuming a large number of users in the multiuser system, a proper user scheduling is needed to utilize the OSDM. In addition, the performance of the chosen users can be maximized by properly configuring the numbers of data streams, or the transmission modes. In this paper, we propose a joint user and mode selection algorithm which approaches the performance of the exhaustive search with significantly lower complexity. To this end we first decompose the sum rate into the sum of the individual rates, and derive an upper bound of each individual rate. By utilizing the obtained upper bound, the user and mode subset is determined to maximize the sum rate. Comparing with other conventional low-complexity schemes, the proposed scheme requires much lower complexity especially when the number of users is large. For example, our method achieves a complexity reduction of 92% compared to the conventional scheme when the number of users is 25. Simulation results show that our method achieves more than 95% of the sum rate of the exhaustive search.

Published in:

Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference:

6-10 Dec. 2010