On the Throughput of Large-but-Finite MIMO Networks using Schedulers

Abstract

This paper studies the sum throughput of the {multi-user} 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-closed-form 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.

References in corpus (6)

• Network MIMO with Linear Zero-Forcing Beamforming: Large System Analysis, Impact of Channel Estimation and Reduced-Complexity Scheduling
• Multi-Cell MIMO Downlink with Cell Cooperation and Fair Scheduling: a Large-System Limit Analysis
• Maximum Sum-Rate of MIMO Multiuser Scheduling with Linear Receivers
• Sum Rates, Rate Allocation, and User Scheduling for Multi-User MIMO Vector Perturbation Precoding
• Joint Sum Rate And Error Probability Optimization: Finite Blocklength Analysis
• Tomlinson-Harashima Precoding for Multiuser MIMO Systems with Quantized CSI Feedback and User Scheduling