On the Throughput of Large-but-Finite MIMO Networks using Schedulers
Type
ArticleKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionElectrical Engineering Program
Date
2018-11-06Online Publication Date
2018-11-06Print Publication Date
2019-01Permanent link to this record
http://hdl.handle.net/10754/629942
Metadata
Show full item recordAbstract
This 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.Citation
Makki 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.arXiv
1811.05155Additional Links
https://ieeexplore.ieee.org/document/8520925ae974a485f413a2113503eed53cd6c53
10.1109/TWC.2018.2878252