Search arXivSearch

arXiv · 2606.15688

Twin-in-the-Loop Optimization and Fundamental Limits of Position--Velocity Estimation in Cell-Free ISAC Systems

Abstract

Digital twin (DT) networks require tight integration with wireless sensing, yet the fundamental limits of such coupling in cell-free integrated sensing and communication (ISAC) systems remain largely unexplored, particularly in the presence of fluid intelligent metasurfaces (FIM). This paper establishes a joint position-velocity Cramer-Rao bound (CRB) framework, operationalized through a twin-in-the-loop architecture. By leveraging a scatter-matrix decomposition of the velocity Fisher information, we show that single-base-station systems are inherently rank-deficient for two-dimensional velocity estimation, whereas cell-free deployments with multiple access-point pairs achieve full observability. The resulting CRB reveals a spatio-temporal decoupling: FIM shape optimization significantly improves position accuracy but does not affect the velocity CRB under isotropic waveforms while Doppler coupling asymmetrically enhances position estimation accuracy. Building on this analysis, we develop a closed-loop DT framework, deriving the critical mismatch angle in closed form and showing that angular diversity in cell-free systems mitigates DT prediction errors. We further characterize the optimal synchronization period and propose a confidence-aware scheduling strategy that reduces the DT update rate. Numerical results demonstrate substantial performance gains over single-base-station systems, with improvements attributed to angular diversity, Doppler-position coupling, and FIM adaptation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Changhao He, Xiaojuan Zhang, Geoffrey Ye Li. 2026-06-14. Twin-in-the-Loop Optimization and Fundamental Limits of Position--Velocity Estimation in Cell-Free ISAC Systems. https://arxiv.org/abs/2606.15688

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