In this letter we consider a resource allocation problem for multi-user MIMO non orthogonal multiple access (MU-MIMO-NOMA) downlink transmissions. Under the NOMA paradigm, users are organized in clusters of strong/weak pair and our aim is to find an optimal clustering, beamforming and power allocation scheme to minimize the power transmitted subject to a rate constraint for each user. Since the joint optimization problem is intractable, we split it in three sub-problems: clustering, which is formulated as a mixed integer linear programming (MILP) problem, beamforming and power allocation. Simulations results show that the our proposed scheme greatly outperforms both the classical OMA scheme and state-of-the-art NOMA techniques.

Saggese, F., Moretti, M., Abrardo, A. (2020). A Quasi-Optimal Clustering Algorithm for MIMO-NOMA Downlink Systems. IEEE WIRELESS COMMUNICATIONS LETTERS, 9(2), 152-156 [10.1109/LWC.2019.2946548].

A Quasi-Optimal Clustering Algorithm for MIMO-NOMA Downlink Systems

Abrardo, A.
2020-01-01

Abstract

In this letter we consider a resource allocation problem for multi-user MIMO non orthogonal multiple access (MU-MIMO-NOMA) downlink transmissions. Under the NOMA paradigm, users are organized in clusters of strong/weak pair and our aim is to find an optimal clustering, beamforming and power allocation scheme to minimize the power transmitted subject to a rate constraint for each user. Since the joint optimization problem is intractable, we split it in three sub-problems: clustering, which is formulated as a mixed integer linear programming (MILP) problem, beamforming and power allocation. Simulations results show that the our proposed scheme greatly outperforms both the classical OMA scheme and state-of-the-art NOMA techniques.
2020
Saggese, F., Moretti, M., Abrardo, A. (2020). A Quasi-Optimal Clustering Algorithm for MIMO-NOMA Downlink Systems. IEEE WIRELESS COMMUNICATIONS LETTERS, 9(2), 152-156 [10.1109/LWC.2019.2946548].
File in questo prodotto:
File Dimensione Formato  
A Quasi Optimal Clustering Algorithm.pdf

non disponibili

Tipologia: PDF editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 422.87 kB
Formato Adobe PDF
422.87 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

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/11365/1095394