Matrix computations (3rd ed.)
Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels
IEEE Transactions on Signal Processing
Joint transmitter receiver diversity for efficient space division multiaccess
IEEE Transactions on Wireless Communications
Sum Capacity of Multiuser MIMO Broadcast Channels with Block Diagonalization
IEEE Transactions on Wireless Communications
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
Sum power iterative water-filling for multi-antenna Gaussian broadcast channels
IEEE Transactions on Information Theory
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Sum power iterative water-filling (SPIWF) algorithm provides sum-rate-optimal transmission scheme for wireless multiple-input multiple-output (MIMO) broadcast channels (BC), whereas it suffers from its high complexity. In this paper, we propose a new transmission scheme based on a novel block zero-forcing dirty paper coding (Block ZF-DPC) strategy and multiuser-diversity-achieving user selection procedure. The Block ZF-DPC can be considered as an extension of existing ZF-DPC into MIMO BCs. Two user selection algorithms having linear increasing complexity with the number of users have been proposed. One aims at maximizing the achievable sum rate directly and the other is based on Gram-Schmidt Orthogonalization (GSO) and Frobenius norm. The proposed scheme is shown to achieve a sum rate close to the sum capacity of MIMO BC and obtain optimal multiplexing and multiuser diversity gain. In addition, we also show that both selection algorithms achieve a significant part of the sum rate of the optimal greedy selection algorithm at low computation expenditure.