On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm
IEEE Transactions on Signal Processing - Part I
Receive antenna selection for MIMO spatial multiplexing: theory and algorithms
IEEE Transactions on Signal Processing
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
A transmit preprocessing technique for multiuser MIMO systems using a decomposition approach
IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory
Sum power iterative water-filling for multi-antenna Gaussian broadcast channels
IEEE Transactions on Information Theory
Subchannel Allocation in Multiuser Multiple-Input–Multiple-Output Systems
IEEE Transactions on Information Theory
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
IEEE Journal on Selected Areas in Communications
Wireless Personal Communications: An International Journal
EDA-Based Scheduling of Users in the MIMO Multiple Access Channel
Wireless Personal Communications: An International Journal
| Hi-index | 0.01 |
Block diagonalization (BD) and successive optimization (SO) are two suboptimal but more practical (compared to dirty paper coding (DPC)) orthogonal linear precoding techniques for the downlink of multiuser MIMO systems. Since the numbers of users supported by BD or SO for a given number of transmit antennas are limited, BD or SO should be combined with scheduling so that a subset of users is selected at a given time slot while meeting the dimensionality requirements of these techniques. On the other hand, receive antenna selection (RAS) is a promising hardware complexity reduction technique. In this paper, we consider user scheduling in conjunction with receive antenna selection. Since exhaustive search is computationally prohibitive, we propose simplified and suboptimal user scheduling algorithms for both BD and SO. For BD, we propose capacity and Frobenius-norm based suboptimal algorithms with the objective of sum rate maximization. Starting from an empty set, each step of proposed algorithms adds the best user from the set of users not selected yet until the desired number of users have been selected. Proposed receive antenna selection works in conjunction with user scheduling to further enhance the sum rate of BD. For SO, a Frobenius-norm based low complexity algorithm is proposed, which maximizes the ratio of the squared Frobenius norm of the equivalent channel (projected to the joint null space of the previously selected users) to the sum of the squared Frobenius norms of the previously selected users' preprocessed channels. Simulation results demonstrate that the proposed algorithms achieve sum rates close to exhaustive search algorithms with much reduced complexity. We also show that in addition to reduced hardware complexity at the receiver, antenna selection enhances multiuser diversity gain that is achieved with user scheduling.