On the Throughput of Large-but-Finite MIMO Networks using Schedulers
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Online Publication Date2018-11-06
Print Publication Date2019-01
Permanent link to this recordhttp://hdl.handle.net/10754/629942
MetadataShow full item record
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.
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.