We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
This paper studies the sum throughput of the multi-user multiple-input-single-output networks in the cases with a large-but-finite number of transmit antennas and users. Considering continuous and bursty communication scenarios with different users\u27 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\u27 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\u27 inefficiency and the scheduling delay affect the performance of the scheduling-based systems significantly
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.