Beamspace MIMO Systems With Reduced Beam Selection Complexity
Beamspace MIMO Systems With Reduced Beam Selection Complexity
复制标题
DOI：
10.1109/lcomm.2023.3264104
复制
发表时间：
2023-05
期刊：
影响因子：
--
通讯作者：
Sinasi Cetinkaya;H. Arslan
中科院分区：
文献类型：
--
作者：
Sinasi Cetinkaya;H. Arslan
波束空间多输入多输出（B-MIMO）系统具有适当的波束选择（BS），承诺降低射频（RF）链开销，而不会显着降低性能。由于迭代搜索或交替优化所产生的计算成本，大多数现有的BS方案是不实用的。因此，这封信研究了具有增量QR预编码器（I-QR-P）和减量QR预编码器（D-QR-P）的现有BS的复杂度降低。所提出的两阶段和三阶段算法分别降低了D-QR-P和I-QR-P的复杂度。两者都旨在通过消除对任何用户都没有贡献的波束来减小候选波束大小并使用矩阵扰动理论来更新QR分解来降低复杂度。数值结果表明，所提出的算法大大降低了复杂度，同时保持了类似的和率与基线算法。
Beamspace multiple-input multiple-output (B-MIMO) systems with proper beam selection (BS) promise to lower the radio-frequency (RF) chains overhead with no noticeable degradation in performance. Most of the existing BS schemes are not practical due to the computational cost arising from iterative search or alternating optimization. Hence, this letter examines the complexity reduction of the existing BS with incremental QR precoder (I-QR-P) and decremental QR precoder (D-QR-P). The proposed two-stage and three-stage algorithms reduce the complexity of D-QR-P and I-QR-P, respectively. Both aim to lower complexity by decreasing the candidate beam size by eliminating the beams with no contribution to any user and using matrix perturbation theory to update QR decompositions. Numerical results reveal that the proposed algorithms considerably reduce the complexity while maintaining a similar sum-rate with baseline algorithms.