.png){kind=icon}
.png){kind=icon}
Return
A low complexity user scheduling algorithm for uplink multiuser MIMO systems
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2008.070199.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-input multiple-output (MIMO) multiuser system. Compared with the existing scheduling algorithms, our algorithm is not only more efficient but also converges to within 99% of the optimal capacity obtained by exhaustive search. We demonstrate the convergence of the proposed scheduling algorithm and study the tradeoff between its complexity and performance.
Keywords:
adaptive Markov chain Monte Carlo (AMCMC)
multiple-input multiple-output (MIMO)
multiuser selection
scheduling
sum capacity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W