Show simple item record

dc.contributor.authorMakki, Behrooz
dc.contributor.authorSvensson, Tommy
dc.contributor.authorAlouini, Mohamed-Slim
dc.date.accessioned2018-11-21T13:11:22Z
dc.date.available2018-11-21T13:11:22Z
dc.date.issued2018-11-06
dc.identifier.citationMakki B, Svensson T, Alouini M-S (2018) On the Throughput of Large-but-Finite MIMO Networks using Schedulers. IEEE Transactions on Wireless Communications: 1–1. Available: http://dx.doi.org/10.1109/TWC.2018.2878252.
dc.identifier.issn1536-1276
dc.identifier.issn1558-2248
dc.identifier.doi10.1109/TWC.2018.2878252
dc.identifier.urihttp://hdl.handle.net/10754/629942
dc.description.abstractThis paper studies the sum throughput of the multiuser multiple-input-single-output (MISO) networks in the cases with large but finite number of transmit antennas and users. Considering continuous and bursty communication scenarios with different users’ data request probabilities, we derive quasi-closedform expressions for the maximum achievable throughput of the networks using optimal schedulers. The results are obtained in various cases with different levels of interference cancellation. Also, we develop an efficient scheduling scheme using genetic algorithms (GAs), and evaluate the effect of different parameters, such as channel/precoding models, number of antennas/users, scheduling costs and power amplifiers’ efficiency, on the system performance. Finally, we use the recent results on the achievable rates of finite block-length codes to analyze the system performance in the cases with short packets. As demonstrated, the proposed GA-based scheduler reaches (almost) the same throughput as in the exhaustive search-based optimal scheduler, with substantially less implementation complexity. Moreover, the power amplifiers’ inefficiency and the scheduling delay affect the performance of the scheduling-based systems significantly.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttps://ieeexplore.ieee.org/document/8520925
dc.rights(c) 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
dc.subjectComplexity theory
dc.subjectMIMO communication
dc.subjectOptimal scheduling
dc.subjectScheduling
dc.subjectScheduling algorithms
dc.subjectThroughput
dc.subjectTransmitting antennas
dc.titleOn the Throughput of Large-but-Finite MIMO Networks using Schedulers
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.identifier.journalIEEE Transactions on Wireless Communications
dc.eprint.versionPost-print
dc.contributor.institutionChalmers University of Technology, Gothenburg, Sweden.
dc.identifier.arxivid1811.05155
kaust.personAlouini, Mohamed-Slim
refterms.dateFOA2018-11-22T10:58:00Z
dc.date.published-online2018-11-06
dc.date.published-print2019-01


Files in this item

Thumbnail
Name:
08520925.pdf
Size:
623.2Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record