Search arXivSearch

arXiv · 2510.24190

Flexible Intelligent Layered Metasurfaces for Downlink Multi-user MISO Communications

Abstract

Stacked intelligent metasurfaces (SIMs) have recently gained attention as a paradigm for wave-domain signal processing with reduced reliance on costly radio-frequency (RF) chains. However, conventional SIMs rely on uniform inter-layer spacing and require deep stacking to ensure processing capability, resulting in severe power attenuation in practice. To address this issue, we propose a flexible intelligent layered metasurface (FILM) architecture consisting of two shape-controllable flexible metasurface layers. By replacing rigid metasurfaces with flexible ones in both layers, the transmission coefficient matrix can be dynamically adjusted, significantly decreasing the number of required layers while maintaining signal processing performance. Firstly, we develop a two-layer FILM-assisted multi-user multiple-input single-output (MU-MISO) system, wherein we formulate a channel fitting problem aimed at reducing the difference between the FILM-induced and target channels. Then, we solve this non-convex problem by employing an alternating optimization (AO) method, featuring closed-form phase shift updates and a gradient descent-based shape optimization. Furthermore, we analyze the upper bound on sum-rate and the complexity of computation to provide insights into design trade-offs. Finally, simulation results demonstrated that the proposed transmissive FILM architecture achieves over 200\% improvement in sum-rate and more than 7 dB bit-error rate (BER) gain compared to the conventional seven-layer SIMs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hong Niu, Jiancheng An, Chau Yuen. 2025-10-28. Flexible Intelligent Layered Metasurfaces for Downlink Multi-user MISO Communications. https://arxiv.org/abs/2510.24190

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