Search arXivSearch

arXiv · 2102.05890

Near-field Tracking with Large Antenna Arrays: Fundamental Limits and Practical Algorithms

Abstract

Applications towards 6G have brought a huge interest towards arrays with a high number of antennas and operating within the millimeter and sub-THz bandwidths for joint communication and localization. With such large arrays, the plane wave approximation is often not accurate because the system may operate in the near-field propagation region (Fresnel region) where the electromagnetic field wavefront is spherical. In this case, the curvature of arrival (CoA) is a measure of the spherical wavefront that can be used to infer the source position using only a single large array. In this paper, we study a near-field tracking problem for inferring the state (i.e., the position and velocity) of a moving source with an ad-hoc observation model that accounts for the phase profile of a large receiving array. For this tracking problem, we derive the posterior Cramér-Rao Lower Bound (P-CRLB) and show the effects when the source moves inside and outside the Fresnel region. We provide insights on how the loss of positioning information outside Fresnel comes from an increase of the ranging error rather than from inaccuracies of angular estimation. Then, we investigate the performance of different Bayesian tracking algorithms in the presence of model mismatches and abrupt trajectory changes. Our results demonstrate the feasibility and high accuracy for most of the tracking approaches without the need of wideband signals and of any synchronization scheme. signals and of any synchronization scheme.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anna Guerra, Francesco Guidi, Davide Dardari, Petar M. Djuric. 2021-02-11. Near-field Tracking with Large Antenna Arrays: Fundamental Limits and Practical Algorithms. https://doi.org/10.1109/tsp.2021.3101696

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