Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2505.14263

Swarm Intelligence Optimization of Multi-RIS Aided MmWave Beamspace MIMO

Zaid Abdullah·Mario R. Camana·Abuzar B. M. Adam·Chandan K. Sheemar·Eva Lagunas·Symeon Chatzinotas
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate the performance of a multiple reconfigurable intelligence surface (RIS)-aided millimeter wave (mmWave) beamspace multiple-input multiple-output (MIMO) system with multiple users (UEs). We focus on a challenging scenario in which the direct links between the base station (BS) and all UEs are blocked, and communication is facilitated only via RISs. The maximum ratio transmission (MRT) is utilized for data precoding, while a low-complexity algorithm based on particle swarm optimization (PSO) is designed to jointly perform beam selection, power allocation, and RIS profile configuration. The proposed optimization approach demonstrates positive trade-offs between the complexity (in terms of running time) and the achievable sum rate. In addition, our results demonstrate that due to the sparsity of beamspace channels, increasing the number of unit cells (UCs) at RISs can lead to higher achievable rates than activating a larger number of beams at the MIMO BS.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zaid Abdullah, Mario R. Camana, Abuzar B. M. Adam, Chandan K. Sheemar, Eva Lagunas, Symeon Chatzinotas. 2025-05-20. Swarm Intelligence Optimization of Multi-RIS Aided MmWave Beamspace MIMO. https://arxiv.org/abs/2505.14263

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗