Home > Research > Publications & Outputs > Statistical CSIT Aided User Scheduling for Broa...

Electronic data

  • Satistical CSIT Aided User Assignment for Broadcast MU-MISO Channels

    Rights statement: ©2017 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 643 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Statistical CSIT Aided User Scheduling for Broadcast MU-MISO System

Research output: Contribution to journalJournal article

Published
Close
<mark>Journal publication date</mark>07/2017
<mark>Journal</mark>IEEE Transactions on Vehicular Technology
Issue number7
Volume66
Number of pages13
Pages (from-to)6102-6114
Publication statusPublished
Early online date28/12/16
Original languageEnglish

Abstract

Abstract:
Recent studies show that the statistical channel state information (SCSI) helps to largely increase the capacity of communication systems when the instantaneous perfect CSI (IPCSI) is unavailable. In this paper, we consider multi-user multipleinput- single-output (MU-MISO) broadcast channels where the transmitter has the knowledge of SCSI. The major issue concerned in our work is to improve the average group-rate of the whole system by scheduling users over different time slots. With SCSI at the transmitter side, we are able to precode signals and hence compute the theoretical achievable group-rate of arbitrary user groups. Based on the group-rates, we propose tier-2 Munkres user scheduling algorithm (T2-MUSA) which leads to higher average group-rate than existing algorithms with generally better fairness. The optimality of the proposed algorithm in energy-fair user scheduling space is proved and we derive a lower bound of a special case to verify the validity of our simulations. In addition, many conventional user scheduling algorithms maintain queue stability by solving a weighted sum-rate (WSR) problem, using queue lengths to represent weight coefficients. Inspired by T2-MUSA we propose a QoS-based Munkres user scheduling algorithm (QB-MUSA) aimed at stabilizing queue lengths and maximizing throughput. In results, we show that QB-MUSA exhibits higher throughput than the conventional weighted sumrate (WSR) based algorithm.

Bibliographic note

©2017 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.