Search

Extremely large-scale antenna array (ELAA) systems emerge as a promising technology in beyond 5G and 6G wireless networks to support the deployment of distributed architectures. This paper explores the use of ELAAs to enable joint localization, synchronization and mapping in sub-6 GHz uplink channels, capitalizing on the near-field effects of phase-coherent distributed arrays. We focus on a scenario where a single-antenna user equipment (UE) communicates with a network of access points (APs) distributed in an indoor environment, considering both specular reflections from walls and scattering from objects. The UE is assumed to be unsynchronized to the network, while the APs can be time- and phase-synchronized to each other. We formulate the problem of joint estimation of location, clock offset and phase offset of the UE, and the locations of scattering points (SPs) (i.e., mapping). Through comprehensive Fisher information analysis, we assess the impact of bandwidth, AP array size, wall reflections, SPs and phase synchronization on localization accuracy. Furthermore, we derive the maximum-likelihood (ML) estimator, which optimally combines the information collected by all the distributed arrays. To overcome its intractable high dimensionality, we propose a novel three-step algorithm that first estimates phase offset leveraging carrier phase information of line-of-sight (LoS) paths, then determines the UE location and clock offset via LoS paths and wall reflections, and finally locates SPs using a null-space transformation technique. Simulation results demonstrate the effectiveness of our approach in distributed architectures supported by radio stripes (RSs) -- an innovative alternative for implementing ELAAs -- while revealing the benefits of carrier phase exploitation and showcasing the interplay between delay and angular information under different bandwidth regimes.

Radio stripes (RSs) is an emerging technology in beyond 5G and 6G wireless networks to support the deployment of cell-free architectures. In this paper, we investigate the potential use of RSs to enable joint positioning and synchronization in the uplink channel at sub-6 GHz bands. The considered scenario consists of a single-antenna user equipment (UE) that communicates with a network of multiple-antenna RSs distributed over a wide area. The UE is assumed to be unsynchronized to the RSs network, while individual RSs are time- and phase-synchronized. We formulate the problem of joint estimation of position, clock offset, and phase offset of the UE and derive the corresponding maximum-likelihood (ML) estimator, both with and without exploiting carrier phase information. To gain fundamental insights into the achievable performance, we also conduct a Fisher information analysis and inspect the theoretical lower bounds numerically. Simulation results demonstrate that promising positioning and synchronization performance can be obtained in cell-free architectures supported by RSs, revealing at the same time the benefits of carrier phase exploitation through phase-synchronized RSs.

We consider the problem of ESPRIT-oriented precoder design for beamspace angle-of-departure (AoD) estimation in downlink mmWave multiple-input single-output communications. Standard precoders (i.e., directional/sum beams) yield poor performance in AoD estimation, while Cramer-Rao bound-optimized precoders undermine the so-called shift invariance property (SIP) of ESPRIT. To tackle this issue, the problem of designing ESPRIT-oriented precoders is formulated to jointly optimize over the precoding matrix and the SIP-restoring matrix of ESPRIT. We develop an alternating optimization approach that updates these two matrices under unit-modulus constraints for analog beamforming architectures. Simulation results demonstrate the validity of the proposed approach while providing valuable insights on the beampatterns of the ESPRIT-oriented precoders.

Due to their shorter operating range and large bandwidth, automotive radars can resolve many reflections from their targets of interest, mainly vehicles. This calls for the use of extended-target models in place of simpler and more widely-adopted point-like target models. However, despite some preliminary work, the fundamental connection between the radar's accuracy as a function of the target vehicle state (range, orientation, shape) and radar properties remains largely unknown for extended targets. In this work, we first devise a mathematically tractable analytical model for a vehicle with arbitrary shape, modeled as an extended target parameterized by the center position, the orientation (heading) and the perimeter contour. We show that the derived expressions of the backscatter signal are tractable and correctly capture the effects of the extended-vehicle shape. Analytical derivations of the exact and approximate hybrid Cram\'er-Rao bounds for the position, orientation and contour are provided, which reveal connections with the case of point-like target and uncover the main dependencies with the received energy, bandwidth, and array size. The theoretical investigation is performed on the two different cases of known and unknown vehicle shape. Insightful simulation results are finally presented to validate the theoretical findings, including an analysis of the diversity effect of multiple radars sensing the extended target., Comment: 16 pages, double-column, 4 figures, 2 tables, journal

Reconfigurable intelligent surfaces (RISs) have attracted enormous interest thanks to their ability to overcome line-of-sight blockages in mmWave systems, enabling in turn accurate localization with minimal infrastructure. Less investigated are however the benefits of exploiting RIS with suitably designed beamforming strategies for optimized localization and synchronization performance. In this paper, a novel low-complexity method for joint localization and synchronization based on an optimized design of the base station (BS) active precoding and RIS passive phase profiles is proposed, for the challenging case of a single-antenna receiver. The theoretical position error bound is first derived and used as metric to jointly optimize the BS-RIS beamforming, assuming a priori knowledge of the user position. By exploiting the low-dimensional structure of the solution, a novel codebook-based robust design strategy with optimized beam power allocation is then proposed, which provides low-complexity while taking into account the uncertainty on the user position. Finally, a reduced-complexity maximum-likelihood based estimation procedure is devised to jointly recover the user position and the synchronization offset. Extensive numerical analysis shows that the proposed joint BS-RIS beamforming scheme provides enhanced localization and synchronization performance compared to existing solutions, with the proposed estimator attaining the theoretical bounds even at low signal-to-noise-ratio and in the presence of additional uncontrollable multipath propagation.

The paper addresses the design of adaptive radar detectors having desired behavior, in Gaussian disturbance with unknown statistics. Specifically, given detection probability specifications for chosen signal-to-noise ratios and steering vector mismatch levels, a methodology for the optimal design of customized CFAR detectors is devised in a suitable feature plane based on maximal invariant statistics. To overcome the analytical and numerical intractability of the resulting optimization problem, a novel general reduced-complexity algorithm is developed, which is shown to be effective in providing a close approximation of the desired detector. The proposed approach solves the open problem of ensuring a prefixed false alarm probability while controlling the behavior under both matched and mismatched conditions, so enabling the design of fully customized adaptive CFAR detectors.

In this paper, we propose a new solution for the detection problem of a coherent target in heterogeneous environments. Specifically, we first assume that clutter returns from different range bins share the same covariance structure but different power levels. This model meets the experimental evidence related to non-Gaussian and non-homogeneous scenarios. Then, unlike existing solutions that are based upon estimate and plug methods, we propose an approximation of the generalized likelihood ratio test where the maximizers of the likelihoods are obtained through an alternating estimation procedure. Remarkably, we also prove that such estimation procedure leads to an architecture possessing the constant false alarm rate (CFAR) when a specific initialization is used. The performance analysis, carried out on simulated as well as measured data and in comparison with suitable well-known competitors, highlights that the proposed architecture can overcome the CFAR competitors and exhibits a limited loss with respect to the other non-CFAR detectors.

Heavy-tailed random samples, as well as their sum or average, are encountered in a number of signal processing applications in radar, communications, finance, and natural sciences. Modeling such data through the Pareto distribution is particularly attractive due to its simple analytical form, but may lead to infinite variance and/or mean, which is not physically plausible: in fact, samples are always bounded in practice, namely because of clipping during the signal acquisition or deliberate censoring or trimming (truncation) at the processing stage. Based on this motivation, the paper derives and analyzes the distribution of the sum of right-censored Pareto Type-II variables, which generalizes the conventional Pareto (Type-I) and Lomax distributions. The distribution of the sum of truncated Pareto is also obtained, and an analytical connection is drawn with the unbounded case. A numerical analysis illustrates the findings, providing insights on several aspects including the intimate mixture structure of the obtained expressions.

MmWave multiple-input single-output (MISO) systems using a single-antenna receiver are regarded as promising solution for the near future, before the full-fledged 5G MIMO will be widespread. However, for MISO systems synchronization cannot be performed jointly with user localization unless two-way transmissions are used. In this paper we show that thanks to the use of a reconfigurable intelligent surface (RIS), joint localization and synchronization is possible with only downlink MISO transmissions. The direct maximum likelihood (ML) estimator for the position and clock offset is derived. To obtain a good initialization for the ML optimization, a decoupled, relaxed estimator of position and delays is also devised, which does not require knowledge of the clock offset. Results show that the proposed approach attains the Cram\'er-Rao lower bound even for moderate values of the system parameters.

We tackle the problem of estimating the spatial distribution of mobile phones from Mobile Network Operator (MNO) data, namely Call Detail Record (CDR) or signalling data. The process of transforming MNO data to a density map requires geolocating radio cells to determine their spatial footprint. Traditional geolocation solutions rely on Voronoi tessellations and approximate cell footprints by mutually disjoint regions. Recently, some pioneering work started to consider more elaborate geolocation methods with partially overlapping (non-disjoint) cell footprints coupled with a probabilistic model for phone-to-cell association. Estimating the spatial density in such a probabilistic setup is currently an open research problem and is the focus of the present work. We start by reviewing three different estimation methods proposed in literature and provide novel analytical insights that unveil some key aspects of their mutual relationships and properties. Furthermore, we develop a novel estimation approach for which a closed-form solution can be given. Numerical results based on semi-synthetic data are presented to assess the relative accuracy of each method. Our results indicate that the estimators based on overlapping cells have the potential to improve spatial accuracy over traditional approaches based on Voronoi tessellations., Comment: 19 pages, 9 figures, under submission

5G mmWave MIMO systems enable accurate estimation of the user position and mapping of the radio environment using a single snapshot when both the base station (BS) and user are equipped with large antenna arrays. However, massive arrays are initially expected only at the BS side, likely leaving users with one or very few antennas. In this paper, we propose a novel method for single-snapshot localization and mapping in the more challenging case of a user equipped with a single-antenna receiver. The joint maximum likelihood (ML) estimation problem is formulated and its solution formally derived. To avoid the burden of a full-dimensional search over the space of the unknown parameters, we present a novel practical approach that exploits the sparsity of mmWave channels to compute an approximate joint ML estimate. A thorough analysis, including the derivation of the Cram\'er-Rao lower bounds, reveals that accurate localization and mapping can be achieved also in a MISO setup even when the direct line-of-sight path between the BS and the user is severely attenuated.

Since Kelly's pioneering work on GLRT-based adaptive detection, many solutions have been proposed to enhance either selectivity or robustness of radar detectors to mismatched signals. In this paper such a problem is addressed in a different space, called CFAR feature plane and given by a suitable maximal invariant, where observed data are mapped to clusters that can be analytically described. The characterization of the trajectories and shapes of such clusters is provided and exploited for both analysis and design purposes, also shedding new light on the behavior of several well-known detectors. Novel linear and non-linear detectors are proposed with diversified robust or selective behaviors, showing that through the proposed framework it is not only possible to achieve the same performance of well-known receivers obtained by a radically different design approach (namely GLRT), but also to devise detectors with unprecedented behaviors: in particular, our results show that the highest standard of selectivity can be achieved without sacrifying neither detection power under matched conditions nor CFAR property.

A k-nearest neighbors (KNN) approach to the design of radar detectors is investigated. The idea is to start with either raw data or well-known radar receiver statistics as feature vector to be fed to the KNN decision rule. In the latter case, the probability of false alarm and probability of detection are characterized in closed-form; moreover, it is proved that the detector possesses the constant false alarm rate (CFAR) property and the relevant performance parameters are identified. Simulation examples are provided to illustrate the effectiveness of the proposed approach.

This paper proposes a novel approach to robust radar detection of range-spread targets embedded in Gaussian noise with unknown covariance matrix. The idea is to model the useful target echo in each range cell as the sum of a coherent signal plus a random component that makes the signal-plus-noise hypothesis more plausible in presence of mismatches. Moreover, an unknown power of the random components, to be estimated from the observables, is inserted to optimize the performance when the mismatch is absent. The generalized likelihood ratio test (GLRT) for the problem at hand is considered. In addition, a new parametric detector that encompasses the GLRT as a special case is also introduced and assessed. The performance assessment shows the effectiveness of the idea also in comparison to natural competitors., Comment: 28 pages, 8 figures

The paper addresses the problem of designing radar detectors more robust than Kelly's detector to possible mismatches of the assumed target signature, but with no performance degradation under matched conditions. The idea is to model the received signal under the signal-plus-noise hypothesis by adding a random component, parameterized via a design covariance matrix, that makes the hypothesis more plausible in presence of mismatches. Moreover, an unknown power of such component, to be estimated from the observables, can lead to no performance loss. Derivation of the (one-step) GLRT is provided for two choices of the design matrix, obtaining detectors with different complexity and behavior. A third parametric detector is also obtained by an ad-hoc generalization of one of such GLRTs. The analysis shows that the proposed approach can cover a range of different robustness levels that is not achievable by state-of-the-art with the same performance of Kelly's detector under matched conditions.

The paper addresses the problem of determining the unknown position of a mobile station for a mmWave MISO system. This setup is motivated by the fact that massive arrays will be initially implemented only on 5G base stations, likely leaving mobile stations with one antenna. The maximum likelihood solution to this problem is devised based on the time of flight and angle of departure of received downlink signals. While positioning in the uplink would rely on angle of arrival, it presents scalability limitations that are avoided in the downlink. To circumvent the multidimensional optimization of the optimal joint estimator, we propose two novel approaches amenable to practical implementation thanks to their reduced complexity. A thorough analysis, which includes the derivation of relevant Cram\'er-Rao lower bounds, shows that it is possible to achieve quasi-optimal performance even in presence of few transmissions, low SNRs, and multipath propagation effects.

The problem of mobile position estimation in multipath scenarios is addressed. A low-complexity, fully-adaptive algorithm is proposed, based on the pseudo maximum likelihood approach. The processing is done exclusively on-board at the mobile node by exploiting narrowband downlink radio signals. The proposed algorithm is able to estimate via adaptive beamforming (with spatial smoothing) the optimal projection matrices that maximize the likelihood; in addition, it can associate the line-of-sight over the trajectory, hence achieving an integration gain. The performance assessment shows that the proposed algorithm is very effective in (even severe) multipath conditions, outperforming natural competitors also when the number of antennas and snapshots is kept at the theoretical minimum.

We consider a network scenario in which agents can evaluate each other according to a score graph that models some interactions. The goal is to design a distributed protocol, run by the agents, that allows them to learn their unknown state among a finite set of possible values. We propose a Bayesian framework in which scores and states are associated to probabilistic events with unknown parameters and hyperparameters, respectively. We show that each agent can learn its state by means of a local Bayesian classifier and a (centralized) Maximum-Likelihood (ML) estimator of parameter-hyperparameter that combines plain ML and Empirical Bayes approaches. By using tools from graphical models, which allow us to gain insight on conditional dependencies of scores and states, we provide a relaxed probabilistic model that ultimately leads to a parameter-hyperparameter estimator amenable to distributed computation. To highlight the appropriateness of the proposed relaxation, we demonstrate the distributed estimators on a social interaction set-up for user profiling., Comment: This submission is a shorter work (for conference publication) of a more comprehensive paper, already submitted as arXiv:1706.04081 (under review for journal publication). In this short submission only one social set-up is considered and only one of the relaxed estimators is proposed. Moreover, the exhaustive analysis, carried out in the longer manuscript, is completely missing in this version

In this paper we consider a network of spatially distributed sensors which collect measurement samples of a spatial field, and aim at estimating in a distributed way (without any central coordinator) the entire field by suitably fusing all network data. We propose a general probabilistic model that can handle both partial knowledge of the physics generating the spatial field as well as a purely data-driven inference. Specifically, we adopt an Empirical Bayes approach in which the spatial field is modeled as a Gaussian Process, whose mean function is described by means of parametrized equations. We characterize the Empirical Bayes estimator when nodes are heterogeneous, i.e., perform a different number of measurements. Moreover, by exploiting the sparsity of both the covariance and the (parametrized) mean function of the Gaussian Process, we are able to design a distributed spatial field estimator. We corroborate the theoretical results with two numerical simulations: a stationary temperature field estimation in which the field is described by a partial differential (heat) equation, and a data driven inference in which the mean is parametrized by a cubic spline.

In this paper we consider a network scenario in which agents can evaluate each other according to a score graph that models some physical or social interaction. The goal is to design a distributed protocol, run by the agents, allowing them to learn their unknown state among a finite set of possible values. We propose a Bayesian framework in which scores and states are associated to probabilistic events with unknown parameters and hyperparameters respectively. We prove that each agent can learn its state by means of a local Bayesian classifier and a (centralized) Maximum-Likelihood (ML) estimator of the parameter-hyperparameter that combines plain ML and Empirical Bayes approaches. By using tools from graphical models, which allow us to gain insight on conditional dependences of scores and states, we provide two relaxed probabilistic models that ultimately lead to ML parameter-hyperparameter estimators amenable to distributed computation. In order to highlight the appropriateness of the proposed relaxations, we demonstrate the distributed estimators on a machine-to-machine testing set-up for anomaly detection and on a social interaction set-up for user profiling.

In this paper we consider a network of agents monitoring a spatially distributed arrival process. Each node measures the number of arrivals seen at its monitoring point in a given time-interval with the objective of estimating the unknown local arrival rate. We propose an asynchronous distributed approach based on a Bayesian model with unknown hyperparameter, where each node computes the minimum mean square error (MMSE) estimator of its local arrival rate in a distributed way. As a result, the estimation at each node "optimally" fuses the information from the whole network through a distributed optimization algorithm. Moreover, we propose an ad-hoc distributed estimator, based on a consensus algorithm for time-varying and directed graphs, which exhibits reduced complexity and exponential convergence. We analyze the performance of the proposed distributed estimators, showing that they: (i) are reliable even in presence of limited local data, and (ii) improve the estimation accuracy compared to the purely decentralized setup. Finally, we provide a statistical characterization of the proposed estimators. In particular, for the ad-hoc estimator, we show that as the number of nodes goes to infinity its mean square error converges to the optimal one. Numerical Monte Carlo simulations confirm the theoretical characterization and highlight the appealing performances of the estimators.