Two-timescale weighted sum-rate maximization for large cellular and cell-free massive MIMO
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910517946220544 |
|---|---|
| author | Miretti, Lorenzo Björnson, Emil Stańczak, Sławomir |
| author_facet | Miretti, Lorenzo Björnson, Emil Stańczak, Sławomir |
| contents | We reconsider the problem of joint power control and beamforming design to maximize the weighted sum rate in large and potentially cell-free massive MIMO networks. In contrast to the available short-term methods, where an iterative algorithm is run for every instantaneous channel realization, we derive an iterative algorithm that can be run only sporadically leveraging known channel statistics, with minor performance loss. In addition, our algorithm also applies to the design of non-trivial cooperative beamforming schemes subject to limited sharing of instantaneous channel state information. Furthermore, our algorithm generalizes and outperforms the competing long-term methods from the massive MIMO literature, which are restricted to long-term power control only or to long-term joint power control and large-scale fading decoding design. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_06050 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Two-timescale weighted sum-rate maximization for large cellular and cell-free massive MIMO Miretti, Lorenzo Björnson, Emil Stańczak, Sławomir Information Theory Signal Processing We reconsider the problem of joint power control and beamforming design to maximize the weighted sum rate in large and potentially cell-free massive MIMO networks. In contrast to the available short-term methods, where an iterative algorithm is run for every instantaneous channel realization, we derive an iterative algorithm that can be run only sporadically leveraging known channel statistics, with minor performance loss. In addition, our algorithm also applies to the design of non-trivial cooperative beamforming schemes subject to limited sharing of instantaneous channel state information. Furthermore, our algorithm generalizes and outperforms the competing long-term methods from the massive MIMO literature, which are restricted to long-term power control only or to long-term joint power control and large-scale fading decoding design. |
| title | Two-timescale weighted sum-rate maximization for large cellular and cell-free massive MIMO |
| topic | Information Theory Signal Processing |
| url | https://arxiv.org/abs/2407.06050 |