Matrix computations (3rd ed.)
On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas
Wireless Personal Communications: An International Journal
Majorization and matrix-monotone functions in wireless communications
Foundations and Trends in Communications and Information Theory
Precoding for Multiple Antenna Gaussian Broadcast Channels With Successive Zero-Forcing
IEEE Transactions on Signal Processing - Part II
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
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
A Soft Demodulation Algorithm with Low Complexity for One-dimensional DPC System
Wireless Personal Communications: An International Journal
Hi-index | 35.68 |
Dirty paper coding (DPC) scheme is the capacity achieving transmission technique in multiuser MIMO downlink channels.As a sub-optimal solution to DPC, successive zero-forcing DPC (SZF-DPC) has been proposed recently. The zero-interference constraint in designing the precoding matrices limits the number of supportable users. In this correspondence,we propose three low-complexity suboptimal user scheduling algorithms to exploit the multiuser diversity gain in SZF-DPC as the number of users grows. The first algorithm greedily maximizes the true sum rate.The second algorithm is based on eigenvalues. The third algorithm relies on the diagonal elements of the effective channel matrix since eigenvalues and diagonal entries of a Hermitian matrix have a strong relationship. Simulation results show that the proposed scheduling algorithms can obtain a significant fraction of sum rate of the optimal solution. Furthermore, the performance analysis is provided to prove that the proposed user selection algorithms can achieve the same asymptotic sum rate as that of DPC.