On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm
IEEE Transactions on Signal Processing - Part I
Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels
IEEE Transactions on Signal Processing
Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization
IEEE Transactions on Signal Processing
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
Subchannel Allocation in Multiuser Multiple-Input–Multiple-Output Systems
IEEE Transactions on Information Theory
High SNR Analysis for MIMO Broadcast Channels: Dirty Paper Coding Versus Linear Precoding
IEEE Transactions on Information Theory
Downlink capacity evaluation of cellular networks with known-interference cancellation
IEEE Journal on Selected Areas in Communications
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
IEEE Journal on Selected Areas in Communications
An iterative water-filling algorithm for maximum weighted sum-rate of Gaussian MIMO-BC
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Achieving the capacity region in the MIMO broadcast channel requires the use of Dirty Paper Coding (DPC). When it cannot be afforded to satisfy the requirements of all users by DPC based approaches, it is necessary to identify the users which exhibit the highest performance gain compared to simpler approaches. In this paper we present a user grouping method that aims to identify those users with highest weighted sum rate gain. First some users are excluded by a simple criterion leading to a reduced user set, from which the final user group is selected by a more sophisticated criterion.