Rapidly Converging Low-Complexity Iterative Transmit Precoders for Massive MIMO Downlink

In this paper, rapidly converging low-complexity iterative transmit precoding (TPC) techniques are proposed for the massive multiple-input multiple-output (MIMO) downlink. First of all, the proposed random block-based iterative TPC (RBI-TPC) algorithm performs its iterations by updating multiple rat...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on communications Ročník 71; číslo 12; s. 1
Hlavní autoři:	Wang, Zheng, Wang, Jiaheng, Gao, Zhen, Huang, Yongming, Ng, Derrick Wing Kwan, Hanzo, Lajos
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Complexity Convergence Downlink Downlinking Iterative algorithms iterative methods Jacobian matrices low-complexity linear transmit precoding Massive MIMO Precoding Random sampling Symmetric matrices
ISSN:	0090-6778, 1558-0857
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	In this paper, rapidly converging low-complexity iterative transmit precoding (TPC) techniques are proposed for the massive multiple-input multiple-output (MIMO) downlink. First of all, the proposed random block-based iterative TPC (RBI-TPC) algorithm performs its iterations by updating multiple rather than a single component at each instant, where the updating order of each block containing multiple components relies on the samples randomly sampled from a discrete distribution. Based on the analytically derived convergence rate, we demonstrate that improved convergence is achieved by the block-based update mechanism conceived since the correlation between multiple components can be beneficially exploited. Then, the random sampling that determines the updating order is studied. By applying conditional random sampling, the updating order is optimized based on the latest updates for attaining more rapid convergence. We also demonstrate that the associated updating order may become deterministic under specific conditions so that a fixed but optimized updating order can be used for facilitating the practical implementations, which paves the way for conceiving the ordered block-based iterative TPC (OBI-TPC) algorithm. Finally, the concept of successive over-relaxation (SOR) is adopted for further convergence improvement and simulations are presented to illustrate the performance improvements of the proposed RBI and OBI TPC algorithms compared to the existing low-complexity iterative TPC schemes.
AbstractList	In this paper, rapidly converging low-complexity iterative transmit precoding (TPC) techniques are proposed for the massive multiple-input multiple-output (MIMO) downlink. First of all, the proposed random block-based iterative TPC (RBI-TPC) algorithm performs its iterations by updating multiple rather than a single component at each instant, where the updating order of each block containing multiple components relies on the samples randomly sampled from a discrete distribution. Based on the analytically derived convergence rate, we demonstrate that improved convergence is achieved by the block-based update mechanism conceived since the correlation between multiple components can be beneficially exploited. Then, the random sampling that determines the updating order is studied. By applying conditional random sampling, the updating order is optimized based on the latest updates for attaining more rapid convergence. We also demonstrate that the associated updating order may become deterministic under specific conditions so that a fixed but optimized updating order can be used for facilitating the practical implementations, which paves the way for conceiving the ordered block-based iterative TPC (OBI-TPC) algorithm. Finally, the concept of successive over-relaxation (SOR) is adopted for further convergence improvement and simulations are presented to illustrate the performance improvements of the proposed RBI and OBI TPC algorithms compared to the existing low-complexity iterative TPC schemes.
Author	Ng, Derrick Wing Kwan Wang, Jiaheng Gao, Zhen Huang, Yongming Hanzo, Lajos Wang, Zheng
Author_xml	– sequence: 1 givenname: Zheng orcidid: 0000-0003-3528-558X surname: Wang fullname: Wang, Zheng organization: National Mobile Communications Research Laboratory, School of Information Science and Engineering, and Frontiers Science Center for Mobile Information Communication and Security, Southeast University, Nanjing, China – sequence: 2 givenname: Jiaheng orcidid: 0000-0002-9783-5471 surname: Wang fullname: Wang, Jiaheng organization: National Mobile Communications Research Laboratory, School of Information Science and Engineering, and Frontiers Science Center for Mobile Information Communication and Security, Southeast University, Nanjing, China – sequence: 3 givenname: Zhen orcidid: 0000-0002-2709-0216 surname: Gao fullname: Gao, Zhen organization: School of Information and Electronics, Beijing Institute of Technology, Beijing, China – sequence: 4 givenname: Yongming orcidid: 0000-0003-3616-4616 surname: Huang fullname: Huang, Yongming organization: National Mobile Communications Research Laboratory, School of Information Science and Engineering, and Frontiers Science Center for Mobile Information Communication and Security, Southeast University, Nanjing, China – sequence: 5 givenname: Derrick Wing Kwan orcidid: 0000-0001-6400-712X surname: Ng fullname: Ng, Derrick Wing Kwan organization: School of Electrical Engineering and Telecommunications, University of New South Wales, Sydney, NSW, Australia – sequence: 6 givenname: Lajos orcidid: 0000-0002-2636-5214 surname: Hanzo fullname: Hanzo, Lajos organization: School of Electronics and Computer Science, University of Southampton, Southampton, U.K
BookMark	eNp9kU1P20AQhlcVSA3QP1D1YImzw-yXd31EBtpIsYJQkLhZ6_UYLXV2010Dzb-vQzigHjjNYd5nXumZE3Lkg0dCvlOYUwrlxbpa1fWcAeNzzkEWovhCZlRKnYOW6ojMAErIC6X0V3KS0hMACOB8Rh7uzNZ1wy6rgn_B-Oj8Y7YMr3kVNtsB_7pxly1GjGZ0L5ito_Fp48bsNqINHcaU9SFmtUlpv64X9Sq7Cq9-cP73GTnuzZDw2_s8Jfc31-vqV75c_VxUl8vcsrIYcwqt1Fxpq4VVtmvR9FiqsqOikK1Eqy2T1HQta5Xo29YoCVK2olM9LYEi8FNyfri7jeHPM6axeQrP0U-VDStBSA1ciCnFDikbQ0oR-2Yb3cbEXUOh2Rts3gw2e4PNu8EJ0v9B1o2TieDHaNzwOfrjgDpE_NDFGExf4f8Aio2BdA
CODEN	IECMBT
CitedBy_id	crossref_primary_10_1109_TWC_2025_3558060
Cites_doi	10.1007/978-3-319-05089-8 10.1109/VTCSpring.2015.7146060 10.1109/MWC.001.1900488 10.1109/TVT.2019.2930639 10.1109/LCOMM.2015.2392751 10.1109/VTCSpring.2015.7145618 10.1109/VTCSpring.2018.8417575 10.1109/LCOMM.2016.2525807 10.1109/TWC.2018.2889480 10.1109/TWC.2020.3035153 10.1109/JSTSP.2014.2322582 10.1109/TWC.2018.2866112 10.1109/JSAC.2013.130205 10.1109/TWC.2021.3113458 10.1109/TWC.2018.2860951 10.1109/TWC.2017.2679706 10.1007/s10107-012-0614-z 10.1109/VTCSpring.2017.8108588 10.1109/LCOMM.2019.2911472 10.1109/JSYST.2017.2776401 10.1109/MITP.2019.2963491 10.1109/TCOMM.2021.3075248 10.1109/ICC.2015.7248549 10.1109/TIT.2019.2901497 10.1109/LWC.2017.2761876 10.1109/ACCESS.2021.3073325 10.1137/1.9781611970937 10.1109/MNET.001.1900287 10.1109/TIT.2017.2742509 10.1109/TCOMM.2012.061412.110567 10.1109/LWC.2017.2651069 10.1109/COMST.2015.2475242 10.1007/s11432-020-2955-6 10.1109/TIT.2010.2040892 10.5433/1679-0375.2016v37n1p3 10.1109/MCOM.2014.6736761 10.1109/TVT.2021.3113324 10.1137/1.9780898718003 10.1109/ICCS.2016.7833644 10.1109/ICC.2005.1494689 10.1109/LWC.2019.2919687 10.1109/TWC.2022.3182407 10.1137/1.9781611971484 10.1109/ICC.2015.7248580 10.1109/TVT.2015.2457450 10.1137/100802001 10.1109/TWC.2014.2363105 10.1109/TCOMM.2020.3036050 10.1109/TIT.2011.2162180 10.1109/TSP.2020.3040047 10.1109/LCOMM.2014.2360514 10.1109/MSP.2011.2178495 10.1109/RPIC.2015.7497132 10.1109/TCOMM.2018.2823715 10.1109/JPROC.2015.2497203
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/TCOMM.2023.3305646
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) (F) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-0857
EndPage	1
ExternalDocumentID	10_1109_TCOMM_2023_3305646 10220155
Genre	orig-research
GroupedDBID	-~X .DC 0R~ 29I 4.4 5GY 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AGQYO AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS HZ~ IES IFIPE IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 ZCA 3EH 5VS AAYXX ABFSI ACKIV AETIX AGSQL AI. AIBXA ALLEH CITATION E.L EJD H~9 IAAWW IBMZZ ICLAB IFJZH VH1 ZCG 7SP 8FD L7M
ID	FETCH-LOGICAL-c296t-10b58378c84c7cdbeafe979d1465b5ec8c251adb2b74fbba75055b4d7f1901e03
IEDL.DBID	RIE
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001142528100007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0090-6778
IngestDate	Mon Jun 30 10:17:03 EDT 2025 Tue Nov 18 19:50:36 EST 2025 Sat Nov 29 04:08:27 EST 2025 Mon Aug 04 05:48:55 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	12
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-c296t-10b58378c84c7cdbeafe979d1465b5ec8c251adb2b74fbba75055b4d7f1901e03
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-2709-0216 0000-0003-3616-4616 0000-0001-6400-712X 0000-0003-3528-558X 0000-0002-9783-5471 0000-0002-2636-5214
PQID	2904580344
PQPubID	85472
PageCount	1
ParticipantIDs	proquest_journals_2904580344 crossref_primary_10_1109_TCOMM_2023_3305646 crossref_citationtrail_10_1109_TCOMM_2023_3305646 ieee_primary_10220155
PublicationCentury	2000
PublicationDate	2023-12-01
PublicationDateYYYYMMDD	2023-12-01
PublicationDate_xml	– month: 12 year: 2023 text: 2023-12-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on communications
PublicationTitleAbbrev	TCOMM
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 ref12 ref56 ref15 ref14 ref53 ref52 ref11 ref55 ref10 ref54 ref17 ref16 ref19 ref18 ref51 ref50 ref46 ref45 ref48 ref47 ref42 ref41 ref44 ref43 ref49 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 Klein (ref39) ref35 ref34 ref37 ref36 ref31 ref30 ref33 ref32 ref2 ref1 ref38 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29
References_xml	– ident: ref52 doi: 10.1007/978-3-319-05089-8 – ident: ref29 doi: 10.1109/VTCSpring.2015.7146060 – ident: ref2 doi: 10.1109/MWC.001.1900488 – ident: ref16 doi: 10.1109/TVT.2019.2930639 – ident: ref32 doi: 10.1109/LCOMM.2015.2392751 – start-page: 937 volume-title: Proc. 11th ACM-SIAM Symp. Discrete Algorithms ident: ref39 article-title: Finding the closest lattice vector when it’s unusually close – ident: ref31 doi: 10.1109/VTCSpring.2015.7145618 – ident: ref28 doi: 10.1109/VTCSpring.2018.8417575 – ident: ref19 doi: 10.1109/LCOMM.2016.2525807 – ident: ref22 doi: 10.1109/TWC.2018.2889480 – ident: ref12 doi: 10.1109/TWC.2020.3035153 – ident: ref21 doi: 10.1109/JSTSP.2014.2322582 – ident: ref11 doi: 10.1109/TWC.2018.2866112 – ident: ref17 doi: 10.1109/JSAC.2013.130205 – ident: ref13 doi: 10.1109/TWC.2021.3113458 – ident: ref46 doi: 10.1109/TWC.2018.2860951 – ident: ref10 doi: 10.1109/TWC.2017.2679706 – ident: ref51 doi: 10.1007/s10107-012-0614-z – ident: ref34 doi: 10.1109/VTCSpring.2017.8108588 – ident: ref20 doi: 10.1109/LCOMM.2019.2911472 – ident: ref18 doi: 10.1109/JSYST.2017.2776401 – ident: ref1 doi: 10.1109/MITP.2019.2963491 – ident: ref14 doi: 10.1109/TCOMM.2021.3075248 – ident: ref30 doi: 10.1109/ICC.2015.7248549 – ident: ref40 doi: 10.1109/TIT.2019.2901497 – ident: ref26 doi: 10.1109/LWC.2017.2761876 – ident: ref36 doi: 10.1109/ACCESS.2021.3073325 – ident: ref49 doi: 10.1137/1.9781611970937 – ident: ref3 doi: 10.1109/MNET.001.1900287 – ident: ref42 doi: 10.1109/TIT.2017.2742509 – ident: ref53 doi: 10.1109/TCOMM.2012.061412.110567 – ident: ref33 doi: 10.1109/LWC.2017.2651069 – ident: ref8 doi: 10.1109/COMST.2015.2475242 – ident: ref5 doi: 10.1007/s11432-020-2955-6 – ident: ref43 doi: 10.1109/TIT.2010.2040892 – ident: ref56 doi: 10.5433/1679-0375.2016v37n1p3 – ident: ref4 doi: 10.1109/MCOM.2014.6736761 – ident: ref15 doi: 10.1109/TVT.2021.3113324 – ident: ref48 doi: 10.1137/1.9780898718003 – ident: ref27 doi: 10.1109/ICCS.2016.7833644 – ident: ref55 doi: 10.1109/ICC.2005.1494689 – ident: ref35 doi: 10.1109/LWC.2019.2919687 – ident: ref37 doi: 10.1109/TWC.2022.3182407 – ident: ref47 doi: 10.1137/1.9781611971484 – ident: ref45 doi: 10.1109/ICC.2015.7248580 – ident: ref24 doi: 10.1109/TVT.2015.2457450 – ident: ref50 doi: 10.1137/100802001 – ident: ref7 doi: 10.1109/TWC.2014.2363105 – ident: ref44 doi: 10.1109/TCOMM.2020.3036050 – ident: ref38 doi: 10.1109/TIT.2011.2162180 – ident: ref41 doi: 10.1109/TSP.2020.3040047 – ident: ref25 doi: 10.1109/LCOMM.2014.2360514 – ident: ref6 doi: 10.1109/MSP.2011.2178495 – ident: ref54 doi: 10.1109/RPIC.2015.7497132 – ident: ref23 doi: 10.1109/TCOMM.2018.2823715 – ident: ref9 doi: 10.1109/JPROC.2015.2497203
SSID	ssj0004033
Score	2.4494002
Snippet	In this paper, rapidly converging low-complexity iterative transmit precoding (TPC) techniques are proposed for the massive multiple-input multiple-output...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1
SubjectTerms	Algorithms Complexity Convergence Downlink Downlinking Iterative algorithms iterative methods Jacobian matrices low-complexity linear transmit precoding Massive MIMO Precoding Random sampling Symmetric matrices
Title	Rapidly Converging Low-Complexity Iterative Transmit Precoders for Massive MIMO Downlink
URI	https://ieeexplore.ieee.org/document/10220155 https://www.proquest.com/docview/2904580344
Volume	71
WOSCitedRecordID	wos001142528100007&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) (F) customDbUrl: eissn: 1558-0857 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004033 issn: 0090-6778 databaseCode: RIE dateStart: 19720101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_c8EEf_Jw4v8iDb9Ktn0vyKNPhwG5DJuytNGkCg7mNrVP235tLOx2Igm-FJqXk19z9rrn7HcCt62vGZCs11i-jTihZ4HAlPSdQoce0TL2WcG2zCdrrsdGID8pidVsLo5SyyWeqgZf2LD-byRX-KmtidII-vgIVSltFsdZ3EaQblJKTmM9O2aZCxuXNYbsfxw1sFN4IkDIj293yQratyg9bbB1M5_Cfr3YEByWTJPcF9Mewo6YnsL-lL3gKo5d0Ps4ma9LG3PIF9iMiz7MPB40ACmHma9K1qsrG5BHrtd7GORlgkIz5zcQQWhIbdo23427cJw8orW-i1xq8dh6H7SenbKXgSJ-3cmNsRYTS8ZKFkspMqFQrTnlm7GQkIiWZNDwnzYQvaKiFSA2PiCIRZlQjYVBucAbV6WyqzoEwKjxD67TLhA65UMwPIy3MNpZSmeBJ18HbLG0iS51xbHcxSWy84fLEwpEgHEkJRx3uvubMC5WNP0fXEICtkcXa1-FqA2FS7sRl4nM8CkZhw4tfpl3CHj69yFG5gmq-WKlr2JXv-Xi5uLEf2SdfsM66
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_8AvXBb3E6NQ--Sbd-pGvyKNPhcJ1DJuytNGkCg7nJ1in-9-bSTgei4FuhCS35NXe_a-5-B3Dl-pox2UiN9csih0oWOFxJzwkU9ZiWqdcQrm02EXW7bDDgvbJY3dbCKKVs8pmq4aU9y88mco6_yuoYnaCPX4X1kFLfLcq1vssg3aAUncSM9ogtamRcXu83H-O4hq3CawGSZuS7S37INlb5YY2ti2nt_vPl9mCn5JLkpgB_H1bU-AC2lxQGD2HwlL4Os9EHaWJ2-RQ7EpHO5N1BM4BSmPkHaVtdZWP0iPVbL8Oc9DBMxgxnYigtiQ2_xttxO34ktyiub-LXI3hu3fWb907ZTMGRPm_kxtyKEMXjJaMykplQqVY84pmxlKEIlWTSMJ00E76IqBYiNUwiDAXNIo2UQbnBMayNJ2N1AoRFwjPETrtMaMqFYj4NtTAbWUplwiddAW-xtIkslcax4cUosRGHyxMLR4JwJCUcFbj-mvNa6Gz8OfoIAVgaWax9BaoLCJNyL84Sn-NhMEobnv4y7RI27_txJ-m0uw9nsIVPKjJWqrCWT-fqHDbkWz6cTS_sB_cJSljSAQ
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=Rapidly+Converging+Low-Complexity+Iterative+Transmit+Precoders+for+Massive+MIMO+Downlink&rft.jtitle=IEEE+transactions+on+communications&rft.au=Wang%2C+Zheng&rft.au=Wang%2C+Jiaheng&rft.au=Gao%2C+Zhen&rft.au=Huang%2C+Yongming&rft.date=2023-12-01&rft.pub=IEEE&rft.issn=0090-6778&rft.spage=1&rft.epage=1&rft_id=info:doi/10.1109%2FTCOMM.2023.3305646&rft.externalDocID=10220155
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon