A user scheduling with minimum-rate requirement for maximum sum-rate in MIMO-BC

Seungkyu Choi, Chungyong Lee

Research output: Contribution to journalArticle

Abstract

This letter considers a sum-rate maximization problem with user scheduling wherein each user has a minimum-rate requirement in multiple-input-multiple- output broadcast channel. The multiuser strategy used in the user scheduling is a joint transceiver scheme with block diagonal geometric mean decomposition. Since optimum solution to the user scheduling problem generally requires exhaustive search, we propose a suboptimum user scheduling algorithm with each user's minimum-rate requirement as the main constraint. In order to satisfy maximum sumrate and minimum-rate constraints simultaneously, we additionally consider power allocation for scheduled users. Simulation results show that the proposed user scheduling algorithm, together with the user power allocation, achieves sum-rate close to the exhaustive search, while also guarantees minimum-rate requirement of each user.

Original languageEnglish
Pages (from-to)3179-3182
Number of pages4
JournalIEICE Transactions on Communications
VolumeE94-B
Issue number11
DOIs
Publication statusPublished - 2011 Jan 1

Fingerprint

MIMO systems
Scheduling
Scheduling algorithms
Transceivers
Decomposition

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{4803ca2f38f14369b8315598ed1a223d,
title = "A user scheduling with minimum-rate requirement for maximum sum-rate in MIMO-BC",
abstract = "This letter considers a sum-rate maximization problem with user scheduling wherein each user has a minimum-rate requirement in multiple-input-multiple- output broadcast channel. The multiuser strategy used in the user scheduling is a joint transceiver scheme with block diagonal geometric mean decomposition. Since optimum solution to the user scheduling problem generally requires exhaustive search, we propose a suboptimum user scheduling algorithm with each user's minimum-rate requirement as the main constraint. In order to satisfy maximum sumrate and minimum-rate constraints simultaneously, we additionally consider power allocation for scheduled users. Simulation results show that the proposed user scheduling algorithm, together with the user power allocation, achieves sum-rate close to the exhaustive search, while also guarantees minimum-rate requirement of each user.",
author = "Seungkyu Choi and Chungyong Lee",
year = "2011",
month = "1",
day = "1",
doi = "10.1587/transcom.E94.B.3179",
language = "English",
volume = "E94-B",
pages = "3179--3182",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "11",

}

A user scheduling with minimum-rate requirement for maximum sum-rate in MIMO-BC. / Choi, Seungkyu; Lee, Chungyong.

In: IEICE Transactions on Communications, Vol. E94-B, No. 11, 01.01.2011, p. 3179-3182.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A user scheduling with minimum-rate requirement for maximum sum-rate in MIMO-BC

AU - Choi, Seungkyu

AU - Lee, Chungyong

PY - 2011/1/1

Y1 - 2011/1/1

N2 - This letter considers a sum-rate maximization problem with user scheduling wherein each user has a minimum-rate requirement in multiple-input-multiple- output broadcast channel. The multiuser strategy used in the user scheduling is a joint transceiver scheme with block diagonal geometric mean decomposition. Since optimum solution to the user scheduling problem generally requires exhaustive search, we propose a suboptimum user scheduling algorithm with each user's minimum-rate requirement as the main constraint. In order to satisfy maximum sumrate and minimum-rate constraints simultaneously, we additionally consider power allocation for scheduled users. Simulation results show that the proposed user scheduling algorithm, together with the user power allocation, achieves sum-rate close to the exhaustive search, while also guarantees minimum-rate requirement of each user.

AB - This letter considers a sum-rate maximization problem with user scheduling wherein each user has a minimum-rate requirement in multiple-input-multiple- output broadcast channel. The multiuser strategy used in the user scheduling is a joint transceiver scheme with block diagonal geometric mean decomposition. Since optimum solution to the user scheduling problem generally requires exhaustive search, we propose a suboptimum user scheduling algorithm with each user's minimum-rate requirement as the main constraint. In order to satisfy maximum sumrate and minimum-rate constraints simultaneously, we additionally consider power allocation for scheduled users. Simulation results show that the proposed user scheduling algorithm, together with the user power allocation, achieves sum-rate close to the exhaustive search, while also guarantees minimum-rate requirement of each user.

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

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

U2 - 10.1587/transcom.E94.B.3179

DO - 10.1587/transcom.E94.B.3179

M3 - Article

AN - SCOPUS:80155211400

VL - E94-B

SP - 3179

EP - 3182

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 11

ER -