Sum rates and user scheduling for multi-user MIMO vector perturbation precoding

Authors:
Adeel Razi;Daniel J. Ryan;Iain B. Collings;Jinhong Yuan
Affiliations:
School of Electrical Engineering & Telecommunications, The University of New South Wales, Australia and Wireless Technologies Laboratory, CSIRO ICT Centre, Australia;Department of Electronics & Telecommunications, Norwegian University of Science and Technology, Norway;Wireless Technologies Laboratory, CSIRO ICT Centre, Australia;chool of Electrical Engineering & Telecommunications, The University of New South Wales, Australia
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 7
Cited 0

On the achievable throughput of a multiantenna Gaussian broadcast channel

IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels

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
Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction

IEEE Transactions on Information Theory
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming

IEEE Journal on Selected Areas in Communications
Vector Precoding for Wireless MIMO Systems and its Replica Analysis

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the multiuser multiple-input multiple-output (MIMO) Rayleigh fading broadcast channel. We consider the case where the multiple transmit antennas are used to deliver independent data streams to multiple users via a multi-user technique known as vector perturbation. We derive expressions for the capacity in terms of the average energy of the precoded vector, and use this to derive a closed-form high-SNR upper bound, which we show to be tight via simulation. We then turn to the practical issue of user selection. We propose a low-complexity user selection algorithm that attempts to maximize the high-SNR sum rate upper bound. Simulations show that the algorithm outperforms other user selection algorithms of similar complexity.