Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 2436-2440 |
| Number of pages | 5 |
| Journal | IEEE Communications Letters |
| Volume | 27 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 1 Sept 2023 |
Keywords
- Massive MIMO
- beam selection
- beamspace
- mmWave communications
- precoding