Low Complexity User Scheduling Algorithms for Uplink Multiuser MIMO Systems

Liang Li; Ling Qiu; Guo Wei

6th International ICST Conference on Communications and Networking in China

Research Article

Low Complexity User Scheduling Algorithms for Uplink Multiuser MIMO Systems

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/ChinaCom.2011.6158145,
    author={Liang Li and Ling Qiu and Guo Wei},
    title={Low Complexity User Scheduling Algorithms for Uplink Multiuser MIMO Systems},
    proceedings={6th International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2012},
    month={3},
    keywords={Genetic algorithm (GA)  multiple-input multiple-output (MIMO)  multiuser scheduling},
    doi={10.1109/ChinaCom.2011.6158145}
}

Liang Li
Ling Qiu
Guo Wei
Year: 2012
Low Complexity User Scheduling Algorithms for Uplink Multiuser MIMO Systems
CHINACOM
IEEE
DOI: 10.1109/ChinaCom.2011.6158145

Liang Li¹, Ling Qiu¹^,*, Guo Wei¹

1: University of Science and Technology of China

*Contact email: lqiu@ustc.edu.cn

Abstract

This paper considers efficient and low complexity multiuser scheduling algorithms for the uplink multiple-input multiple-output systems. The exhaustive search algorithm (ESA) that gives the optimal performance, however, 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 problem: the improved genetic algorithm and simplified norm-based greedy algorithm. Numerical examples demonstrate that our proposed scheduling algorithms perform close to the optimal ESA, while with much lower complexity.

Keywords: Genetic algorithm (GA) multiple-input multiple-output (MIMO) multiuser scheduling

Published: 2012-03-27
Publisher: IEEE

: http://dx.doi.org/10.1109/ChinaCom.2011.6158145