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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE wireless communications letters Ročník 9; číslo 2; s. 152 - 156
Hlavní autori: Saggese, Fabio, Moretti, Marco, Abrardo, Andrea
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 01.02.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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.
AbstractList 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.
Author Abrardo, Andrea
Moretti, Marco
Saggese, Fabio
Author_xml – sequence: 1
  givenname: Fabio
  orcidid: 0000-0002-5776-3936
  surname: Saggese
  fullname: Saggese, Fabio
  email: fabio.saggese@phd.unipi.it
  organization: Dipartimento di Ingegneria dell'Informazione, University of Pisa, Pisa, Italy
– sequence: 2
  givenname: Marco
  orcidid: 0000-0002-3822-0995
  surname: Moretti
  fullname: Moretti, Marco
  email: marco.moretti@iet.unipi.it
  organization: Dipartimento di Ingegneria dell'Informazione, University of Pisa, Pisa, Italy
– sequence: 3
  givenname: Andrea
  orcidid: 0000-0002-8006-0710
  surname: Abrardo
  fullname: Abrardo, Andrea
  email: abrardo@dii.unisi.it
  organization: Dipartimento di Ingegneria dell'Informazione, University of Siena, Siena, Italy
BookMark eNp9kD1PwzAQhi0EEqV0R2KJxJzij8SOxyh8VWqJECBGy3Wd4pLGxXaE-u9x1aoDA7fcDe9zp3suwGlnOw3AFYJjhCC_nX5UYwwRH2Oe0TwrTsAAI4pTTLL89DgTdg5G3q9gLAoRRsUAVGXy0ktv0noTzFq2SdX2PmhnumVStkvrTPhcJ411yWwyq9PnelYmd_ana033lbxuY3TtL8FZI1uvR4c-BO8P92_VUzqtHydVOU0VISSk80ZzzmRWNGoOJWVMY1woiakmSMGmQWpBEZ_zRUbZguV5QSSiElIKmYZESjIEN_u9G2e_e-2DWNnedfGkwCTPKMKE0ZiC-5Ry1nunG7Fx8TO3FQiKnS0RbYmdLXGwFRH6B1EmyGBsF5w07X_g9R40WuvjnaKghGNEfgEsS3bp
CODEN IWCLAF
CitedBy_id crossref_primary_10_1002_ett_4794
crossref_primary_10_1007_s10922_023_09764_x
crossref_primary_10_1109_TSP_2025_3553084
crossref_primary_10_1109_TSP_2025_3584665
crossref_primary_10_1109_LCOMM_2022_3197701
crossref_primary_10_1109_LWC_2021_3076579
crossref_primary_10_1109_TWC_2020_3021036
crossref_primary_10_1016_j_aej_2024_10_097
crossref_primary_10_1109_ACCESS_2023_3296788
crossref_primary_10_1109_TWC_2024_3402550
crossref_primary_10_3390_en13164106
crossref_primary_10_1109_LWC_2025_3543172
crossref_primary_10_7717_peerj_cs_2388
crossref_primary_10_1109_TSP_2023_3300633
crossref_primary_10_1109_TVT_2021_3077270
Cites_doi 10.1109/TCOMM.2015.2394393
10.1109/ACCESS.2017.2779855
10.1109/TSP.2003.821107
10.1109/TVT.2016.2627218
10.1109/TSP.2016.2603971
10.1109/MWC.2018.1700099
10.1109/JSAC.2017.2725519
10.1109/ACCESS.2016.2598380
10.1109/VTCSpring.2013.6692652
10.1109/TSP.2004.840816
10.1109/4234.913148
10.1109/TWC.2016.2542066
10.1109/JSAC.2017.2725879
10.1109/TWC.2012.120412.120355
10.1109/MILCOM.2013.218
10.1109/LSP.2014.2337951
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/LWC.2019.2946548
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2162-2345
EndPage 156
ExternalDocumentID 10_1109_LWC_2019_2946548
8863921
Genre orig-research
GroupedDBID 0R~
4.4
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
IES
IFIPE
IPLJI
JAVBF
M43
OCL
RIA
RIE
RNS
AAYXX
CITATION
7SP
8FD
L7M
ID FETCH-LOGICAL-c333t-bfe997a48fcb0a677e228ca26e31c0ff1cd619b9d467d75583a16a06607e03aa3
IEDL.DBID RIE
ISICitedReferencesCount 18
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000515817000006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2162-2337
IngestDate Mon Jun 30 07:01:56 EDT 2025
Sat Nov 29 06:26:14 EST 2025
Tue Nov 18 21:35:38 EST 2025
Wed Aug 27 06:24:19 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c333t-bfe997a48fcb0a677e228ca26e31c0ff1cd619b9d467d75583a16a06607e03aa3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-8006-0710
0000-0002-3822-0995
0000-0002-5776-3936
OpenAccessLink http://hdl.handle.net/11568/1018315
PQID 2354612376
PQPubID 2040496
PageCount 5
ParticipantIDs crossref_primary_10_1109_LWC_2019_2946548
crossref_citationtrail_10_1109_LWC_2019_2946548
proquest_journals_2354612376
ieee_primary_8863921
PublicationCentury 2000
PublicationDate 2020-02-01
PublicationDateYYYYMMDD 2020-02-01
PublicationDate_xml – month: 02
  year: 2020
  text: 2020-02-01
  day: 01
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE wireless communications letters
PublicationTitleAbbrev LWC
PublicationYear 2020
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref11
ref10
huang (ref17) 2007
ref2
ref1
ref16
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref4
  doi: 10.1109/TCOMM.2015.2394393
– ident: ref10
  doi: 10.1109/ACCESS.2017.2779855
– ident: ref13
  doi: 10.1109/TSP.2003.821107
– ident: ref7
  doi: 10.1109/TVT.2016.2627218
– ident: ref5
  doi: 10.1109/TSP.2016.2603971
– ident: ref12
  doi: 10.1109/MWC.2018.1700099
– ident: ref1
  doi: 10.1109/JSAC.2017.2725519
– ident: ref6
  doi: 10.1109/ACCESS.2016.2598380
– ident: ref2
  doi: 10.1109/VTCSpring.2013.6692652
– ident: ref15
  doi: 10.1109/TSP.2004.840816
– ident: ref14
  doi: 10.1109/4234.913148
– ident: ref8
  doi: 10.1109/TWC.2016.2542066
– ident: ref9
  doi: 10.1109/JSAC.2017.2725879
– ident: ref11
  doi: 10.1109/TWC.2012.120412.120355
– start-page: 195
  year: 2007
  ident: ref17
  article-title: Loopy belief propagation for bipartite maximum weight b-matching
  publication-title: Proc Artif Intell Stat
– ident: ref3
  doi: 10.1109/MILCOM.2013.218
– ident: ref16
  doi: 10.1109/LSP.2014.2337951
SSID ssj0000601218
Score 2.308663
Snippet In this letter we consider a resource allocation problem for multi-user MIMO non orthogonal multiple access (MU-MIMO-NOMA) downlink transmissions. Under the...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 152
SubjectTerms 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
Title A Quasi-Optimal Clustering Algorithm for MIMO-NOMA Downlink Systems
URI https://ieeexplore.ieee.org/document/8863921
https://www.proquest.com/docview/2354612376
Volume 9
WOSCitedRecordID wos000515817000006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 2162-2345
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000601218
  issn: 2162-2337
  databaseCode: RIE
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA9zeNCDX1OcTsnBi2C2Lkmb5FiqQ8FtCoq7lTRNdbAP2Vr_fpOsK4oieCv0hZZf2veV934PgAuceJnxuynKUpwimiiFuLEkiGtJGSaEYizdsAk2GPDRSDzUwFXVC6O1dsVnum0v3Vl-OleFTZV1ODf21HaNbzDGVr1aVT7F8opgl87D3QAj8xi2PpX0ROf-JbJlXKKNhSUQ49-skBur8kMXOwPT2_3fq-2BndKRhOFq5_dBTc8OwPYXesEGiEL4WMjlGA2NXpga4WhSWF4EcxOGk9f5Ypy_TaHxWmH_rj9Eg2E_hNeWPN_Ep7CkMj8Ez72bp-gWlUMTkCKE5CjJtBBMUp6pxJMBYxpjriQONOkqL8u6KjUxUyJSoyFT5vucyG4gjePhMe0RKckRqM_mM30MYKJ9ZUWIbaCVRh2lhGqNVcYSQjMsmqCzBjFWJaO4HWwxiV1k4YnYwB5b2OMS9ia4rFa8r9g0_pBtWJgruRLhJmit9ykuf7dljIlPLY8MC05-X3UKtrANlF25dQvU80Whz8Cm-sjHy8W5-5I-AVq2w5E
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB5EBfXgW1yfPXgRjNtO0iY5LquiuA8FRW8lTVNdWHdlH_5-k2x3URTBW6ETWr6088rMNwAnmIWF9bsZKXLMCcu0JsJaEiKMYhwpZYjKD5vgrZZ4fpZ3c3A264UxxvjiM3PuLv1Zft7XY5cqqwph7anrGl-IGcNo0q01y6g4ZhH0CT2MEiT2QXx6LhnKauOp7gq55DlKRyEmvtkhP1jlhzb2JuZq7X8vtw6rpSsZ1CZ7vwFzprcJK18IBregXgvux2rYIW2rGd6scL07dswI9mZQ6770B53R61tg_dagedNsk1a7WQsuHH2-jVCDksx8Gx6vLh_q16Qcm0A0pXREssJIyRUThc5ClXBuEIVWmBga6bAoIp3bqCmTudWROY9jQVWUKOt6hNyEVCm6A_O9fs_sQpCZWDsR6lpolVVIOWXGoC54RlmBsgLVKYipLjnF3WiLbupji1CmFvbUwZ6WsFfgdLbifcKn8YfsloN5JlciXIGD6T6l5Q83TJHGzDHJ8GTv91XHsHT90GykjZvW7T4sowubffH1AcyPBmNzCIv6Y9QZDo78V_UJtRzG2A
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Quasi-Optimal+Clustering+Algorithm+for+MIMO-NOMA+Downlink+Systems&rft.jtitle=IEEE+wireless+communications+letters&rft.au=Saggese%2C+Fabio&rft.au=Moretti%2C+Marco&rft.au=Abrardo%2C+Andrea&rft.date=2020-02-01&rft.issn=2162-2337&rft.eissn=2162-2345&rft.volume=9&rft.issue=2&rft.spage=152&rft.epage=156&rft_id=info:doi/10.1109%2FLWC.2019.2946548&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LWC_2019_2946548
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2162-2337&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2162-2337&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2162-2337&client=summon