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!
Description
Summary: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.
ISSN:2162-2337
2162-2345
DOI:10.1109/LWC.2021.3069650