Metraipolis › archive › dc_9246ffe54d5e

A Low-Dimensional Riemannian Alternating Optimization Algorithm for BD-RIS-Assisted Multiuser Beamforming — arXiv:2609.33305

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33305
License (as archived)
CC0-1.0
Archived
2026-10-08T01:36:37.840Z
SHA-256 of the archived text
3eb53ad7c167ca3a4f70c28de7bff35db6abc92afe1f74e9e529024f64d60db4
Stable URL of this page
https://metraipolis.com/documento/dc_9246ffe54d5e

How to cite

A Low-Dimensional Riemannian Alternating Optimization Algorithm for BD-RIS-Assisted Multiuser Beamforming — arXiv:2609.33305 — arXiv (en), https://arxiv.org/abs/2609.33305 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9246ffe54d5e (Metraipolis archive dc_9246ffe54d5e, sha256 3eb53ad7c167ca3a4f70c28de7bff35db6abc92afe1f74e9e529024f64d60db4)
BibTeX
@misc{dc9246ffe54d5e,
  title = {A Low-Dimensional Riemannian Alternating Optimization Algorithm for BD-RIS-Assisted Multiuser Beamforming — arXiv:2609.33305},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33305},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9246ffe54d5e; sha256 3eb53ad7c167ca3a4f70c28de7bff35db6abc92afe1f74e9e529024f64d60db4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33305. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper investigates joint active and passive beamforming for a multiuser downlink system assisted by a fully-connected beyond-diagonal reconfigurable intelligent surface (BD-RIS). Since the number of tunable components grows quadratically with the number of RIS elements, directly optimizing the full scattering matrix becomes increasingly computationally expensive. To address this challenge, we first derive an equivalent low-dimensional formulation that replaces the full scattering matrix with a variable whose number of columns equals the number of users. We further establish a smooth manifold structure on a dense subset of the equivalent feasible set, based on which we develop a low-dimensional Riemannian alternating optimization (LD-RAO) algorithm, where the passive variable is updated using a single Riemannian gradient ascent step at each iteration. The convergence of LD-RAO is established under mild assumptions. Numerical results demonstrate that the proposed algorithm achieves the same performance as the existing state-of-the-art (SOTA) full-dimensional methods with significantly less CPU time, particularly for large-scale BD-RIS.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-29 in eess.SP).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.33305 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T01:11:02.805Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).