On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm
IEEE Transactions on Signal Processing - Part I
Precoding for Multiple Antenna Gaussian Broadcast Channels With Successive Zero-Forcing
IEEE Transactions on Signal Processing - Part II
Capacity analysis for parallel and sequential MIMO equalizers
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
User Selection With Zero-Forcing Beamforming Achieves the Asymptotically Optimal Sum Rate
IEEE Transactions on Signal Processing - Part I
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
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
Sum capacity of Gaussian vector broadcast channels
IEEE Transactions on Information Theory
On the capacity of MIMO broadcast channels with partial side information
IEEE Transactions on Information Theory
Sum power iterative water-filling for multi-antenna Gaussian broadcast channels
IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
On the User Selection for MIMO Broadcast Channels
IEEE Transactions on Information Theory
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
Hi-index | 35.68 |
This paper studies the sum rate performance of two low complexity eigenmode-based transmission techniques for the MIMO broadcast channel, employing greedy semi-orthogonal user selection (SUS). The first approach, termed ZFDPC-SUS, is based on zero-forcing dirty paper coding; the second approach, termed ZFBF-SUS, is based on zero-forcing beamforming. We first employ new analytical methods to prove that as the number of users K grows large, the ZFDPC-SUS approach can achieve the optimal sum rate scaling of the MIMO broadcast channel. We also prove that the average sum rates of both techniques converge to the average sum capacity of the MIMO broadcast channel for large K. In addition to the asymptotic analysis, we investigate the sum rates achieved by ZFDPC-SUS and ZFBF-SUS for finite K, and show that ZFDPC-SUS has significant performance advantages. Our results also provide key insights into the benefit of multiple receive antennas, and the effect of the SUS algorithm. In particular, we show that whilst multiple receive antennas only improves the asymptotic sum rate scaling via the second-order behavior of the multi-user diversity gain; for finite K, the benefit can be very significant. We also show the interesting result that the semi-orthogonality constraint imposed by SUS, whilst facilitating a very low complexity user selection procedure, asymptotically does not reduce the multi-user diversity gain in either first (log K) or second-order (loglog K) terms.