Search arXivSearch

arXiv · 2603.02122

Deep Unfolding for SIM-Assisted Multiband MU-MISO Downlink Systems

Abstract

To improve the efficiency of scarce radio-frequency (RF) resources in next-generation wireless systems, an intelligent transceiver architecture based on stacked intelligent metasurfaces (SIM) has recently emerged, where multiple programmable metasurface layers are cascaded and each layer comprises passive meta-atoms that perform beamforming directly in the wave domain. In parallel, inter-band carrier aggregation enables multi-band transmission with high spectral efficiency. Their integration in multi-band multiuser downlink transmission is challenging because a single SIM phase configuration must remain effective across all subcarriers, while user scheduling and power allocation vary across scheduling intervals. To address these challenges, we propose an alternating-optimization framework that decomposes the joint design into a power-constrained precoder update and a SIM phase update. For the SIM phase subproblem, we develop a physically consistent multi-band deep-unfolding network (MBDU-Net) that unrolls projected-gradient phase updates into a compact trainable architecture. Each stage computes an analytic gradient from the cascaded SIM channel model and learns lightweight parameters, including per-stage step sizes and band-aware scaling, enabling fast convergence. Numerical results for multi-band multiuser downlink scenarios demonstrate reliable convergence and consistent sum-rate gains on unseen channel realizations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muhammad Ibrahim, Amine Mezghani, Ekram Hossain. 2026-05-08. Deep Unfolding for SIM-Assisted Multiband MU-MISO Downlink Systems. https://arxiv.org/abs/2603.02122

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