One Low Complexity Selection Strategy for Multiuser System in MIMO Channel

被引:0
作者
Tang, Dong [1 ]
Lv, Mingxia [1 ]
Wan, Ping [1 ]
Wu, Yi [2 ]
机构
[1] Guangzhou Univ, Sch Mech & Elect Engn, Guangzhou, Guangdong, Peoples R China
[2] Guangzhou Univ, Sch Civil Engn, Guangzhou, Guangdong, Peoples R China
来源
2011 INTERNATIONAL CONFERENCE ON ELECTRONICS, COMMUNICATIONS AND CONTROL (ICECC) | 2011年
关键词
MIMO; multiuser diversity; scheduling algorithm; maximum ratio combining (MRC);
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Several different users can be arranged by MIMO (Multiple-Input Multiple-Output) multi-user systems to communicate with a base station at the same time in one time slot. Besides, with the increases of scheduling users, much larger capability and diversity gain of the system can be obtained. As for a scheduling algorithm, exhaustive method is an approach that can get the largest capability of the system by multi-user scheduling. However, this algorithm is quite complex and usually brings huge workload to a base station with multiple antennas, hence the cost of operation to a base station has substantial increased. In this paper, we propose one simple user selection algorithm with low complexity. This algorithm introduces one technique based on user group to select users with the highest sum capacity as candidates to transmit the information. From the simulation results, this algorithm not only decreases the computational complexity of the scheduling algorithm but also retains large capability of the MIMO system.
引用
收藏
页码:3829 / 3831
页数:3
相关论文
共 14 条