Search arXivSearch

arXiv · 2608.16634

Cramér-Rao Bound Analysis for Cell-Free ISAC Systems with Fluid Intelligent Metasurfaces

Abstract

Fluid intelligent metasurface (FIM) is an emerging antenna architecture that continuously reshapes its physical geometry to optimize wireless performance. While existing studies on FIM-aided integrated sensing and communication (ISAC) rely on co-located single-base-station (BS) deployments, they fundamentally underutilize FIM's morphological flexibility due to restricted observation angles. In this paper, we investigate a FIM-augmented cell-free ISAC architecture, where distributed access points (APs) collaboratively observe a target from diverse angles. We derive the complete Fisher information matrix for target angle estimation and obtain a closed-form localization CRB that explicitly quantifies the angular diversity gain. By analyzing the block structure of the Fisher information matrix, we uncover three cell-free-specific phenomena: (i) cross-AP information coupling, (ii) multiplicative Tx--Rx FIM coupling, and (iii) angular diversity amplification. Under a 28\,GHz configuration with four APs and eight FIM elements per AP, our analysis shows that distributed angular diversity amplifies the FIM morphing gain to 15.8\,dB, compared to only 0.4\,dB in a single-AP pair deployment with the same total antenna count. We further propose an alternating optimization algorithm for joint beamforming and FIM shape design via semidefinite relaxation whose tightness is formally proved. Numerical results confirm that the proposed cell-free FIM-ISAC architecture achieves a 4.5\,dB localization CRB reduction over the single-AP fixed-array baseline at 10\,dB sensing SNR while maintaining communication quality-of-service constraints across the entire Pareto frontier.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Changhao He, Asmaa Abdallah, Ahmed M. Eltawil. 2026-08-17. Cramér-Rao Bound Analysis for Cell-Free ISAC Systems with Fluid Intelligent Metasurfaces. https://arxiv.org/abs/2608.16634

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