In this paper, a Low earth orbit (LEO) High-Throughput Satellite (HTS) Multi-User multiple-input multiple-output (MIMO) system is considered. With the objective of minimizing inter-beam interference among users, we propose a joint graph-based user scheduling and feed space beamforming framework for the downlink. First, we construct a graph where the vertices are the users and edges are based on a dissimilarity measure of their channels. Secondly, we design a low complexity greedy user clustering strategy, in which we iteratively search for the maximum clique in the graph. Finally, a Minimum Mean Square Error (MMSE) beamforming matrix is applied on a cluster basis with different power normalization schemes. A heuristic optimization of the graph density, i.e., optimal cluster size, is performed in order to maximize the system capacity. The proposed scheduling algorithm is compared with a position-based scheduler, in which a beam lattice is generated on ground and one user per beam is randomly selected to form a cluster. Results are presented in terms of achievable per-user capacity and show the superiority in performance of the proposed scheduler w.r.t. to the position-based approach.

Joint Graph-based User Scheduling and Beamforming in LEO-MIMO Satellite Communication Systems

Riviello D. G.
Primo
;
2022

Abstract

In this paper, a Low earth orbit (LEO) High-Throughput Satellite (HTS) Multi-User multiple-input multiple-output (MIMO) system is considered. With the objective of minimizing inter-beam interference among users, we propose a joint graph-based user scheduling and feed space beamforming framework for the downlink. First, we construct a graph where the vertices are the users and edges are based on a dissimilarity measure of their channels. Secondly, we design a low complexity greedy user clustering strategy, in which we iteratively search for the maximum clique in the graph. Finally, a Minimum Mean Square Error (MMSE) beamforming matrix is applied on a cluster basis with different power normalization schemes. A heuristic optimization of the graph density, i.e., optimal cluster size, is performed in order to maximize the system capacity. The proposed scheduling algorithm is compared with a position-based scheduler, in which a beam lattice is generated on ground and one user per beam is randomly selected to form a cluster. Results are presented in terms of achievable per-user capacity and show the superiority in performance of the proposed scheduler w.r.t. to the position-based approach.
2022
Istituto di Elettronica e di Ingegneria dell'Informazione e delle Telecomunicazioni - IEIIT
978-1-6654-7378-1
978-1-6654-7377-4
Beamforming
LEO
MMSE
MU-MIMO
User Scheduling
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/515770
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ente

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 18
  • ???jsp.display-item.citation.isi??? 8
social impact