Low complexity joint user and mode selection algorithm for multiuser mimo downlink systems

Jin Sung Kim, Kyoung Jae Lee, Inkyu Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
Publication statusPublished - 2010 Dec 1
Event53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States
Duration: 2010 Dec 62010 Dec 10

Other

Other53rd IEEE Global Communications Conference, GLOBECOM 2010
CountryUnited States
CityMiami, FL
Period10/12/610/12/10

Fingerprint

Multiplexing
Scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Kim, J. S., Lee, K. J., & Lee, I. (2010). Low complexity joint user and mode selection algorithm for multiuser mimo downlink systems. In GLOBECOM - IEEE Global Telecommunications Conference [5683865] https://doi.org/10.1109/GLOCOM.2010.5683865

Low complexity joint user and mode selection algorithm for multiuser mimo downlink systems. / Kim, Jin Sung; Lee, Kyoung Jae; Lee, Inkyu.

GLOBECOM - IEEE Global Telecommunications Conference. 2010. 5683865.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, JS, Lee, KJ & Lee, I 2010, Low complexity joint user and mode selection algorithm for multiuser mimo downlink systems. in GLOBECOM - IEEE Global Telecommunications Conference., 5683865, 53rd IEEE Global Communications Conference, GLOBECOM 2010, Miami, FL, United States, 10/12/6. https://doi.org/10.1109/GLOCOM.2010.5683865
Kim, Jin Sung ; Lee, Kyoung Jae ; Lee, Inkyu. / Low complexity joint user and mode selection algorithm for multiuser mimo downlink systems. GLOBECOM - IEEE Global Telecommunications Conference. 2010.
@inproceedings{cd2fd53bd3a64084a169c70acf068165,
title = "Low complexity joint user and mode selection algorithm for multiuser mimo downlink systems",
abstract = "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.",
author = "Kim, {Jin Sung} and Lee, {Kyoung Jae} and Inkyu Lee",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/GLOCOM.2010.5683865",
language = "English",
isbn = "9781424456383",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Low complexity joint user and mode selection algorithm for multiuser mimo downlink systems

AU - Kim, Jin Sung

AU - Lee, Kyoung Jae

AU - Lee, Inkyu

PY - 2010/12/1

Y1 - 2010/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=79551637224&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79551637224&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2010.5683865

DO - 10.1109/GLOCOM.2010.5683865

M3 - Conference contribution

AN - SCOPUS:79551637224

SN - 9781424456383

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -