Please submit manuscripts in either of the following two submission systems

    ScholarOne Manuscripts

  • ScholarOne

    • 勤云稿件系统

  • 登录

Search by Issue

  • 2024 Vol.31
  • 2023 Vol.30
  • 2022 Vol.29
  • 2021 Vol.28
  • 2020 Vol.27
  • 2019 Vol.26
  • 2018 Vol.25
  • 2017 Vol.24
  • 2016 vol.23
  • 2015 vol.22
  • 2014 vol.21
  • 2013 vol.20
  • 2012 vol.19
  • 2011 vol.18
  • 2010 vol.17
  • 2009 vol.16
  • No.1
  • No.2

Search by Keywords

  • Search by Title
  • Search by Keywords
  • Search by Abstract
  • Search by Author's Chinese Name
  • Search by Author's English Name
  • Search by Fund

News & AnnouncementMORE

Supervised by Ministry of Industry and Information Technology of The People's Republic of China Sponsored by Harbin Institute of Technology Editor-in-chief Yu Zhou ISSNISSN 1005-9113 CNCN 23-1378/T

期刊网站二维码
微信公众号二维码
Related citation:LI Liang,QIU Ling,WEI Guo.Low complexity user scheduling algorithms for uplink multiuser MIMO systems[J].Journal of Harbin Institute Of Technology(New Series),2012,19(2):105-112.DOI:10.11916/j.issn.1005-9113.2012.02.018.
【Print】   【HTML】   【PDF download】   【View/Add Comment】  【Download reader】  【 Close 】
←Previous|Next→ Back Issue    Advanced Search
This paper has been: browsed 2064times   downloaded 1062times 本文二维码信息
码上扫一扫！
Shared by: Wechat More
Font:larger+|default|smaller-
Low complexity user scheduling algorithms for uplink multiuser MIMO systems
Author NameAffiliation
LI Liang Wireless Information Network Laboratory, University of Science and Technology of China, Hefei 230027, China 
QIU Ling Wireless Information Network Laboratory, University of Science and Technology of China, Hefei 230027, China 
WEI Guo Wireless Information Network Laboratory, University of Science and Technology of China, Hefei 230027, China 
Abstract:
Two efficient and low complexity multiuser scheduling algorithms are proposed for the uplink multiple input multiple output systems in this paper. Conventionally, the exhaustive search algorithm (ESA) can give the optimal performance; however, it is complexity prohibitive for practical implementation. Aiming at reducing the complexity while keeping the achievable sum rate performance, two heuristic algorithms are proposed for the multiuser scheduling problems: the improved genetic algorithm and simplified norm based greedy algorithm. Moreover, we also consider the heterogeneity scenario where a modified grouping based user selection algorithm is given to guarantee the user’s fairness. Specifically, the asymptotic behavior of the norm based greedy algorithm is given when each user is equipped with one antenna. Numerical examples demonstrate the superiority of our proposed scheduling and grouping algorithms.
Key words:  Genetic algorithm (GA), multiuser scheduling, multiple input multiple output (MIMO)
DOI：10.11916/j.issn.1005-9113.2012.02.018
Clc Number:TN92
Fund:

LINKS

Copyright © The Editorial Department of Journal of Harbin Institute of Technology
Address: 92 West Dazhi Street, Nan Gang District, Harbin, Heilongjiang Province, China Postcode: 150001
(C)2015 JOURNAL OF HIT ALL RIGHTS RESERVED. ICP. 0000423255