Proceedings ArticleDOI
Efficient User Selection and Ordering Algorithms for Successive Zero-Forcing Precoding for Multiuser MIMO Downlink
Shreeram Sigdel,Witold A. Krzymien +1 more
- pp 1-6
Reads0
Chats0
TLDR
A low complexity greedy user scheduling algorithm for successive zero-forcing precoding, which incorporates various user ordering techniques is developed, which provides performance close to the highly complex exhaustive search algorithm.Abstract:
In this paper we consider user scheduling problem for linearly preceded multiuser multiple-input multiple-output (MIMO) downlink, where base station as well as the mobile receivers are equipped with multiple antennas. Optimal precoding involves dirty paper coding (DPC) technique, and it is highly nonlinear and complex. On the other hand, complete inter-user interference cancellation using linear zero-forcing or block diagonalization precoding are suboptimal. Hence, we consider successive zero-forcing precoding, which achieves improved system throughput compared to block diagonalization by allowing users to work under limited interference. Due to the dimensionality constraint of linear precoding techniques user scheduling is required. The optimal user scheduling involves exhaustive search, which becomes very complex for realistic numbers of users and transmit antennas. In addition, for successive zero-forcing precoding the order in which users are precoded successively is important for sum rate maximization, which further increases the complexity of exhaustive search. In this paper we develop a low complexity greedy user scheduling algorithm for successive zero-forcing precoding, which incorporates various user ordering techniques. Simplified heuristic scheduling metrics are proposed, which are shown to perform close to the exhaustive search method. A suboptimal user ordering technique that is similar to the order, in which the proposed greedy user selection selects users, is proposed. Further simplification of regular greedy scheduling algorithm is obtained with the proposed intermediate user grouping technique. The proposed algorithm is of low complexity, but provides performance close to the highly complex exhaustive search algorithm.read more
Citations
More filters
Journal ArticleDOI
Overlapping User Grouping in IoT Oriented Massive MIMO Systems
TL;DR: Two new user grouping approaches based on greedy algorithm and another overlapping user grouping method by exploiting the spectral clustering method in machine learning are proposed that can increase the system capacity through subgroup overlapping, and ensure that each user will be served in at least one subgroup.
Proceedings ArticleDOI
Genetic and Greedy User Scheduling for Multiuser MIMO Systems with Successive Zero-Forcing
TL;DR: This paper proposes and analyzes the performance and complexity of greedy and genetic scheduling algorithms for multiuser MIMO systems with successive zero-forcing precoding and demonstrates that at lower K, the genetic algorithm performs better than the greedy algorithm, where K denotes the total number of users requesting service.
Journal ArticleDOI
Low-Complexity User Selection for Rate Maximization in MIMO Broadcast Channels with Downlink Beamforming
TL;DR: A low-complexity algorithm to solve the sum rate maximization problem in multiuser MIMO broadcast channels with downlink beamforming and is highly efficient to form groups of quasiorthogonal users when compared to previously proposed algorithms in the literature.
Proceedings ArticleDOI
User Scheduling for Network MIMO Systems with Successive Zero-Forcing Precoding
TL;DR: Simulation results demonstrate that the proposed algorithms for SZF achieve much higher outage capacity compared to BD with previously proposed algorithms, and simplified metrics for proportionally fair scheduling are proposed.
Journal ArticleDOI
Efficient user selection algorithms for multiuser MIMO systems with zero-forcing dirty paper coding
TL;DR: Two low-complexity user scheduling algorithms are developed to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC, and both achieve performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR).
References
More filters
Journal ArticleDOI
Writing on dirty paper (Corresp.)
TL;DR: It is shown that the optimal transmitter adapts its signal to the state S rather than attempting to cancel it, which is also the capacity of a standard Gaussian channel with signal-to-noise power ratio P/N.
Journal ArticleDOI
Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels
TL;DR: While the proposed algorithms are suboptimal, they lead to simpler transmitter and receiver structures and allow for a reasonable tradeoff between performance and complexity.
Journal ArticleDOI
On the achievable throughput of a multiantenna Gaussian broadcast channel
Giuseppe Caire,Shlomo Shamai +1 more
TL;DR: Under certain mild conditions, this scheme is found to be throughput-wise asymptotically optimal for both high and low signal-to-noise ratio (SNR), and some numerical results are provided for the ergodic throughput of the simplified zero-forcing scheme in independent Rayleigh fading.
Journal ArticleDOI
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
Taesang Yoo,Andrea Goldsmith +1 more
TL;DR: It is shown that a zero-forcing beamforming (ZFBF) strategy, while generally suboptimal, can achieve the same asymptotic sum capacity as that of DPC, as the number of users goes to infinity.
Related Papers (5)
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
Taesang Yoo,Andrea Goldsmith +1 more