Search arXiv⌕ Search

arXiv · 2609.37622

Joint Localization and Data Detection in Ambient Backscatter Communications: Uncertainty-Preserving Inference and Cross-Frame Geometry Consensus

Abstract

We address joint continuous localization and data detection in ambient backscatter communication, where weak observations can leave competing geometry hypotheses plausible and a staged point-estimate interface can discard information about this ambiguity. We develop the \emph{Geometry-aware Frame Network (GeoFrameNet)}, which projects channel frequency responses onto a physics-derived delay--angle-of-arrival lattice and aggregates sign-robust evidence across orthogonal frequency-division multiplexing symbols to form a shared geometry posterior over physically feasible candidates. Localization uses the full posterior with candidate-specific refinement; detection combines candidate-conditioned differential logits using posterior weights renormalized over selected candidates. Bit supervision guides geometry scoring. For a fixed device, the \emph{Cross-Frame Geometry Consensus Network (CFGC-Net)} fuses frozen GeoFrameNet candidate logits and features across frames for localization while preserving frame-wise detection outputs. On an independent test set, GeoFrameNet achieves lower localization root-mean-square error (RMSE) than an all-symbol multiple-measurement-vector sparse Bayesian learning (MMV-SBL) baseline at all eight evaluated signal-to-noise ratio (SNR) points, with simultaneous bit error rate and RMSE reductions from $-30$ to $-22.5$~dB. At $-30$~dB SNR, the respective RMSEs are 3.1573 and 18.8859~m. CFGC-Net achieves the lowest aggregate RMSE among the evaluated fusion strategies for two, four, and eight frames.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xianhua Yu, Dong Li, Bowen Gu, Tianhao Liang, Tingting Zhang. 2026-09-29. Joint Localization and Data Detection in Ambient Backscatter Communications: Uncertainty-Preserving Inference and Cross-Frame Geometry Consensus. https://arxiv.org/abs/2609.37622

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

KEEP EXPLORING

Related papers

Memory in Behavioral Models as Motion on a Slow Invariant Manifold

A single-tone large-signal operating point of a nonlinear two-port is a periodic orbit of a periodically forced circuit. When the device has memory (self-heating, trapping), the Floquet exponents of that orbit separate into fast (electrical) and slow (thermal and trapping) modes, and long-term memory is motion on the invariant manifold attached to the slow modes. An existence and uniqueness theorem for that manifold follows from the parameterization method of Cabré, Fontich and de la Llave, applied to the stroboscopic map at the orbit; the manifold is the spectral submanifold of Haller and Ponsioen, without a small-forcing parameter. The manifold is a bundle over the circle of drive phase, its fiber dimension the number of slow Floquet exponents, and the dynamic X-parameter kernel of Verspecht et al. identifies its reduced dynamics from step changes of the drive amplitude. Consequently, an exact reduced model has as many memory states as slow exponents, the memoryless X-parameter surface is the fixed-point family of the reduced dynamics, and the envelope-domain model is the reduced dynamics driven by the envelope. The hypotheses are verified and the manifold constructed for a GaN HEMT compact model with a three-pole thermal network and a drain-lag trap: the trap contributes a $14\,μ$s time constant set by the linearization and not by its $6$ ms emission time, the thermal submanifolds are nearly flat with linear reduced dynamics, and the expansion in the trap direction is valid only within a few thermal voltages ($nV_T\approx26$ mV), so trap memory needs a global representation of the manifold.

eess.SP↗

Blind Interference Suppression in IRS-Aided Wireless Systems: A Statistical Channel Ratio Estimation Approach

This paper addresses the problem of suppressing non-cooperative interference in intelligent reflecting surface (IRS)-aided wireless links without any channel state information (CSI) or cooperation from the interferer. We propose a fully blind framework that relies solely on received signal power measurements. A key insight is that nulling the aggregate interference channel requires only the complex ratios between the IRS-reflected paths and the direct interference link, rather than absolute CSI. We develop a novel estimation algorithm that obtains unbiased estimates of these channel ratios using only power samples collected under random IRS configurations. Theoretically, we prove that unbiased estimation is feasible when the number of discrete phase levels $K\geq 3$, and establish the Cramer-Rao lower bounds (CRLBs) for both the phase offset and amplitude ratio estimates, thus providing design guidance. Based on the estimated ratios, we propose two low-complexity IRS phase optimization algorithms: a one-shot greedy method and an iterative variant that mitigates error propagation from weakly reflecting elements. Simulations demonstrate that the proposed schemes can suppress strong interference to within a few dB of the interference-free upper bound, offering a practical, CSI-free solution for robust wireless communications in contested spectral environments.

eess.SP↗

Blind Interference Suppression for IRS-Aided Robust Wireless Communications

The application of intelligent reflecting surfaces (IRSs) to suppress interference in wireless communication systems has recently attracted significant research attention. Most existing approaches rely on complete or partial channel state information (CSI) to configure the IRS. However, acquiring accurate CSI in IRS-assisted systems involves considerable pilot overhead and introduces non-negligible delays. This issue is further exacerbated under strong interference conditions, where interfering sources are typically non-cooperative, making CSI acquisition even more challenging. As a result, existing CSI-dependent interference suppression methods become difficult to deploy in practice. To address these limitations, we propose a novel blind interference suppression strategy that combines a proportional phase-inversion (PPI) algorithm with the conditional sample mean (CSM) method. The proposed approach determines the IRS configuration using only the received signal power, without requiring any prior CSI. We conduct a comprehensive performance evaluation by deriving the theoretical performance of the proposed scheme, which is subsequently verified through numerical simulations. Furthermore, simulation results across various parameter settings demonstrate that the proposed blind interference suppression scheme reduces the interference power to the level of noise, thereby achieving a marked signal-to-interference-plus-noise ratio (SINR) improvement and outperforms existing benchmark schemes.

eess.SP↗