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

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

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
EventInternational Wireless Communications and Mobile Computing Conference, IWCMC 2008 - Crete
Duration: 2008 Aug 62008 Aug 8

Other

OtherInternational Wireless Communications and Mobile Computing Conference, IWCMC 2008
CityCrete
Period08/8/608/8/8

Fingerprint

Scheduling algorithms
Channel estimation
Power control
Antennas

ASJC Scopus subject areas

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

Cite this

Wang, J., Liu, J., Sato, T., Vasilakos, A., & Araki, K. (2008). Tree-structured user scheduling algorithm and its implementation in multi-user MIMO systems. In IWCMC 2008 - International Wireless Communications and Mobile Computing Conference (pp. 893-898). [4600053] https://doi.org/10.1109/IWCMC.2008.154

Tree-structured user scheduling algorithm and its implementation in multi-user MIMO systems. / Wang, Junyi; Liu, Jiang; Sato, Takuro; Vasilakos, Athanasios; Araki, Kiyomichi.

IWCMC 2008 - International Wireless Communications and Mobile Computing Conference. 2008. p. 893-898 4600053.

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

Wang, J, Liu, J, Sato, T, Vasilakos, A & Araki, K 2008, Tree-structured user scheduling algorithm and its implementation in multi-user MIMO systems. in IWCMC 2008 - International Wireless Communications and Mobile Computing Conference., 4600053, pp. 893-898, International Wireless Communications and Mobile Computing Conference, IWCMC 2008, Crete, 08/8/6. https://doi.org/10.1109/IWCMC.2008.154
Wang J, Liu J, Sato T, Vasilakos A, Araki K. Tree-structured user scheduling algorithm and its implementation in multi-user MIMO systems. In IWCMC 2008 - International Wireless Communications and Mobile Computing Conference. 2008. p. 893-898. 4600053 https://doi.org/10.1109/IWCMC.2008.154
Wang, Junyi ; Liu, Jiang ; Sato, Takuro ; Vasilakos, Athanasios ; Araki, Kiyomichi. / Tree-structured user scheduling algorithm and its implementation in multi-user MIMO systems. IWCMC 2008 - International Wireless Communications and Mobile Computing Conference. 2008. pp. 893-898
@inproceedings{df7a8279dee2437eadfc4af92965ef9f,
title = "Tree-structured user scheduling algorithm and its implementation in multi-user MIMO systems",
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.",
author = "Junyi Wang and Jiang Liu and Takuro Sato and Athanasios Vasilakos and Kiyomichi Araki",
year = "2008",
doi = "10.1109/IWCMC.2008.154",
language = "English",
isbn = "9781424422029",
pages = "893--898",
booktitle = "IWCMC 2008 - International Wireless Communications and Mobile Computing Conference",

}

TY - GEN

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

AU - Wang, Junyi

AU - Liu, Jiang

AU - Sato, Takuro

AU - Vasilakos, Athanasios

AU - Araki, Kiyomichi

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=52949085525&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52949085525&partnerID=8YFLogxK

U2 - 10.1109/IWCMC.2008.154

DO - 10.1109/IWCMC.2008.154

M3 - Conference contribution

SN - 9781424422029

SP - 893

EP - 898

BT - IWCMC 2008 - International Wireless Communications and Mobile Computing Conference

ER -