For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
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
IEICE TRANSACTIONS on Communications
Publication Date: 2007/06/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
MIMO, multi-user, tree-structure, user scheduling, sum-rate capacity,
Full Text: PDF(754.6KB)>>
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.