Tree Search Algorithms Applied to the BD-RIS Configuration in MU-MISO Communication Systems

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: de Souza, Pedro H. C., Mendes, Luciano
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910112873971712
author de Souza, Pedro H. C.
Mendes, Luciano
author_facet de Souza, Pedro H. C.
Mendes, Luciano
contents The reconfigurable intelligent surface (RIS) has attracted considerable attention of both academia and industry in recent years, given its capacity to dynamically manipulate the reflection of incident electromagnetic waves. Although the research developed for the RIS may have reached its maturity, there are still contentious aspects and limitations regarding its potential benefits for the next generation of wireless communications. In order to improve upon the the RIS technology, the beyond diagonal reconfigurable intelligent surface (BD-RIS) was recently proposed as an promising alternative. The BD-RIS boasts a more sophisticated circuit topology that is capable of providing more combinations of different adjustments or configurations for signal reflection. However, to aptly reap the benefits of the BD-RIS, the added degrees-of-freedom of its configuration must be leveraged accordingly. Therefore, in this work we propose a depth-first tree search algorithm for configuring the BD-RIS in multi-user multiple-input single-output (MU-MISO) communication systems. Taking advantage of the tree search exploration, the proposed algorithm achieves a remarkable trade-off between channel strength maximization performance and computational complexity scalability.
format Preprint
id arxiv_https___arxiv_org_abs_2604_07045
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Tree Search Algorithms Applied to the BD-RIS Configuration in MU-MISO Communication Systems
de Souza, Pedro H. C.
Mendes, Luciano
Signal Processing
The reconfigurable intelligent surface (RIS) has attracted considerable attention of both academia and industry in recent years, given its capacity to dynamically manipulate the reflection of incident electromagnetic waves. Although the research developed for the RIS may have reached its maturity, there are still contentious aspects and limitations regarding its potential benefits for the next generation of wireless communications. In order to improve upon the the RIS technology, the beyond diagonal reconfigurable intelligent surface (BD-RIS) was recently proposed as an promising alternative. The BD-RIS boasts a more sophisticated circuit topology that is capable of providing more combinations of different adjustments or configurations for signal reflection. However, to aptly reap the benefits of the BD-RIS, the added degrees-of-freedom of its configuration must be leveraged accordingly. Therefore, in this work we propose a depth-first tree search algorithm for configuring the BD-RIS in multi-user multiple-input single-output (MU-MISO) communication systems. Taking advantage of the tree search exploration, the proposed algorithm achieves a remarkable trade-off between channel strength maximization performance and computational complexity scalability.
title Tree Search Algorithms Applied to the BD-RIS Configuration in MU-MISO Communication Systems
topic Signal Processing
url https://arxiv.org/abs/2604.07045