Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2502.11565

STARS-Enabled Full-Duplex Two-Way mMIMO System Under Spatially-Correlated Channels

Anastasios Papazafeiropoulos·Pandelis Kourtessis·Symeon Chatzinotas·Dimitra I. Kaklamani·Iakovos S. Venieris
View original source ↗Read source document ↗Export metadata ↓

Abstract

\underline{S}imultaneous \underline{t}ransmitting \underline{a}nd \underline{r}eflecting \underline{s}urface (STARS)-assisted systems have emerged to fill this gap by providing $ 360^{\circ}$ wireless coverage. In parallel, full-duplex (FD) communication offers a higher achievable rate through efficient spectrum utilization compared to the half-duplex (HD) counterpart. Moreover, two-way/bi-directional communications in an FD system can further enhance the system's spectral efficiency. Hence, in this paper, we propose a STARS-enabled massive MIMO deployment in an FD two-way communication network for highly efficient spectrum utilization, while covering the dead zones around the STARS. This model enables simultaneous information exchange between multiple nodes, while \emph{potentially} doubling the spectral efficiency (SE). By invoking the use-and-then-forget (UaTF) combining scheme, we derive a closed-form expression for an achievable SE at each user of the system considering both uplink and downlink communications based on statistical channel state information (CSI), while also accounting for imperfect CSI and correlated fading conditions. Moreover, we formulate an optimization problem to obtain an optimal passive beamforming matrix design at the STARS that maximizes the sum achievable SE. The considered problem is non-convex and we propose a provably-convergent low-complexity algorithm, termed as \underline{pro}jected \underline{gr}adient \underline{a}scent \underline{m}ethod (ProGrAM), to obtain a stationary solution. Extensive numerical results are provided to establish the performance superiority of the FD STARS-enabled system over the HD STARS-enabled and FD conventional RIS (cRIS)-enabled counterparts, and also to show the effect of different parameters of interest on the system performance.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anastasios Papazafeiropoulos, Pandelis Kourtessis, Symeon Chatzinotas, Dimitra I. Kaklamani, Iakovos S. Venieris. 2025-02-17. STARS-Enabled Full-Duplex Two-Way mMIMO System Under Spatially-Correlated Channels. https://arxiv.org/abs/2502.11565

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↗