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 language | English |
|---|---|
| Pages (from-to) | 3179-3182 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Communications |
| Volume | E94-B |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 2011 Jan 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
}
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 journal › Article
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 -