Matrix analysis
On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm
IEEE Transactions on Signal Processing - Part I
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning
IEEE Transactions on Information Theory
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
IEEE Transactions on Information Theory
On beamforming with finite rate feedback in multiple-antenna systems
IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
On the capacity of MIMO broadcast channels with partial side information
IEEE Transactions on Information Theory
Dirty-paper coding versus TDMA for MIMO Broadcast channels
IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
MIMO Broadcast Channels With Finite-Rate Feedback
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
IEEE Journal on Selected Areas in Communications
Scheduling of Multi-Antenna Broadcast Systems with Heterogeneous Users
IEEE Journal on Selected Areas in Communications
Multi-Antenna Downlink Channels with Limited Feedback and User Selection
IEEE Journal on Selected Areas in Communications
| Hi-index | 754.84 |
We investigate the problem of downlink user scheduling in multiple-input multiple-output (MIMO) systems with M transmit antennas and K homogeneous multiantenna receiving users. We develop a simple algorithm to schedule a subset of M active users for data transmission. We first identify a set of L candidate users that should provide channel information feedback. We then select M active users among the L candidates based on joint consideration of their effective channel gains and directions. We derive an asymptotic upper bound for the sum rate gap between the maximum sum rate of the M selected active users, achieved by dirty paper coding, and the full sum capacity of the original MIMO broadcast channel. Utilizing the upper bound, we show that the sum rate gap can be reduced to meet user requirement by suitably choosing a large but still finite L. Furthermore, we also investigate the performance of the low complexity zero-forcing beamforming (ZFBF) for the M active users.