.png){kind=icon}
.png){kind=icon}
Return
A Two-Step User Selection Algorithm for Multiuser Precoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2013.2286152.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A two-step user selection algorithm for multiuser precoding based on the minimum-mean-square error criterion is proposed in this paper. The first step is the sequential user selection algorithm, where the focus is on minimizing the increase in the mean square error (MSE) when adding a new user to the service user set. During the first step, previous selection results can be used in the subsequent operation to reduce the computational complexity of the algorithm. In the second step, the user index regeneration algorithm is performed to further lower the MSE. Analysis and simulation results show that the proposed two-step user selection algorithm has better performance and lower complexity than the existing iterative algorithm. Compared with the decremental algorithm, the proposed algorithm has marginal performance loss with much lower computational complexity. The given advantages are also verified in a scenario with channel estimation errors. In a round-robin scheme, where all the available users are scheduled, the simulation result shows that the capacity of the proposed two-step algorithm is a little higher than that of the decremental algorithm.
Keywords:
Complexity and performance balancing
mean square error (MSE)
user selection
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W