On the Complexity Reduction of Beam Selection Algorithms for Beamspace MIMO Systems

Beamspace multiple-input multiple-output (B-MIMO) provides a promising solution for reducing the number of required expensive radio frequency (RF) chains without obvious performance loss. However, the high computational complexities of beam selection algorithms prohibits their practical applications...

Full description

Saved in:
Bibliographic Details
Published in:IEEE wireless communications letters 2021-07, Vol.10 (7), p.1439-1443
Main Authors: Zhang, Qianyun, Li, Xinwei, Wu, Bi-Yi, Cheng, Lei, Gao, Yue
Format: Article
Language:English
Subjects:
Algorithms
Beam selection
beamforming
beamspace
Communications systems
Complexity
Heuristic algorithms
high dimensional multiuser-MIMO
Massive MIMO
Millimeter waves
MIMO
MIMO communication
Numerical simulation
Perturbation methods
Perturbation theory
precoding
Radio frequency
Reduction
Sparse matrices
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c291t-31b85d987472ece208944a0814e640e9cbd8b838ae7474ae68733ca5e3d93f433
cites cdi_FETCH-LOGICAL-c291t-31b85d987472ece208944a0814e640e9cbd8b838ae7474ae68733ca5e3d93f433
container_end_page 1443
container_issue 7
container_start_page 1439
container_title IEEE wireless communications letters
container_volume 10
creator Zhang, Qianyun
Li, Xinwei
Wu, Bi-Yi
Cheng, Lei
Gao, Yue
description Beamspace multiple-input multiple-output (B-MIMO) provides a promising solution for reducing the number of required expensive radio frequency (RF) chains without obvious performance loss. However, the high computational complexities of beam selection algorithms prohibits their practical applications in 5G millimeter wave (mmWave) massive MIMO communication systems. Reviewing existing beam selection procedures and using the matrix perturbation theory, the complexity reduction on beam selection for beamspace MIMO is considered in this letter. Two beam selection algorithms, one for B-MIMO systems with classic zero-forcing (ZF) precoder and the other for the systems with QR precoder are proposed. Theoretical analyses and numerical simulations all show that the proposed beam selection algorithms possess a much lower complexity than conventional ones.
doi_str_mv 10.1109/LWC.2021.3069650
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_proquest_journals_2549756346</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9390201</ieee_id><sourcerecordid>2549756346</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-31b85d987472ece208944a0814e640e9cbd8b838ae7474ae68733ca5e3d93f433</originalsourceid><addsrcrecordid>eNo9kN1LwzAQwIMoOHTvgi8Bnzvz1TR5nMWPwcbAKT6GrL26jnapSQbuv7ezY_dyx93v7uCH0B0lE0qJfpx_5RNGGJ1wIrVMyQUaMSpZwrhIL881z67ROIQt6UMSyqgaodVyh-MGcO7aroHfOh7wO5T7ItZuh12Fn8C2eAUNDJ1p8-18HTdtwJXz_9PQ2QLwYrZY4tUhRGjDLbqqbBNgfMo36PPl-SN_S-bL11k-nScF0zQmnK5VWmqViYxBAYwoLYQligqQgoAu1qVaK64s9ISwIFXGeWFT4KXmleD8Bj0MdzvvfvYQotm6vd_1Lw1Lhc5SyYXsKTJQhXcheKhM5-vW-oOhxBztmd6eOdozJ3v9yv2wUgPAGddcE0Yo_wNtAWk4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2549756346</pqid></control><display><type>article</type><title>On the Complexity Reduction of Beam Selection Algorithms for Beamspace MIMO Systems</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Zhang, Qianyun ; Li, Xinwei ; Wu, Bi-Yi ; Cheng, Lei ; Gao, Yue</creator><creatorcontrib>Zhang, Qianyun ; Li, Xinwei ; Wu, Bi-Yi ; Cheng, Lei ; Gao, Yue</creatorcontrib><description>Beamspace multiple-input multiple-output (B-MIMO) provides a promising solution for reducing the number of required expensive radio frequency (RF) chains without obvious performance loss. However, the high computational complexities of beam selection algorithms prohibits their practical applications in 5G millimeter wave (mmWave) massive MIMO communication systems. Reviewing existing beam selection procedures and using the matrix perturbation theory, the complexity reduction on beam selection for beamspace MIMO is considered in this letter. Two beam selection algorithms, one for B-MIMO systems with classic zero-forcing (ZF) precoder and the other for the systems with QR precoder are proposed. Theoretical analyses and numerical simulations all show that the proposed beam selection algorithms possess a much lower complexity than conventional ones.</description><identifier>ISSN: 2162-2337</identifier><identifier>EISSN: 2162-2345</identifier><identifier>DOI: 10.1109/LWC.2021.3069650</identifier><identifier>CODEN: IWCLAF</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Beam selection ; beamforming ; beamspace ; Communications systems ; Complexity ; Heuristic algorithms ; high dimensional multiuser-MIMO ; Massive MIMO ; Millimeter waves ; MIMO ; MIMO communication ; Numerical simulation ; Perturbation methods ; Perturbation theory ; precoding ; Radio frequency ; Reduction ; Sparse matrices</subject><ispartof>IEEE wireless communications letters, 2021-07, Vol.10 (7), p.1439-1443</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-31b85d987472ece208944a0814e640e9cbd8b838ae7474ae68733ca5e3d93f433</citedby><cites>FETCH-LOGICAL-c291t-31b85d987472ece208944a0814e640e9cbd8b838ae7474ae68733ca5e3d93f433</cites><orcidid>0000-0001-6502-9910 ; 0000-0002-2147-4059 ; 0000-0001-7790-3839</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9390201$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,54771</link.rule.ids></links><search><creatorcontrib>Zhang, Qianyun</creatorcontrib><creatorcontrib>Li, Xinwei</creatorcontrib><creatorcontrib>Wu, Bi-Yi</creatorcontrib><creatorcontrib>Cheng, Lei</creatorcontrib><creatorcontrib>Gao, Yue</creatorcontrib><title>On the Complexity Reduction of Beam Selection Algorithms for Beamspace MIMO Systems</title><title>IEEE wireless communications letters</title><addtitle>LWC</addtitle><description>Beamspace multiple-input multiple-output (B-MIMO) provides a promising solution for reducing the number of required expensive radio frequency (RF) chains without obvious performance loss. However, the high computational complexities of beam selection algorithms prohibits their practical applications in 5G millimeter wave (mmWave) massive MIMO communication systems. Reviewing existing beam selection procedures and using the matrix perturbation theory, the complexity reduction on beam selection for beamspace MIMO is considered in this letter. Two beam selection algorithms, one for B-MIMO systems with classic zero-forcing (ZF) precoder and the other for the systems with QR precoder are proposed. Theoretical analyses and numerical simulations all show that the proposed beam selection algorithms possess a much lower complexity than conventional ones.</description><subject>Algorithms</subject><subject>Beam selection</subject><subject>beamforming</subject><subject>beamspace</subject><subject>Communications systems</subject><subject>Complexity</subject><subject>Heuristic algorithms</subject><subject>high dimensional multiuser-MIMO</subject><subject>Massive MIMO</subject><subject>Millimeter waves</subject><subject>MIMO</subject><subject>MIMO communication</subject><subject>Numerical simulation</subject><subject>Perturbation methods</subject><subject>Perturbation theory</subject><subject>precoding</subject><subject>Radio frequency</subject><subject>Reduction</subject><subject>Sparse matrices</subject><issn>2162-2337</issn><issn>2162-2345</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNo9kN1LwzAQwIMoOHTvgi8Bnzvz1TR5nMWPwcbAKT6GrL26jnapSQbuv7ezY_dyx93v7uCH0B0lE0qJfpx_5RNGGJ1wIrVMyQUaMSpZwrhIL881z67ROIQt6UMSyqgaodVyh-MGcO7aroHfOh7wO5T7ItZuh12Fn8C2eAUNDJ1p8-18HTdtwJXz_9PQ2QLwYrZY4tUhRGjDLbqqbBNgfMo36PPl-SN_S-bL11k-nScF0zQmnK5VWmqViYxBAYwoLYQligqQgoAu1qVaK64s9ISwIFXGeWFT4KXmleD8Bj0MdzvvfvYQotm6vd_1Lw1Lhc5SyYXsKTJQhXcheKhM5-vW-oOhxBztmd6eOdozJ3v9yv2wUgPAGddcE0Yo_wNtAWk4</recordid><startdate>20210701</startdate><enddate>20210701</enddate><creator>Zhang, Qianyun</creator><creator>Li, Xinwei</creator><creator>Wu, Bi-Yi</creator><creator>Cheng, Lei</creator><creator>Gao, Yue</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>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0001-6502-9910</orcidid><orcidid>https://orcid.org/0000-0002-2147-4059</orcidid><orcidid>https://orcid.org/0000-0001-7790-3839</orcidid></search><sort><creationdate>20210701</creationdate><title>On the Complexity Reduction of Beam Selection Algorithms for Beamspace MIMO Systems</title><author>Zhang, Qianyun ; Li, Xinwei ; Wu, Bi-Yi ; Cheng, Lei ; Gao, Yue</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-31b85d987472ece208944a0814e640e9cbd8b838ae7474ae68733ca5e3d93f433</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Beam selection</topic><topic>beamforming</topic><topic>beamspace</topic><topic>Communications systems</topic><topic>Complexity</topic><topic>Heuristic algorithms</topic><topic>high dimensional multiuser-MIMO</topic><topic>Massive MIMO</topic><topic>Millimeter waves</topic><topic>MIMO</topic><topic>MIMO communication</topic><topic>Numerical simulation</topic><topic>Perturbation methods</topic><topic>Perturbation theory</topic><topic>precoding</topic><topic>Radio frequency</topic><topic>Reduction</topic><topic>Sparse matrices</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Qianyun</creatorcontrib><creatorcontrib>Li, Xinwei</creatorcontrib><creatorcontrib>Wu, Bi-Yi</creatorcontrib><creatorcontrib>Cheng, Lei</creatorcontrib><creatorcontrib>Gao, Yue</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE wireless communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Qianyun</au><au>Li, Xinwei</au><au>Wu, Bi-Yi</au><au>Cheng, Lei</au><au>Gao, Yue</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Complexity Reduction of Beam Selection Algorithms for Beamspace MIMO Systems</atitle><jtitle>IEEE wireless communications letters</jtitle><stitle>LWC</stitle><date>2021-07-01</date><risdate>2021</risdate><volume>10</volume><issue>7</issue><spage>1439</spage><epage>1443</epage><pages>1439-1443</pages><issn>2162-2337</issn><eissn>2162-2345</eissn><coden>IWCLAF</coden><abstract>Beamspace multiple-input multiple-output (B-MIMO) provides a promising solution for reducing the number of required expensive radio frequency (RF) chains without obvious performance loss. However, the high computational complexities of beam selection algorithms prohibits their practical applications in 5G millimeter wave (mmWave) massive MIMO communication systems. Reviewing existing beam selection procedures and using the matrix perturbation theory, the complexity reduction on beam selection for beamspace MIMO is considered in this letter. Two beam selection algorithms, one for B-MIMO systems with classic zero-forcing (ZF) precoder and the other for the systems with QR precoder are proposed. Theoretical analyses and numerical simulations all show that the proposed beam selection algorithms possess a much lower complexity than conventional ones.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/LWC.2021.3069650</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0001-6502-9910</orcidid><orcidid>https://orcid.org/0000-0002-2147-4059</orcidid><orcidid>https://orcid.org/0000-0001-7790-3839</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 2162-2337
ispartof IEEE wireless communications letters, 2021-07, Vol.10 (7), p.1439-1443
issn 2162-2337
2162-2345
language eng
recordid cdi_proquest_journals_2549756346
source IEEE Electronic Library (IEL) Journals
subjects Algorithms
Beam selection
beamforming
beamspace
Communications systems
Complexity
Heuristic algorithms
high dimensional multiuser-MIMO
Massive MIMO
Millimeter waves
MIMO
MIMO communication
Numerical simulation
Perturbation methods
Perturbation theory
precoding
Radio frequency
Reduction
Sparse matrices
title On the Complexity Reduction of Beam Selection Algorithms for Beamspace MIMO Systems
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T13%3A36%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Complexity%20Reduction%20of%20Beam%20Selection%20Algorithms%20for%20Beamspace%20MIMO%20Systems&rft.jtitle=IEEE%20wireless%20communications%20letters&rft.au=Zhang,%20Qianyun&rft.date=2021-07-01&rft.volume=10&rft.issue=7&rft.spage=1439&rft.epage=1443&rft.pages=1439-1443&rft.issn=2162-2337&rft.eissn=2162-2345&rft.coden=IWCLAF&rft_id=info:doi/10.1109/LWC.2021.3069650&rft_dat=%3Cproquest_ieee_%3E2549756346%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c291t-31b85d987472ece208944a0814e640e9cbd8b838ae7474ae68733ca5e3d93f433%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2549756346&rft_id=info:pmid/&rft_ieee_id=9390201&rfr_iscdi=true