Low-Complexity WSRMax Precoder Design Using the Dual Coordinate Ascent Method

We propose a low-complexity precoder design for weighted sum rate maximization (WSRMax) in multiuser multiple-input-multiple-output systems with per-antenna power constraints (PAPCs). The proposed design is based on the alternating optimization framework and a fast dual coordinate ascent method in t...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE wireless communications letters Ročník 12; číslo 2; s. 1
Hlavní autori: Hu, Xianzhi, Dai, Xuchu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 01.02.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
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 We propose a low-complexity precoder design for weighted sum rate maximization (WSRMax) in multiuser multiple-input-multiple-output systems with per-antenna power constraints (PAPCs). The proposed design is based on the alternating optimization framework and a fast dual coordinate ascent method in the inner loop. Specifically, the original nonconvex WSRMax problem is first approximated as a sequence of convex quadratic optimization problems subject to PAPCs by adopting alternating optimization. Then, each convex quadratic problem is solved by a dual coordinate ascent method. The proposed dual coordinate ascent method includes no turning parameters, such as the step size in the projected gradient method, which offers both stability and fast convergence. Simulation results show that the dual coordinate ascent method converges faster than existing methods, which significantly improves the total computational efficiency of alternating optimization.
AbstractList We propose a low-complexity precoder design for weighted sum rate maximization (WSRMax) in multiuser multiple-input-multiple-output systems with per-antenna power constraints (PAPCs). The proposed design is based on the alternating optimization framework and a fast dual coordinate ascent method in the inner loop. Specifically, the original nonconvex WSRMax problem is first approximated as a sequence of convex quadratic optimization problems subject to PAPCs by adopting alternating optimization. Then, each convex quadratic problem is solved by a dual coordinate ascent method. The proposed dual coordinate ascent method includes no turning parameters, such as the step size in the projected gradient method, which offers both stability and fast convergence. Simulation results show that the dual coordinate ascent method converges faster than existing methods, which significantly improves the total computational efficiency of alternating optimization.
Author Dai, Xuchu
Hu, Xianzhi
Author_xml – sequence: 1
  givenname: Xianzhi
  orcidid: 0000-0001-8156-4286
  surname: Hu
  fullname: Hu, Xianzhi
  organization: School of Information Science and Technology, Key Laboratory of Wireless Optical Communication, Chinese Academy of Sciences, University of Science and Technology of China, Hefei, China
– sequence: 2
  givenname: Xuchu
  orcidid: 0000-0002-5190-7660
  surname: Dai
  fullname: Dai, Xuchu
  organization: School of Information Science and Technology, Key Laboratory of Wireless Optical Communication, Chinese Academy of Sciences, University of Science and Technology of China, Hefei, China
BookMark eNp9kEtrwkAURofSQq11X-hmoOvYeSSZZCnpE5SWtuIyzOOqI5qxMyPVf9-I4qKL3s13F9-5F84VOm9cAwjdUNKnlJT3w0nVZ4SxPmdMkKw4Qx1Gc5Ywnmbnp52LS9QLYUHayQlltOig0dD9JJVbrZewtXGHJ58fI7nF7x60M-DxAwQ7a_A42GaG4xzww0YuceWcN7aREfAgaGgiHkGcO3ONLqZyGaB3zC4aPz1-VS_J8O35tRoME80YjYnhWqsSQKQqS7UqoBC0pIoZk2apUYJPi7IwqhBqmmvJlTSairQwgqe5UJDyLro73F17972BEOuF2_imfVkzITJKOGWsbeWHlvYuBA_TWtsoo3VN9NIua0rqvb26tVfv7dVHey1I_oBrb1fS7_5Dbg-IBYBTvSwFFbzkv9Lte4c
CODEN IWCLAF
CitedBy_id crossref_primary_10_1109_TWC_2023_3279095
crossref_primary_10_1109_TSP_2024_3364914
Cites_doi 10.1109/WCNC.2015.7127560
10.1109/TVT.2017.2776356
10.1109/TSP.2011.2147784
10.1109/TVT.2018.2849021
10.1109/COMST.2016.2618870
10.1109/TSP.2011.2179538
10.1109/ACCESS.2021.3073325
10.1109/TWC.2018.2890474
10.1109/TWC.2018.2880436
10.1109/TSP.2017.2762289
10.1109/MSP.2010.936019
10.1109/TSP.2013.2247597
10.1109/TWC.2019.2927670
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/LWC.2022.3227058
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
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 1
ExternalDocumentID 10_1109_LWC_2022_3227058
9971739
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: Grant 61971391
  funderid: 10.13039/501100001809
GroupedDBID 0R~
4.4
6IK
97E
AAJGR
AASAJ
AAWTH
ABQJQ
ABVLG
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
IES
IFIPE
IPLJI
JAVBF
M43
OCL
RIA
RIE
RNS
5VS
AAYXX
AGSQL
CITATION
EJD
7SP
8FD
ABAZT
L7M
ID FETCH-LOGICAL-c221t-d3ccb9ee74b54cb8e87191b2dd454db73f898db87bf6ca3badc1748d73467be43
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000966314700001&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 Sun Nov 09 08:33:36 EST 2025
Sat Nov 29 03:22:52 EST 2025
Tue Nov 18 21:27:59 EST 2025
Tue Nov 25 14:44:28 EST 2025
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-c221t-d3ccb9ee74b54cb8e87191b2dd454db73f898db87bf6ca3badc1748d73467be43
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-8156-4286
0000-0002-5190-7660
PQID 2775103122
PQPubID 2040496
PageCount 1
ParticipantIDs proquest_journals_2775103122
crossref_citationtrail_10_1109_LWC_2022_3227058
crossref_primary_10_1109_LWC_2022_3227058
ieee_primary_9971739
PublicationCentury 2000
PublicationDate 2023-02-01
PublicationDateYYYYMMDD 2023-02-01
PublicationDate_xml – month: 02
  year: 2023
  text: 2023-02-01
  day: 01
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE wireless communications letters
PublicationTitleAbbrev LWC
PublicationYear 2023
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
ref15
ref14
ref10
Jaeckel (ref12) 2020
ref2
ref1
ref8
Wang (ref11) 2014; 15
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref5
  doi: 10.1109/WCNC.2015.7127560
– ident: ref14
  doi: 10.1109/TVT.2017.2776356
– ident: ref3
  doi: 10.1109/TSP.2011.2147784
– ident: ref15
  doi: 10.1109/TVT.2018.2849021
– ident: ref2
  doi: 10.1109/COMST.2016.2618870
– year: 2020
  ident: ref12
  article-title: QuaDRiGa-quasi deterministic radio channel generator, user manual and documentation
– ident: ref9
  doi: 10.1109/TSP.2011.2179538
– volume: 15
  start-page: 1523
  issue: 1
  year: 2014
  ident: ref11
  article-title: Iteration complexity of feasible descent methods for convex optimization
  publication-title: J. Mach. Learn. Res.
– ident: ref1
  doi: 10.1109/ACCESS.2021.3073325
– ident: ref6
  doi: 10.1109/TWC.2018.2890474
– ident: ref13
  doi: 10.1109/TWC.2018.2880436
– ident: ref7
  doi: 10.1109/TSP.2017.2762289
– ident: ref10
  doi: 10.1109/MSP.2010.936019
– ident: ref4
  doi: 10.1109/TSP.2013.2247597
– ident: ref8
  doi: 10.1109/TWC.2019.2927670
SSID ssj0000601218
Score 2.296378
Snippet We propose a low-complexity precoder design for weighted sum rate maximization (WSRMax) in multiuser multiple-input-multiple-output systems with per-antenna...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1
SubjectTerms Ascent
Complexity
Convergence
Covariance matrices
Design optimization
dual coordinate ascent
Gradient methods
Linear programming
MIMO communication
Multiuser MIMO
Optimization
per-antenna power constraints
Precoding
Transmitting antennas
weighted sum rate maximization
Title Low-Complexity WSRMax Precoder Design Using the Dual Coordinate Ascent Method
URI https://ieeexplore.ieee.org/document/9971739
https://www.proquest.com/docview/2775103122
Volume 12
WOSCitedRecordID wos000966314700001&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/eLvHCXMwlV1LSwMxEB6seNCDb7FaJQcvgmu72UeSo7QWD60U37dlk0yhIF3pw8e_d5JuS0ERvO1hEpaZTDLfZPINwFk_5Ca3DQx4rgmgcB2Tz8X9wGhMElcWZX3C7akjbm_ly4vqrcDF4i0MIvriM7x0n_4u3xZm6lJldaXcnbGqQEUIMXurtcinOF4R7tN5PEx5wKNIzG8lG6reeW4SFuT8ktavaLj-7kunkG-r8mMv9gdMe-t_v7YNm2Ugya5mlt-BFRzuwsYSveAedDvFR-Ac3pFeTr7Y8_1dN_9kPQeCLY5Yy1dvMF81wCgQZK0pzdgsCI8OhhSDsitP9cS6vsv0Pjy2rx-aN0HZPiEwnIeTwEbGaIUoYp3ERkskbKRCza2NyQRaRH2ppNVS6H5q8kjn1hA8kVZEtHlqjKMDWB0WQzwElsZpYpNEkEhECBAlhYUql2miJAkjVqE-V2dmSm5x1-LiNfMYo6EyMkDmDJCVBqjC-WLE24xX4w_ZPafwhVyp6yrU5hbLSscbZ1wIxxEYcn70-6hjWHcd42eF1zVYnYymeAJr5n0yGI9O_Zr6BvrKyA0
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dSyMxEB-0CuqDnydXP_Pgi-Dabja7SR5LVRS3RdQ7fVs2yRSEoz1qe6f_vZN0WwRF8G0fJmGZySTzm0x-A3DUi7ktXRMjXhoCKNwI8jnRi6zBNPVlUS4k3H7nsttVj4_6Zg5OZm9hEDEUn-Gp_wx3-W5gxz5V1tDa3xnreVhIheDx5LXWLKPimUV4SOjxOOMRTxI5vZds6kb-0CY0yPkprWDZ9B3e351DobHKh904HDEXa9_7uXVYrUJJ1prYfgPmsL8JK-8IBregkw_-R97lPe3l6JU93N12yhd242GwwyE7C_UbLNQNMAoF2dmYZmwPCJE-9SkKZa1A9sQ6oc_0D_h1cX7fvoyqBgqR5TweRS6x1mhEKUwqrFFI6EjHhjsnyAhGJj2llTNKml5my8SUzhJAUU4mtH0aFMk21PqDPv4EloksdWkqSSQhDIiKAkNdqizVioQR69CYqrOwFbu4b3Lxpwgoo6kLMkDhDVBUBqjD8WzE3wmzxheyW17hM7lK13XYm1qsqFzvueBSepbAmPOdz0cdwtLlfScv8qvu9S4s-_7xkzLsPaiNhmPch0X7b_T0PDwI6-sNj2HLVA
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=Low-Complexity+WSRMax+Precoder+Design+Using+the+Dual+Coordinate+Ascent+Method&rft.jtitle=IEEE+wireless+communications+letters&rft.au=Hu%2C+Xianzhi&rft.au=Dai%2C+Xuchu&rft.date=2023-02-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=2162-2337&rft.eissn=2162-2345&rft.volume=12&rft.issue=2&rft.spage=361&rft_id=info:doi/10.1109%2FLWC.2022.3227058&rft.externalDBID=NO_FULL_TEXT
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