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

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

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルIWCMC 2008 - International Wireless Communications and Mobile Computing Conference
ページ893-898
ページ数6
DOI
出版ステータスPublished - 2008 10 6
イベントInternational Wireless Communications and Mobile Computing Conference, IWCMC 2008 - Crete, Greece
継続期間: 2008 8 62008 8 8

出版物シリーズ

名前IWCMC 2008 - International Wireless Communications and Mobile Computing Conference

Conference

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

ASJC Scopus subject areas

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

フィンガープリント 「Tree-structured user scheduling algorithm and its implementation in multi-user MIMO systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル