SearcharxivSearch

arXiv · 2609.14801

Task-Aware Beamforming for Semantic Wireless Localization

Abstract

Many semantic localization tasks require determining a contextually meaningful region or state rather than minimizing the error of a full Cartesian position estimate. In such settings, aggregate localization accuracy need not align with the accuracy of the semantic decision. This paper develops a Cramér--Rao bound (CRB)-based framework that uses the local geometry of a known semantic map to guide uplink receive beamforming. Using local boundary crossing as a surrogate for semantic misclassification, we derive normal information maximization (NIM), which minimizes the CRB of the position component along the local semantic boundary normal. Under the considered single-path line-of-sight model, an optimal receive codebook can be restricted to the subspace spanned by the matched steering vector and its angular derivative, reducing the design to an allocation of measurement resources between matched and derivative spatial modes. We derive the resulting allocation for a general smooth boundary, with geofencing and intrusion detection arising as radial and tangential limiting cases. The framework is further extended to multi-region semantic maps through a distance-normalized minimax criterion and to uncertain prior locations through worst-case and prior-weighted robust formulations. Numerical results with finite-slot implementations and observation-level Monte Carlo simulations using profile maximum-likelihood (ML) estimation show that NIM allocates measurements according to the task-relevant boundary geometry and can substantially reduce semantic error relative to the classic squared position error bound (SPEB) design in the considered scenarios. The empirical results also closely follow the local CRB-based boundary-crossing approximation in the studied operating regime.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad Mahdi Mojahedian, Alireza Pourafzal, Musa Furkan Keskin, Henk Wymeersch. 2026-09-13. Task-Aware Beamforming for Semantic Wireless Localization. https://arxiv.org/abs/2609.14801

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