.png){kind=icon}
返回
A Two-Step User Selection Algorithm for Multiuser Precoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2013.2286152.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Complexity and performance balancing
mean square error (MSE)
user selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming关于使用迫零波束成形的多天线广播调度的最优性
PREAI
分享收藏The extrapolation of the Drucker–Prager/Cap material parameters to low and high relative densities
PREAI
分享收藏
查看更多内容