Vector quantization and signal compression
Vector quantization and signal compression
Design and Analysis of MIMO Spatial Multiplexing Systems With Quantized Feedback
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
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory
Grassmannian beamforming for multiple-input multiple-output wireless systems
IEEE Transactions on Information Theory
MIMO Broadcast Channels With Finite-Rate Feedback
IEEE Transactions on Information Theory
High SNR Analysis for MIMO Broadcast Channels: Dirty Paper Coding Versus Linear Precoding
IEEE Transactions on Information Theory
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
IEEE Journal on Selected Areas in Communications
Multi-Antenna Downlink Channels with Limited Feedback and User Selection
IEEE Journal on Selected Areas in Communications
Limited feedback-based block diagonalization for the MIMO broadcast channel
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper we propose a simplified user scheduling algorithm for the downlink of multiuser multiple antenna systems with limited feedback channel state information available at the transmitter (CSIT) and block diagonalization (BD) precoding. In similar work, the perfect CSIT for all users is generally assumed, but it is normally not available. Optimal user scheduling involves exhaustive search, which becomes very complex for realistic numbers of users and transmit antennas. We employ existing vector quantization algorithms to obtain quantized feedback of CSIT. A simplified heuristic user scheduling metric is proposed, which is shown to achieve performance close to that of the exhaustive search method. Further simplification of the greedy scheduling algorithm is obtained with an intermediate user grouping technique. A user-side single antenna/mode selection technique in conjunction with the proposed user scheduling algorithm is also proposed. The proposed algorithm is of low complexity, but provides performance close to a highly complex exhaustive search.