2022
DOI: 10.1109/ojcoms.2021.3139858
|View full text |Cite
|
Sign up to set email alerts
|

Matrix-Inverse-Free Deep Unfolding of the Weighted MMSE Beamforming Algorithm

Abstract: Downlink beamforming is a key technology for cellular networks. However, computing beamformers that maximize the weighted sum rate (WSR) subject to a power constraint is an NP-hard problem. The popular weighted minimum mean square error (WMMSE) algorithm converges to a local optimum but still exhibits considerable complexity.In order to address this trade-off between complexity and performance, we propose to apply deep unfolding to the WMMSE algorithm for a MU-MISO downlink channel. The main idea consists of m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
15
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 25 publications
(15 citation statements)
references
References 54 publications
(80 reference statements)
0
15
0
Order By: Relevance
“…Our main goal is to replace the complex matrix inverses that appear in the update equations of 1 U (9a), W (9b), and V (9c) with more efficient operations that can leverage parallel implementation. In our previous paper [25], which addresses the MU-MISO scenario, we proposed to circumvent the matrix inverse in V by resorting to projected gradient descent steps. In the MISO case only the update of V involves matrix inverse operations because U and W are scalars.…”
Section: The Matrix-inverse-free Wmmse Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…Our main goal is to replace the complex matrix inverses that appear in the update equations of 1 U (9a), W (9b), and V (9c) with more efficient operations that can leverage parallel implementation. In our previous paper [25], which addresses the MU-MISO scenario, we proposed to circumvent the matrix inverse in V by resorting to projected gradient descent steps. In the MISO case only the update of V involves matrix inverse operations because U and W are scalars.…”
Section: The Matrix-inverse-free Wmmse Algorithmmentioning
confidence: 99%
“…Conversely, in the MU-MIMO scenario, all the three variables (U , W , and V ) are matrices and all the updates involve matrix inverse operations. For V , we can apply the gradient descent (GD) approach as in [25] with the exception that the reformulation proposed by [23] obviates the need for the projection. For U , we can adopt the same approach as for V , but for W we cannot.…”
Section: The Matrix-inverse-free Wmmse Algorithmmentioning
confidence: 99%
See 3 more Smart Citations