SwePub - sökning: id:"swepub:oai:research.chalme...

Numrering	Referens	Omslagsbild	Hitta
1.	Makki, Behrooz, 1980, et al. (författare) On the Throughput of Large-but-Finite MIMO Networks Using Schedulers 2019 Ingår i: IEEE Transactions on Wireless Communications. - 1558-2248 .- 1536-1276. ; 18:1, s. 152-166 Tidskriftsartikel (refereegranskat)abstract 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' 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.

Makki, Behrooz, 1980, et al. (författare)
On the Throughput of Large-but-Finite MIMO Networks Using Schedulers
2019
Ingår i: IEEE Transactions on Wireless Communications. - 1558-2248 .- 1536-1276. ; 18:1, s. 152-166
Tidskriftsartikel (refereegranskat)abstract
- 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' 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.

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:e4de20c6-c611-418b-a472-80598b1b85f1" "

Avgränsa träffmängd