Robust Precoding for HF Skywave Massive MIMO
In this paper, we investigate the robust precoding with imperfect channel state information (CSI) for high frequency (HF) skywave massive multiple-input multiple-output (MIMO) communications. Starting with a sparse beam based a posteriori channel model for the available imperfect CSI at the base sta...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on wireless communications 2023-10, Vol.22 (10), p.1-1 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1 |
|---|---|
| container_issue | 10 |
| container_start_page | 1 |
| container_title | IEEE transactions on wireless communications |
| container_volume | 22 |
| creator | Yu, Xianglong Gao, Xiqi Lu, An-An Zhang, Jinlin Wu, Hebing Li, Geoffrey Ye |
| description | In this paper, we investigate the robust precoding with imperfect channel state information (CSI) for high frequency (HF) skywave massive multiple-input multiple-output (MIMO) communications. Starting with a sparse beam based a posteriori channel model for the available imperfect CSI at the base station (BS), we prove that the robust precoder for ergodic sum-rate maximization can be designed by optimizing the beam domain robust precoder (BDRP) without any loss of optimality. Furthermore, the asymptotic optimal precoder is beam structured for a sufficiently large number of antennas at the BS, involving a low-dimensional BDRP. As a result, the beam structured robust precoding is asymptotic optimal and can be efficiently implemented based on chirp z-transform. We then derive an iterative algorithm to design the BDRP using majorization-minimization (MM). Furthermore, we develop a low-complexity BDRP design with an ergodic sum-rate upper bound, simplifying the MM based design algorithm. Based on our simulation results, the proposed beam structured robust precoding can achieve a near-optimal performance with significantly reduced complexity in various scenarios. |
| doi_str_mv | 10.1109/TWC.2023.3244986 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TWC_2023_3244986</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10049795</ieee_id><sourcerecordid>2875572492</sourcerecordid><originalsourceid>FETCH-LOGICAL-c292t-eec00bbc1c0ab159d11324a74ebfe45d5736c3942b1c861b32b9c7401229df503</originalsourceid><addsrcrecordid>eNpNkDFPwzAQRi0EEqWwMzBEYiXl7mzH8YgqSiu1KoIiRit2HJQCTbFbqv57ErUD03fD--5Oj7FrhAEi6PvF-3BAQHzASQidZyesh1LmKZHIT7uZZymSys7ZRYxLAFSZlD1299LYbdwkz8G7pqxXH0nVhGQ8Sl4_97vi1yezIsa6y8lsfsnOquIr-qtj9tnb6HExHKfT-dNk-DBNHWnapN47AGsdOigsSl0itk8VSnhbeSFLqXjmuBZk0eUZWk5WOyUAiXRZSeB9dnvYuw7Nz9bHjVk227BqTxrKlZSKhKaWggPlQhNj8JVZh_q7CHuDYDonpnViOifm6KSt3Bwqtff-Hw5CKy35Hz8IWrA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2875572492</pqid></control><display><type>article</type><title>Robust Precoding for HF Skywave Massive MIMO</title><source>IEEE Electronic Library (IEL)</source><creator>Yu, Xianglong ; Gao, Xiqi ; Lu, An-An ; Zhang, Jinlin ; Wu, Hebing ; Li, Geoffrey Ye</creator><creatorcontrib>Yu, Xianglong ; Gao, Xiqi ; Lu, An-An ; Zhang, Jinlin ; Wu, Hebing ; Li, Geoffrey Ye</creatorcontrib><description>In this paper, we investigate the robust precoding with imperfect channel state information (CSI) for high frequency (HF) skywave massive multiple-input multiple-output (MIMO) communications. Starting with a sparse beam based a posteriori channel model for the available imperfect CSI at the base station (BS), we prove that the robust precoder for ergodic sum-rate maximization can be designed by optimizing the beam domain robust precoder (BDRP) without any loss of optimality. Furthermore, the asymptotic optimal precoder is beam structured for a sufficiently large number of antennas at the BS, involving a low-dimensional BDRP. As a result, the beam structured robust precoding is asymptotic optimal and can be efficiently implemented based on chirp z-transform. We then derive an iterative algorithm to design the BDRP using majorization-minimization (MM). Furthermore, we develop a low-complexity BDRP design with an ergodic sum-rate upper bound, simplifying the MM based design algorithm. Based on our simulation results, the proposed beam structured robust precoding can achieve a near-optimal performance with significantly reduced complexity in various scenarios.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2023.3244986</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Antennas ; Asymptotic properties ; beam structured precoding ; Channel models ; Complexity ; Ergodic processes ; HF skywave communications ; imperfect CSI ; Iterative algorithms ; Iterative methods ; Massive MIMO ; Matrix converters ; MIMO communication ; OFDM ; Optimization ; Precoding ; robust precoding ; Robustness ; Symbols ; Upper bounds ; Z transforms</subject><ispartof>IEEE transactions on wireless communications, 2023-10, Vol.22 (10), p.1-1</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c292t-eec00bbc1c0ab159d11324a74ebfe45d5736c3942b1c861b32b9c7401229df503</citedby><cites>FETCH-LOGICAL-c292t-eec00bbc1c0ab159d11324a74ebfe45d5736c3942b1c861b32b9c7401229df503</cites><orcidid>0000-0003-0193-6372 ; 0000-0001-9107-6593 ; 0000-0001-7836-6799 ; 0000-0002-7894-2415</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10049795$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10049795$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yu, Xianglong</creatorcontrib><creatorcontrib>Gao, Xiqi</creatorcontrib><creatorcontrib>Lu, An-An</creatorcontrib><creatorcontrib>Zhang, Jinlin</creatorcontrib><creatorcontrib>Wu, Hebing</creatorcontrib><creatorcontrib>Li, Geoffrey Ye</creatorcontrib><title>Robust Precoding for HF Skywave Massive MIMO</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>In this paper, we investigate the robust precoding with imperfect channel state information (CSI) for high frequency (HF) skywave massive multiple-input multiple-output (MIMO) communications. Starting with a sparse beam based a posteriori channel model for the available imperfect CSI at the base station (BS), we prove that the robust precoder for ergodic sum-rate maximization can be designed by optimizing the beam domain robust precoder (BDRP) without any loss of optimality. Furthermore, the asymptotic optimal precoder is beam structured for a sufficiently large number of antennas at the BS, involving a low-dimensional BDRP. As a result, the beam structured robust precoding is asymptotic optimal and can be efficiently implemented based on chirp z-transform. We then derive an iterative algorithm to design the BDRP using majorization-minimization (MM). Furthermore, we develop a low-complexity BDRP design with an ergodic sum-rate upper bound, simplifying the MM based design algorithm. Based on our simulation results, the proposed beam structured robust precoding can achieve a near-optimal performance with significantly reduced complexity in various scenarios.</description><subject>Antennas</subject><subject>Asymptotic properties</subject><subject>beam structured precoding</subject><subject>Channel models</subject><subject>Complexity</subject><subject>Ergodic processes</subject><subject>HF skywave communications</subject><subject>imperfect CSI</subject><subject>Iterative algorithms</subject><subject>Iterative methods</subject><subject>Massive MIMO</subject><subject>Matrix converters</subject><subject>MIMO communication</subject><subject>OFDM</subject><subject>Optimization</subject><subject>Precoding</subject><subject>robust precoding</subject><subject>Robustness</subject><subject>Symbols</subject><subject>Upper bounds</subject><subject>Z transforms</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpNkDFPwzAQRi0EEqWwMzBEYiXl7mzH8YgqSiu1KoIiRit2HJQCTbFbqv57ErUD03fD--5Oj7FrhAEi6PvF-3BAQHzASQidZyesh1LmKZHIT7uZZymSys7ZRYxLAFSZlD1299LYbdwkz8G7pqxXH0nVhGQ8Sl4_97vi1yezIsa6y8lsfsnOquIr-qtj9tnb6HExHKfT-dNk-DBNHWnapN47AGsdOigsSl0itk8VSnhbeSFLqXjmuBZk0eUZWk5WOyUAiXRZSeB9dnvYuw7Nz9bHjVk227BqTxrKlZSKhKaWggPlQhNj8JVZh_q7CHuDYDonpnViOifm6KSt3Bwqtff-Hw5CKy35Hz8IWrA</recordid><startdate>20231001</startdate><enddate>20231001</enddate><creator>Yu, Xianglong</creator><creator>Gao, Xiqi</creator><creator>Lu, An-An</creator><creator>Zhang, Jinlin</creator><creator>Wu, Hebing</creator><creator>Li, Geoffrey Ye</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-0193-6372</orcidid><orcidid>https://orcid.org/0000-0001-9107-6593</orcidid><orcidid>https://orcid.org/0000-0001-7836-6799</orcidid><orcidid>https://orcid.org/0000-0002-7894-2415</orcidid></search><sort><creationdate>20231001</creationdate><title>Robust Precoding for HF Skywave Massive MIMO</title><author>Yu, Xianglong ; Gao, Xiqi ; Lu, An-An ; Zhang, Jinlin ; Wu, Hebing ; Li, Geoffrey Ye</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c292t-eec00bbc1c0ab159d11324a74ebfe45d5736c3942b1c861b32b9c7401229df503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Antennas</topic><topic>Asymptotic properties</topic><topic>beam structured precoding</topic><topic>Channel models</topic><topic>Complexity</topic><topic>Ergodic processes</topic><topic>HF skywave communications</topic><topic>imperfect CSI</topic><topic>Iterative algorithms</topic><topic>Iterative methods</topic><topic>Massive MIMO</topic><topic>Matrix converters</topic><topic>MIMO communication</topic><topic>OFDM</topic><topic>Optimization</topic><topic>Precoding</topic><topic>robust precoding</topic><topic>Robustness</topic><topic>Symbols</topic><topic>Upper bounds</topic><topic>Z transforms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yu, Xianglong</creatorcontrib><creatorcontrib>Gao, Xiqi</creatorcontrib><creatorcontrib>Lu, An-An</creatorcontrib><creatorcontrib>Zhang, Jinlin</creatorcontrib><creatorcontrib>Wu, Hebing</creatorcontrib><creatorcontrib>Li, Geoffrey Ye</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yu, Xianglong</au><au>Gao, Xiqi</au><au>Lu, An-An</au><au>Zhang, Jinlin</au><au>Wu, Hebing</au><au>Li, Geoffrey Ye</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robust Precoding for HF Skywave Massive MIMO</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2023-10-01</date><risdate>2023</risdate><volume>22</volume><issue>10</issue><spage>1</spage><epage>1</epage><pages>1-1</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>In this paper, we investigate the robust precoding with imperfect channel state information (CSI) for high frequency (HF) skywave massive multiple-input multiple-output (MIMO) communications. Starting with a sparse beam based a posteriori channel model for the available imperfect CSI at the base station (BS), we prove that the robust precoder for ergodic sum-rate maximization can be designed by optimizing the beam domain robust precoder (BDRP) without any loss of optimality. Furthermore, the asymptotic optimal precoder is beam structured for a sufficiently large number of antennas at the BS, involving a low-dimensional BDRP. As a result, the beam structured robust precoding is asymptotic optimal and can be efficiently implemented based on chirp z-transform. We then derive an iterative algorithm to design the BDRP using majorization-minimization (MM). Furthermore, we develop a low-complexity BDRP design with an ergodic sum-rate upper bound, simplifying the MM based design algorithm. Based on our simulation results, the proposed beam structured robust precoding can achieve a near-optimal performance with significantly reduced complexity in various scenarios.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TWC.2023.3244986</doi><tpages>1</tpages><orcidid>https://orcid.org/0000-0003-0193-6372</orcidid><orcidid>https://orcid.org/0000-0001-9107-6593</orcidid><orcidid>https://orcid.org/0000-0001-7836-6799</orcidid><orcidid>https://orcid.org/0000-0002-7894-2415</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1536-1276 |
| ispartof | IEEE transactions on wireless communications, 2023-10, Vol.22 (10), p.1-1 |
| issn | 1536-1276 1558-2248 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TWC_2023_3244986 |
| source | IEEE Electronic Library (IEL) |
| subjects | Antennas Asymptotic properties beam structured precoding Channel models Complexity Ergodic processes HF skywave communications imperfect CSI Iterative algorithms Iterative methods Massive MIMO Matrix converters MIMO communication OFDM Optimization Precoding robust precoding Robustness Symbols Upper bounds Z transforms |
| title | Robust Precoding for HF Skywave Massive MIMO |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T02%3A14%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Robust%20Precoding%20for%20HF%20Skywave%20Massive%20MIMO&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Yu,%20Xianglong&rft.date=2023-10-01&rft.volume=22&rft.issue=10&rft.spage=1&rft.epage=1&rft.pages=1-1&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2023.3244986&rft_dat=%3Cproquest_RIE%3E2875572492%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2875572492&rft_id=info:pmid/&rft_ieee_id=10049795&rfr_iscdi=true |