A User Scheduling with Minimum-Rate Requirement for Maximum Sum-Rate in MIMO-BC

Seungkyu CHOI  Chungyong LEE  

IEICE TRANSACTIONS on Communications   Vol.E94-B   No.11   pp.3179-3182
Publication Date: 2011/11/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E94.B.3179
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Wireless Communication Technologies
multiple-input-multiple-output broadcast channel,  block diagonal geometric mean decomposition,  user scheduling,  user power allocation,  minimum-rate requirement,  

Full Text: PDF(302.5KB)>>
Buy this Article

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 sum-rate 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.