摘要
To realize beamspace MIMO with beam selection more efficiently, we propose low-complexity beam selection algorithms based on singular value decomposition (SVD). We first diagonalize the channel matrix by SVD, and select the appropriate beams one by one in a decremental or incremental order to maximize the sum-rate. To reduce the complexity of the proposed algorithms, we update eigenvalues by solving the secular equation instead of SVD from scratch again. Our method can achieve O(Nr2Nc2) , which is at most one in Nt+NrNr of the state-of-the-art method. Analytical and simulation results demonstrate that our proposed algorithms outperform the state-of-the-art algorithms in terms of the sum-rate and complexity.
源语言 | 英语 |
---|---|
页(从-至) | 2436-2440 |
页数 | 5 |
期刊 | IEEE Communications Letters |
卷 | 27 |
期 | 9 |
DOI | |
出版状态 | 已出版 - 1 9月 2023 |