Parallelizable First-Order Fast Algorithm for Symbol-Level Precoding in Lage-Scale Systems
We investigate constructive interference (CI)-based symbol-level precoding (SLP) in large-scale systems with massive connectivity of users to minimize the transmit power subject to the instantaneous signal-to-interference-plus-noise-ratio (SINR) and CI constraints. By converting the considered probl...
Uloženo v:
| Vydáno v: | IEEE Vehicular Technology Conference s. 1 - 6 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.06.2023
|
| Témata: | |
| ISSN: | 2577-2465 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We investigate constructive interference (CI)-based symbol-level precoding (SLP) in large-scale systems with massive connectivity of users to minimize the transmit power subject to the instantaneous signal-to-interference-plus-noise-ratio (SINR) and CI constraints. By converting the considered problem into a novel separable formulation, we reveal the existence of separability in SLP, which is therefore well-suited for decomposition. The proximal Jacobian alternating direction method of multipliers (PJ-ADMM) framework is adopted to decompose the reformulated problem into multiple subproblems, which can be solved in parallel with closed-form solutions. We further linearize the second-order terms by approximation, which leads to a parallelizable first-order fast solution to SLP. Our derivations are validated by simulation results, which also show that our algorithm can provide optimal performance with substantially lower computational complexity than state-of-the-art algorithms. |
|---|---|
| AbstractList | We investigate constructive interference (CI)-based symbol-level precoding (SLP) in large-scale systems with massive connectivity of users to minimize the transmit power subject to the instantaneous signal-to-interference-plus-noise-ratio (SINR) and CI constraints. By converting the considered problem into a novel separable formulation, we reveal the existence of separability in SLP, which is therefore well-suited for decomposition. The proximal Jacobian alternating direction method of multipliers (PJ-ADMM) framework is adopted to decompose the reformulated problem into multiple subproblems, which can be solved in parallel with closed-form solutions. We further linearize the second-order terms by approximation, which leads to a parallelizable first-order fast solution to SLP. Our derivations are validated by simulation results, which also show that our algorithm can provide optimal performance with substantially lower computational complexity than state-of-the-art algorithms. |
| Author | Li, Ang Yang, Junwen Masouros, Christos Liao, Xuewen |
| Author_xml | – sequence: 1 givenname: Junwen surname: Yang fullname: Yang, Junwen email: jwyang@stu.xjtu.edu.cn organization: Xi'an Jiaotong University,School of Information and Communications Engineering,Xi'an,China – sequence: 2 givenname: Ang surname: Li fullname: Li, Ang email: ang.li.2020@xjtu.edu.cn organization: Xi'an Jiaotong University,School of Information and Communications Engineering,Xi'an,China – sequence: 3 givenname: Xuewen surname: Liao fullname: Liao, Xuewen email: yeplos@mail.xjtu.edu.cn organization: Xi'an Jiaotong University,School of Information and Communications Engineering,Xi'an,China – sequence: 4 givenname: Christos surname: Masouros fullname: Masouros, Christos email: c.masouros@ucl.ac.uk organization: University College London,Department of Electronic and Electrical Engineering,London,UK |
| BookMark | eNo1kE9LwzAchqMouM19Aw-5esjML2n-9DiGVaGwQacHLyNN0xlJW0mKMD-9FfX0wnt4eN9nji76oXcI3QJdAdD87mW_YZRxUn1E3x-FkqBXP8UKKOS5FPoMLXOVay4oB4CMn6MZE0oRlklxheYpvVNKASSbodediSYEF_yXqYPDhY9pJNvYuIgLk0a8Dsch-vGtw-0QcXXq6iGQ0n26gHfR2aGZJmDf49IcHamsmRjVKY2uS9fosjUhueVfLtBzcb_fPJJy-_C0WZfEM5qNRGSKOgMcGsWz2lowdSYaZhmVumFSaqO40VoBq3kLloPmLFeWtU1WT9cFX6CbX653zh0mJ52Jp8O_C_4NWedYHw |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/VTC2023-Spring57618.2023.10199658 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) (UW System Shared) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9798350311143 |
| EISSN | 2577-2465 |
| EndPage | 6 |
| ExternalDocumentID | 10199658 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Research and Development funderid: 10.13039/100006190 – fundername: Southeast University funderid: 10.13039/501100008081 |
| GroupedDBID | -~X 29I 6IE 6IH AFFNX AI. ALMA_UNASSIGNED_HOLDINGS CBEJK RIE RIO RNS VH1 |
| ID | FETCH-LOGICAL-i204t-5470ea131d734bcc1ab45d2c2068d2668a73a88712b3f1c3183297c2fd4b76153 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001054797200138&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Nov 26 07:26:18 EST 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i204t-5470ea131d734bcc1ab45d2c2068d2668a73a88712b3f1c3183297c2fd4b76153 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_10199658 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-June |
| PublicationDateYYYYMMDD | 2023-06-01 |
| PublicationDate_xml | – month: 06 year: 2023 text: 2023-June |
| PublicationDecade | 2020 |
| PublicationTitle | IEEE Vehicular Technology Conference |
| PublicationTitleAbbrev | VTC |
| PublicationYear | 2023 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0001162 |
| Score | 2.220997 |
| Snippet | We investigate constructive interference (CI)-based symbol-level precoding (SLP) in large-scale systems with massive connectivity of users to minimize the... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | ADMM Approximation algorithms constructive interference Downlink Interference Jacobian matrices Massive MU-MISO parallel and distributed computing Precoding separability Simulation symbol-level precoding Vehicular and wireless technologies |
| Title | Parallelizable First-Order Fast Algorithm for Symbol-Level Precoding in Lage-Scale Systems |
| URI | https://ieeexplore.ieee.org/document/10199658 |
| WOSCitedRecordID | wos001054797200138&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED7RCiFYeBWVpzywMLjEzsPpiCoihqpUakEVS-VXIFKboDRF4t9ju2mBgYHNynCKfPLd-fzd9wFcy4hHHucpFmlsSbVjD3MmPKxSITnTqcmCyolNsMEgnky6w3pY3c3CaK0d-Ex37NK95atCLm2rzJxwi5kN4wY0GGOrYa1N2CUkojtwU5No3j6Pe1YZHK_6Y6aqJhbIRf3O2sgvORWXTZL9f_7HAbS-5_LQcJNxDmFL50ew94NS8Bhehry08igOrTXTKMlMeYcfLcEmSviiQnez16LMqrc5MuUqGn3ORTHDfQsdMqbNXdRaRlmO-ibQ4JHxoEY1q3kLnpL7ce8B1_oJOKNeUOEwYJ7mxCeK-YGQknARhIpK6kWxMok55sznJsgQKvyUSHe6u0zSVAWC2ULwBJp5kes2IKJ9ykRXS0VkoJQQkRQsSJW9wbBQ01No2W2avq8oMqbrHTr74_s57DrvuHbGBTSrcqkvYVt-VNmivHKO_QKMMKTj |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagIB4LryLeeGBhcIkdJ05HVFGBCKVSC6pYKr8CkdoEpSkS_x7bTQsMDGxWhlPkk-_O5---D4ALGfLQ4zxBIoksqXbkIc6Eh1QiJGc6MVlQObEJ1ulEg0GzWw2ru1kYrbUDn-mGXbq3fJXLqW2VmRNuMbNBtAxWAkoJno1rLQIvxiFZA5cVjebVc79ltcHRrENm6mpsoVzEb8zN_BJUcfmkvfXPP9kG9e_JPNhd5JwdsKSzXbD5g1RwD7x0eWEFUhxea6RhOzUFHnq0FJuwzSclvB695kVavo2hKVhh73Ms8hGKLXjImDa3UWsZphmMTahBPeNDDSte8zp4at_0W7eoUlBAKfFoiQLKPM2xjxXzqZASc0EDRSTxwkiZ1Bxx5nMTZjARfoKlO99NJkmiqGC2FNwHtSzP9AGAWPuEiaaWCkuqlBChFIwmyt5hWKDJIajbbRq-z0gyhvMdOvrj-zlYv-0_xMP4rnN_DDacp1xz4wTUymKqT8Gq_CjTSXHmnPwFT6aoKg |
| 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%3Abook&rft.genre=proceeding&rft.title=IEEE+Vehicular+Technology+Conference&rft.atitle=Parallelizable+First-Order+Fast+Algorithm+for+Symbol-Level+Precoding+in+Lage-Scale+Systems&rft.au=Yang%2C+Junwen&rft.au=Li%2C+Ang&rft.au=Liao%2C+Xuewen&rft.au=Masouros%2C+Christos&rft.date=2023-06-01&rft.pub=IEEE&rft.eissn=2577-2465&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FVTC2023-Spring57618.2023.10199658&rft.externalDocID=10199658 |