Tree-structured user scheduling algorithm and its implementation in multi-user MIMO systems

Junyi Wang*, Jiang Liu, Takuro Sato, Athanasios Vasilakos, Kiyomichi Araki

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The paper describes a low complexity tree-structure based user scheduling algorithm in a 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 make this work more feasible, some implementation problems such as complexity reduction, power control and performance distortion of channel estimation are also discussed in this paper. Both theoretical analysis and simulation results show that the complexity of proposed scheme, linearly increases with the number of user candidates and the number of antennas to be selected and is much lower than full research algorithm. Furthermore the algorithm can also be performed independently with power control and is robust to the channel estimation error.

Original languageEnglish
Title of host publicationIWCMC 2008 - International Wireless Communications and Mobile Computing Conference
Pages893-898
Number of pages6
DOIs
Publication statusPublished - 2008 Oct 6
EventInternational Wireless Communications and Mobile Computing Conference, IWCMC 2008 - Crete, Greece
Duration: 2008 Aug 62008 Aug 8

Publication series

NameIWCMC 2008 - International Wireless Communications and Mobile Computing Conference

Conference

ConferenceInternational Wireless Communications and Mobile Computing Conference, IWCMC 2008
Country/TerritoryGreece
CityCrete
Period08/8/608/8/8

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Tree-structured user scheduling algorithm and its implementation in multi-user MIMO systems'. Together they form a unique fingerprint.

Cite this