Loading…
Clustering strategies for multicast precoding in multibeam satellite systems
Summary Next generation multibeam SatCom architectures will heavily exploit full frequency reuse schemes along with interference management techniques, eg, precoding or multiuser detection, to drastically increase the system throughput. In this framework, we address the problem of the user selection...
Saved in:
Published in: | International journal of satellite communications and networking 2020-03, Vol.38 (2), p.85-104 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Summary
Next generation multibeam SatCom architectures will heavily exploit full frequency reuse schemes along with interference management techniques, eg, precoding or multiuser detection, to drastically increase the system throughput. In this framework, we address the problem of the user selection for multicast precoding by formulating it as a clustering problem. By introducing a novel mathematical framework, we design fixed/variable size clustering algorithms that group users into simultaneously precoded and served clusters while maximising the system throughput. Numerical simulations are used to validate the proposed algorithms and to identify the main system‐level trade‐offs.
In this paper, the user selection for multicast precoding satellite communication systems is formulated as a clustering problem. A novel mathematical framework is introduced, and fixed‐/variable‐size clustering algorithms are designed based on Euclidean distance and channel coefficients similarities. Extensive analyses on the main system‐level trade‐offs are provided based on average spectral efficiencies as a function of both the cluster size and the transmission power, the cluster size probability for variable‐size solutions, cumulative distribution functions of the SINR, and computational complexity. |
---|---|
ISSN: | 1542-0973 1542-0981 |
DOI: | 10.1002/sat.1312 |