A Low Complexity Tree-Structure Based User Scheduling Algorithm for Up-Link Multi-User MIMO Systems

Junyi WANG  Kiyomichi ARAKI  Zhongzhao ZHANG  Yuyuan CHANG  Houtao ZHU  Tsuyoshi KASHIMA  

Publication
IEICE TRANSACTIONS on Communications   Vol.E90-B   No.6   pp.1415-1423
Publication Date: 2007/06/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.6.1415
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
Keyword: 
MIMO,  multi-user,  tree-structure,  user scheduling,  sum-rate capacity,  

Full Text: PDF(754.6KB)>>
Buy this Article




Summary: 
The paper describes a low complexity tree-structure based user scheduling algorithm in an up-link transmission of MLD-based multi-user multiple-input multiple-output (MIMO) wireless systems. An M-branch selection algorithm, which selects M most-possible best branches at each step, is proposed to maximize the whole system sum-rate capacity. To achieve the maximum capacity in multi-user MIMO systems, antennas configuration and user selection are preformed simultaneously. Then according to the selected number of antennas for each user, different transmission schemes are also adopted. Both the theoretical analysis and simulation results show that the proposed algorithms obtain near optimal performance with far low complexity than the full search procedure.