On the user selection for MIMO broadcast channels

被引：62

作者：

Bayesteh, Alireza ^{[1
]}

Khandani, Amir K. ^{[1
]}

机构：

[1] Univ Waterloo, Dept Elect & Comp Engn, Coding & Signal Transmiss Lab, Waterloo, ON N2L 3G1, Canada

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2008年 / 54卷 / 03期

基金：

加拿大自然科学与工程研究理事会;

关键词：

asymptotic analysis; multiple-input multiple-output (MIMO) broadcast channel; sum-rate capacity; user selection; zero-forcing beamforming;

D O I：

10.1109/TIT.2007.915887

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, a downlink communication system, in which a base station (BS) equipped with M antennas communicates with N users each equipped with K receive antennas, is considered. An efficient suboptimum algorithm is proposed for selecting a set of users in order to maximize the sum-rate throughput of the system, in a Rayleigh-fading environment. For the asymptotic case when N tends to infinity, the necessary and sufficient conditions in order to achieve the maximum sum-rate throughput, such that the difference between the achievable sum-rate and the maximum value approaches zero, is derived. The complexity of our algorithm is investigated in terms of the required amount of feedback from the-users to the BS, as well as the number of searches required for selecting the users. It is shown that the proposed method is capable of achieving a large portion of the sum-rate capacity, with a very low complexity.

引用

页码：1086 / 1107

页数：22

共 37 条

[1]

Airy M, 2004, CONF REC ASILOMAR C, P886

[2]

Amraoui A, 2003, 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, P296

[3]

BAYESTEH A, UNPUB IEEE T INF THE

[4] On the achievable throughput of a multiantenna Gaussian broadcast channel [J].