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

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 allocati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE wireless communications letters Jg. 9; H. 2; S. 152 - 156
Hauptverfasser: Saggese, Fabio, Moretti, Marco, Abrardo, Andrea
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.02.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Array signal processing
Beamforming
Clustering
Computer simulation
Covariance matrices
Downlink
Integer programming
Interference
Linear programming
MIMO
MIMO (control systems)
Mixed integer
NOMA
non-orthogonal multiple access
Nonorthogonal multiple access
Optimization
Receivers
Resource allocation
Resource management
weighted bipartite matching
ISSN:2162-2337, 2162-2345
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2162-2337
2162-2345
DOI:10.1109/LWC.2019.2946548