A New Randomized Iterative Detection Algorithm For Uplink Large-scale MIMO Systems
In this paper, a new randomized iterative detection algorithm (NRIDA) is proposed for uplink large-scale MIMO systems, where the random iterations in it are designed to work for the detection model (denoted by y = Hx + n) directly. Different from those traditional iterations designed for the linear...
Uložené v:
| Vydané v: | IEEE transactions on communications Ročník 71; číslo 9; s. 1 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
IEEE
01.09.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| ISSN: | 0090-6778, 1558-0857 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper, a new randomized iterative detection algorithm (NRIDA) is proposed for uplink large-scale MIMO systems, where the random iterations in it are designed to work for the detection model (denoted by y = Hx + n) directly. Different from those traditional iterations designed for the linear system (denoted by Ax = b with A = H H H and b = H H y), we show that besides the complexity reduction about the matrix inversion, in the proposed NRIDA the computational complexity of matrix multiplication for the linear detection is also greatly reduced without any performance loss, thus leading to a much lower detection complexity. Meanwhile, according to convergence analysis, we demonstrate that the proposed NRIDA enjoys a globally exponential convergence performance, enabling it well suited to the various detection cases of interest. Besides, further complexity reduction and the choices of the sampling distribution in NRIDA are studied as well in full details. Moreover, in order to achieve a better detection trade-off between performance and complexity, we introduce the concept of the conditional sampling into NRIDA, which brings significant gains in both iteration convergence and efficiency. Finally, simulations with respect to the uplink large-scale MIMO detection are presented to illustrate the remarkable gains of the proposed NRIDA in both performance and complexity. |
|---|---|
| AbstractList | In this paper, a new randomized iterative detection algorithm (NRIDA) is proposed for uplink large-scale MIMO systems, where the random iterations in it are designed to work for the detection model (denoted by [Formula Omitted]) directly. Different from those traditional iterations designed for the linear system (denoted by [Formula Omitted] with [Formula Omitted] and [Formula Omitted]), we show that besides the complexity reduction about the matrix inversion, in the proposed NRIDA the computational complexity of matrix multiplication for the linear detection is also greatly reduced without any performance loss, thus leading to a much lower detection complexity. Meanwhile, according to convergence analysis, we demonstrate that the proposed NRIDA enjoys a globally exponential convergence performance, enabling it well suited to the various detection cases of interest. Besides, further complexity reduction and the choices of the sampling distribution in NRIDA are studied as well in full details. Moreover, in order to achieve a better detection trade-off between performance and complexity, we introduce the concept of the conditional sampling into NRIDA, which brings significant gains in both iteration convergence and efficiency. Finally, simulations with respect to the uplink large-scale MIMO detection are presented to illustrate the remarkable gains of the proposed NRIDA in both performance and complexity. In this paper, a new randomized iterative detection algorithm (NRIDA) is proposed for uplink large-scale MIMO systems, where the random iterations in it are designed to work for the detection model (denoted by y = Hx + n) directly. Different from those traditional iterations designed for the linear system (denoted by Ax = b with A = H H H and b = H H y), we show that besides the complexity reduction about the matrix inversion, in the proposed NRIDA the computational complexity of matrix multiplication for the linear detection is also greatly reduced without any performance loss, thus leading to a much lower detection complexity. Meanwhile, according to convergence analysis, we demonstrate that the proposed NRIDA enjoys a globally exponential convergence performance, enabling it well suited to the various detection cases of interest. Besides, further complexity reduction and the choices of the sampling distribution in NRIDA are studied as well in full details. Moreover, in order to achieve a better detection trade-off between performance and complexity, we introduce the concept of the conditional sampling into NRIDA, which brings significant gains in both iteration convergence and efficiency. Finally, simulations with respect to the uplink large-scale MIMO detection are presented to illustrate the remarkable gains of the proposed NRIDA in both performance and complexity. |
| Author | Xia, Yili Huang, Yongming Shi, Qingjiang Xu, Wei Wang, Zheng |
| Author_xml | – sequence: 1 givenname: Zheng orcidid: 0000-0003-3528-558X surname: Wang fullname: Wang, Zheng organization: National Mobile Communications Research Laboratory, and School of Information Science and Engineering, Southeast University, Nanjing, China – sequence: 2 givenname: Wei orcidid: 0000-0001-9341-8382 surname: Xu fullname: Xu, Wei organization: National Mobile Communications Research Laboratory, and School of Information Science and Engineering, Southeast University, Nanjing, China – sequence: 3 givenname: Yili orcidid: 0000-0002-4402-8131 surname: Xia fullname: Xia, Yili organization: National Mobile Communications Research Laboratory, and School of Information Science and Engineering, Southeast University, Nanjing, China – sequence: 4 givenname: Qingjiang orcidid: 0000-0003-0507-9080 surname: Shi fullname: Shi, Qingjiang organization: School of Software Engineering, Tongji University, Shanghai, China – sequence: 5 givenname: Yongming orcidid: 0000-0003-3616-4616 surname: Huang fullname: Huang, Yongming organization: National Mobile Communications Research Laboratory, and School of Information Science and Engineering, Southeast University, Nanjing, China |
| BookMark | eNp9kEFPAjEQhRuDiYD-AeOhiefFaUt3u0eCoiQgCcJ5U8osFpddbIsGf72LcDAePEwmL3nfTN5rkUZZlUjINYMOY5DezfqT8bjDgYuO4HEiJTsjTSalikDJpEGaAClEcZKoC9Lyfg0AXRCiSaY9-oyfdKrLZbWxX7ikw4BOB_uB9B4DmmCrkvaKVeVseN3QQeXofFvY8o2OtFth5I0ukI6H4wl92fuAG39JznNdeLw67TaZDx5m_adoNHkc9nujyPA0DpHuxop1WR4bTLrCGCETtohjudQiZ7XQXAMyJRJAKXK1wFobxkExbnJItWiT2-Pdraved-hDtq52rqxfZlzFsg7MUlm71NFlXOW9wzwzNuhDquC0LTIG2aHB7KfB7NBgdmqwRvkfdOvsRrv9_9DNEbKI-AtgIGQ939cNfSg |
| CODEN | IECMBT |
| CitedBy_id | crossref_primary_10_3390_app15126658 crossref_primary_10_3390_app132312638 crossref_primary_10_1109_TWC_2024_3446189 crossref_primary_10_1109_TWC_2025_3541209 |
| Cites_doi | 10.1137/1.9781611970937 10.1109/MWC.001.1900488 10.1109/LCOMM.2019.2897798 10.1109/ICCS.2014.7024849 10.1109/WCNC.2019.8885582 10.1109/TIT.2019.2901497 10.1109/ICC.2015.7248580 10.1109/TSP.2022.3180552 10.1109/ICCSN.2016.7586650 10.1109/TSP.2005.863008 10.1109/MNET.001.1900287 10.5433/1679-0375.2016v37n1p3 10.1109/LCOMM.2015.2504506 10.1137/1.9780898718003 10.1109/TCSI.2020.3010890 10.1109/TCOMM.2020.3036050 10.1109/MCOM.2014.6736761 10.1137/1.9781611971484 10.1109/JSAC.2022.3196064 10.1109/TIT.2017.2742509 10.1109/PIMRC.2017.8292627 10.1561/2000000093 10.56021/9781421407944 10.1109/APCCAS.2018.8605694 10.1109/TVT.2014.2370106 10.1109/TSP.2020.3040047 10.1017/CBO9780511807213 10.1007/978-3-319-05089-8 10.1109/JSTSP.2014.2313021 10.1109/TSP.2020.2967175 10.1109/LCOMM.2015.2514281 10.1109/SiPS.2016.55 10.1109/TIT.2011.2162180 10.1109/MSP.2011.2178495 10.1109/MITP.2019.2963491 10.1109/TWC.2010.092810.091092 10.1109/VTCFall.2014.6966041 |
| 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.3267551 |
| 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 | 1558-0857 |
| EndPage | 1 |
| ExternalDocumentID | 10_1109_TCOMM_2023_3267551 10103510 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 61801216 funderid: 10.13039/501100001809 |
| 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-a468141f6ce743cc3571b665da3f1357a2a0e18370e53f8be2a0c120812cf09a3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001193508900003&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:09:40 EDT 2025 Sat Nov 29 04:08:26 EST 2025 Tue Nov 18 22:16:38 EST 2025 Wed Aug 27 02:21:20 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| 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-a468141f6ce743cc3571b665da3f1357a2a0e18370e53f8be2a0c120812cf09a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-4402-8131 0000-0003-3616-4616 0000-0001-9341-8382 0000-0003-3528-558X 0000-0003-0507-9080 |
| PQID | 2865090195 |
| PQPubID | 85472 |
| PageCount | 1 |
| ParticipantIDs | ieee_primary_10103510 proquest_journals_2865090195 crossref_primary_10_1109_TCOMM_2023_3267551 crossref_citationtrail_10_1109_TCOMM_2023_3267551 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-09-01 |
| PublicationDateYYYYMMDD | 2023-09-01 |
| PublicationDate_xml | – month: 09 year: 2023 text: 2023-09-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 ref35 ref12 ref34 ref15 ref37 ref14 ref36 ref31 ref30 ref11 ref33 ref10 ref32 De Lamare (ref38) 2014 ref2 ref1 ref17 ref39 ref16 ref19 ref18 (ref21) 2017 Klein (ref24) Qian (ref42) 2023 ref23 ref26 ref25 ref41 ref22 (ref20) 2019 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 |
| References_xml | – start-page: 1 year: 2017 ident: ref21 publication-title: Study on Scenarios and Requirements for Next Generation Access Technologies – ident: ref16 doi: 10.1137/1.9781611970937 – ident: ref2 doi: 10.1109/MWC.001.1900488 – ident: ref7 doi: 10.1109/LCOMM.2019.2897798 – ident: ref41 doi: 10.1109/ICCS.2014.7024849 – ident: ref33 doi: 10.1109/WCNC.2019.8885582 – ident: ref26 doi: 10.1109/TIT.2019.2901497 – year: 2023 ident: ref42 article-title: Counting the floating point operations (FLOPS) – ident: ref12 doi: 10.1109/ICC.2015.7248580 – ident: ref22 doi: 10.1109/TSP.2022.3180552 – ident: ref32 doi: 10.1109/ICCSN.2016.7586650 – ident: ref34 doi: 10.1109/TSP.2005.863008 – ident: ref3 doi: 10.1109/MNET.001.1900287 – ident: ref37 doi: 10.5433/1679-0375.2016v37n1p3 – ident: ref9 doi: 10.1109/LCOMM.2015.2504506 – ident: ref17 doi: 10.1137/1.9780898718003 – ident: ref10 doi: 10.1109/TCSI.2020.3010890 – ident: ref28 doi: 10.1109/TCOMM.2020.3036050 – ident: ref4 doi: 10.1109/MCOM.2014.6736761 – ident: ref15 doi: 10.1137/1.9781611971484 – start-page: 1 volume-title: User Equipment (UE) Conformance Specification year: 2019 ident: ref20 – start-page: 937 volume-title: Proc. ACM-SIAM Symp. Discrete Algorithms ident: ref24 article-title: Finding the closest lattice vector when it is unusually close – ident: ref36 doi: 10.1109/JSAC.2022.3196064 – ident: ref25 doi: 10.1109/TIT.2017.2742509 – ident: ref30 doi: 10.1109/PIMRC.2017.8292627 – ident: ref39 doi: 10.1561/2000000093 – ident: ref31 doi: 10.56021/9781421407944 – ident: ref18 doi: 10.1109/APCCAS.2018.8605694 – ident: ref11 doi: 10.1109/TVT.2014.2370106 – ident: ref27 doi: 10.1109/TSP.2020.3040047 – ident: ref5 doi: 10.1017/CBO9780511807213 – ident: ref29 doi: 10.1007/978-3-319-05089-8 – ident: ref14 doi: 10.1109/JSTSP.2014.2313021 – ident: ref35 doi: 10.1109/TSP.2020.2967175 – ident: ref8 doi: 10.1109/LCOMM.2015.2514281 – ident: ref40 doi: 10.1109/SiPS.2016.55 – ident: ref23 doi: 10.1109/TIT.2011.2162180 – ident: ref13 doi: 10.1109/MSP.2011.2178495 – year: 2014 ident: ref38 article-title: Detection and estimation algorithms in massive MIMO systems publication-title: arXiv:1408.4853 – ident: ref1 doi: 10.1109/MITP.2019.2963491 – ident: ref6 doi: 10.1109/TWC.2010.092810.091092 – ident: ref19 doi: 10.1109/VTCFall.2014.6966041 |
| SSID | ssj0004033 |
| Score | 2.4471548 |
| Snippet | In this paper, a new randomized iterative detection algorithm (NRIDA) is proposed for uplink large-scale MIMO systems, where the random iterations in it are... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Algorithms Complexity Convergence Iterative algorithms Iterative decoding Iterative methods Jacobian matrices large-scale MIMO detection low complexity Massive MIMO Mathematical analysis Matrices (mathematics) MIMO communication random sampling Reduction Sampling Symmetric matrices Uplink Uplinking |
| Title | A New Randomized Iterative Detection Algorithm For Uplink Large-scale MIMO Systems |
| URI | https://ieeexplore.ieee.org/document/10103510 https://www.proquest.com/docview/2865090195 |
| Volume | 71 |
| WOSCitedRecordID | wos001193508900003&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: 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/eLvHCXMwlV3PS8MwFA46POjBnxOnU3LwJplJf6TtcUyHwrrJ2GS3kqSpDrdWus6Df71J2ulEFLw1kJSSL3l5r3nf9wC4TLjDVGTFEcOCI61GiJjwJcLMThxJeYBN6YTHntfv-5NJ8FCR1Q0XRkppks9kSz-au_w4E0v9q0ztcKIvvlSEvul5tCRrfZEgsV1JTup8ds9fMWRwcD3qDMKwpQuFt5S34rku-XYKmbIqP2yxOWC6e__8tH2wW3mSsF1CfwA2ZHoIdtb0BY_AsA2VEYNDlsbZfPouY3hvRJSVhYM3sjBZWClsz56yfFo8z2E3y-FYU3RfYE9niKOFQlDC8D4cwEravA7G3dtR5w5VRRSQsAJaIOZQnzgkoUIqZ0EI2_UIp9SNFRhENZjFsCRaAke6duJzqdqCWMpTsESCA2Yfg1qapfIEQA9zquJWN44pdhIFqct1FXHhWTQWnNMGIKtJjUSlMK4LXcwiE2ngIDJARBqIqAKiAa4-x7yW-hp_9q7rqV_rWc56AzRX4EXVHlxEmnOrFgMJ3NNfhp2Bbf32MmWsCWpFvpTnYEu8FdNFfmGW1wfCf8qa |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA6ignrwtzidmoM36UzaJm2PYzo2XDcZm3grSZrqUFvpOg_-9SZppxNR8NZAQku-5OW95n3fA-A84S5TkRW3GBLc0mqEFhO-tBBzEldSHiBTOuGu5_X7_v19cFuR1Q0XRkppks9kQz-au_w4EzP9q0ztcKwvvlSEvkJc10YlXeuLBomcSnRSZ7R7_pwjg4LLUWsQhg1dKryh_BWPEPztHDKFVX5YY3PEtLf--XHbYLPyJWGzBH8HLMl0F2wsKAzugWETKjMGhyyNs5fJu4xh18goKxsHr2Rh8rBS2Hx-yPJJ8fgC21kOx5qk-wR7OkfcmioMJQy74QBW4ub7YNy-HrU6VlVGwRJ2QAuLudTHLk6okMpdEMIhHuaUkljBgVWD2QxJrEVwJHESn0vVFthWvoItEhQw5wAsp1kqDwH0EKcqciVxTJGbKFAJ13XEhWfTWHBOawDPJzUSlca4LnXxHJlYAwWRASLSQEQVEDVw8TnmtVTY-LP3vp76hZ7lrNdAfQ5eVO3CaaRZt2ox4IAc_TLsDKx1RmEv6nX7N8dgXb-pTCCrg-Uin8kTsCreisk0PzVL7QN50c3h |
| 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+New+Randomized+Iterative+Detection+Algorithm+for+Uplink+Large-Scale+MIMO+Systems&rft.jtitle=IEEE+transactions+on+communications&rft.au=Wang%2C+Zheng&rft.au=Xu%2C+Wei&rft.au=Xia%2C+Yili&rft.au=Shi%2C+Qingjiang&rft.date=2023-09-01&rft.issn=0090-6778&rft.eissn=1558-0857&rft.volume=71&rft.issue=9&rft.spage=5093&rft.epage=5107&rft_id=info:doi/10.1109%2FTCOMM.2023.3267551&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TCOMM_2023_3267551 |
| 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 |