Search arXivSearch

arXiv · 2608.18713

Joint Power Allocation and Phase-Shift Design for Beyond-Diagonal Stacked Intelligent Metasurfaces-Aided ISAC Systems

Abstract

Stacked intelligent metasurfaces (SIM) provide an efficient architecture for integrated sensing and communication (ISAC) with few radio-frequency (RF) chains. However, diagonal SIM provide only element-wise phase control, so balancing multiuser communication and sensing performance may require additional layers. In this letter, we propose a beyond-diagonal SIM (BD-SIM) architecture for ISAC, enabling controllable intra-layer coupling through reconfigurable impedance networks, thereby enhancing wave-domain processing flexibility. We develop a unified alternating optimization framework applicable to fully-connected, group-connected, and diagonal SIM architectures. Within this framework, we derive a closed-form power allocation rule and propose an effective variable separation algorithm for multi-layer phase-shift design. Simulation results show that the proposed BD-SIM achieve a better communication-sensing trade-off and require fewer layers to attain performance comparable to conventional SIM.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuhui Jiao, Qian Zhang, Xuejun Cheng, Meihui Liu, Jiancheng An, Ju Liu. 2026-08-19. Joint Power Allocation and Phase-Shift Design for Beyond-Diagonal Stacked Intelligent Metasurfaces-Aided ISAC Systems. https://arxiv.org/abs/2608.18713

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

KEEP EXPLORING

Related papers

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

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

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