On the User Selection for MIMO Broadcast Channels

Authors:
A. Bayesteh;A. K. Khandani
Affiliations:
Dept. of Electr. & Comput. Eng., Waterloo Univ., Waterloo, ON;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 8

Eigenmode transmission for the MIMO broadcast channel with semi-orthogonal user selection

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Linear beamforming for multiuser MIMO downlink systems with channel orthogonalization

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
User selection in multiuser MIMO systems with secrecy considerations

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Scheduling for multiuser MIMO broadcast systems: transmit or receive beamforming?

IEEE Transactions on Wireless Communications
Eigen-based transceivers for the MIMO broadcast channel with semi-orthogonal user selection

IEEE Transactions on Signal Processing
Efficient transmission schemes for multiuser MIMO downlink with linear receivers and partial channel state information

EURASIP Journal on Wireless Communications and Networking
Joint power allocation and beamforming with users selection for cognitive radio networks via discrete stochastic optimization

Wireless Networks
On the Sum Rate Capacity of MIMO Broadcast Channels in Cognitive Radio Networks with Interference Power Constraints

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	754.84

Visualization

Abstract

In this paper, a downlink communication system, in which a base station (BS) equipped with antennas communicates with users each equipped with 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 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.