arXiv subjects

Fulvio Gini

Publications and source records attributed to Fulvio Gini.

18 recordsLinked to original sources

arXiv2025

Non-Asymptotic Performance Analysis of DOA Estimation Based on Real-Valued Root-MUSIC

This paper presents a systematic theoretical performance analysis of the Real-Valued root-MUSIC (RV-root-MUSIC) algorithm under non-asymptotic conditions. A well-known limitation of RV-root-MUSIC is the estimation ambiguity caused by mirror roots, which are typically suppressed using conventional beamforming (CBF). By leveraging the equivalent subspace constructed through the conjugate extension method and exploiting the equivalence of perturbations for true and mirror roots, this work provides a comprehensive study of three key aspects: noise subspace perturbation, true-root perturbation, and mirror-root perturbation. A statistical model is established, and generalized perturbation expressions are derived. Monte Carlo simulations confirm the correctness and effectiveness of the theoretical results. The analysis provides a rigorous foundation for parameter optimization in Direction-of-Arrival (DOA) estimation, with applications in radar, wireless communications, and intelligent sensing.

cs.PF↗

arXiv2024

BCRLB Under the Fusion Extended Kalman Filter

In the process of tracking multiple point targets in space using radar, since the targets are spatially well separated, the data between them will not be confused. Therefore, the multi-target tracking problem can be transformed into a single-target tracking problem. However, the data measured by radar nodes contains noise, clutter, and false targets, making it difficult for the fusion center to directly establish the association between radar measurements and real targets. To address this issue, the Probabilistic Data Association (PDA) algorithm is used to calculate the association probability between each radar measurement and the target, and the measurements are fused based on these probabilities. Finally, an extended Kalman filter (EKF) is used to predict the target states. Additionally, we derive the Bayesian Cram\'er-Rao Lower Bound (BCRLB) under the PDA fusion framework.

eess.SP↗

arXiv2024

Coherent FDA Radar: Transmitter and Receiver Design and Analysis

The combination of frequency diverse array (FDA) radar technology with the multiple input multiple output (MIMO) radar architecture and waveform diversity techniques potentially promises a high integration gain with respect to conventional phased array (PA) radars. In this paper, we propose an approach to the design of the transmitter and the receiver of a coherent FDA (C-FDA) radar, that enables it to perform the demodulation with spectral overlapping, due to the small frequency offset. To this purpose, we derive the generalized space-time-range signal model and we prove that the proposed C-FDA radar has a higher coherent array gain than a PA radar, and at the same time, it effectively resolves the secondary range-ambiguous (SRA) problem of FDA-MIMO radar, allowing for mainlobe interference suppression and range-ambiguous clutter suppression. Numerical analysis results prove the effectiveness of the proposed C-FDA radar in terms on anti-interference and anti-clutter capabilities over conventional radars.

eess.SP↗

arXiv2024

Integrated MIMO Passive Radar Target Detection

Integrated passive radar (IPR) can be regarded as next generation passive radar technology, which aims to integrate communication and radar systems. Unlike conventional passive radar, which does not prioritize communication-centric radar technology, IPR technology places a higher priority on incorporating specific radar constraints to develop waveforms that are better suited for radar applications. This paper deals with the problem of distributed MIMO IPR target detection under uncalibrated surveillance/reference receivers. We focus on a communication-centric radar system consisting of several opportunity transmitters non-overlapping in frequency with the same bandwidth and several spatially separated receivers. Five new detectors are devised according to the likelihood ratio test (LRT), Rao, Wald, Gradient and Durbin criteria. Although, it is shown that these detectors are asymptotically equivalent, they provide different performance in the presence of noisy reference channels. The invariance principle is applied in this paper to show that all uncertainties affecting threshold setting can be unified in the direct-path signal power-to-noise power ratio (DNR) of the reference channels. To ensure effective detection threshold setting regardless of the DNR values in the reference channels, we introduce a novel strategy to adjust the level of the proposed detectors rather than their sizes. Then, we examine false alarm regulations and detection performance of the fixed-level proposed detectors to demonstrate their effectiveness compared to several existing detectors. Thus, we create a unified framework for uncalibrated MIMO IPR target detection in the presence of noisy reference channels.

eess.SP↗

arXiv2023

Resilient Sparse Array Radar with the Aid of Deep Learning

In this paper, we address the problem of direction of arrival (DOA) estimation for multiple targets in the presence of sensor failures in a sparse array. Generally, sparse arrays are known with very high-resolution capabilities, where N physical sensors can resolve up to $\mathcal{O}(N^2)$ uncorrelated sources. However, among the many configurations introduced in the literature, the arrays that provide the largest hole-free co-array are the most susceptible to sensor failures. We propose here two machine learning (ML) methods to mitigate the effect of sensor failures and maintain the DOA estimation performance and resolution. The first method enhances the conventional spatial smoothing using deep neural network (DNN), while the second one is an end-to-end data-driven method. Numerical results show that both approaches can significantly improve the performance of MRA with two failed sensors. The data-driven method can maintain the performance of the array with no failures at high signal-tonoise ratio (SNR). Moreover, both approaches can even perform better than the original array at low SNR thanks to the denoising effect of the proposed DNN

cs.LG↗

arXiv2022

Enhancement of a state-of-the-art RL-based detection algorithm for Massive MIMO radars

In the present work, a reinforcement learning (RL) based adaptive algorithm to optimise the transmit beampattern for a colocated massive MIMO radar is presented. Under the massive MIMO regime, a robust Wald type detector, able to guarantee certain detection performances under a wide range of practical disturbance models, has been recently proposed. Furthermore, an RL/cognitive methodology has been exploited to improve the detection performance by learning and interacting with the surrounding unknown environment. Building upon previous findings, we develop here a fully adaptive and data driven scheme for the selection of the hyper-parameters involved in the RL algorithm. Such an adaptive selection makes the Wald RL based detector independent of any ad hoc, and potentially suboptimal, manual tuning of the hyper-parameters. Simulation results show the effectiveness of the proposed scheme in harsh scenarios with strong clutter and low SNR values.

eess.SP↗

arXiv2021

Adaptive Sparse Array Beamformer Design by Regularized Complementary Antenna Switching

In this work, we propose a novel strategy of adaptive sparse array beamformer design, referred to as regularized complementary antenna switching (RCAS), to swiftly adapt both array configuration and excitation weights in accordance to the dynamic environment for enhancing interference suppression. In order to achieve an implementable design of array reconfiguration, the RCAS is conducted in the framework of regularized antenna switching, whereby the full array aperture is collectively divided into separate groups and only one antenna in each group is switched on to connect with the processing channel. A set of deterministic complementary sparse arrays with good quiescent beampatterns is first designed by RCAS and full array data is collected by switching among them while maintaining resilient interference suppression. Subsequently, adaptive sparse array tailored for the specific environment is calculated and reconfigured based on the information extracted from the full array data. The RCAS is devised as an exclusive cardinality-constrained optimization, which is reformulated by introducing an auxiliary variable combined with a piece-wise linear function to approximate the $l_0$-norm function. A regularization formulation is proposed to solve the problem iteratively and eliminate the requirement of feasible initial search point. A rigorous theoretical analysis is conducted, which proves that the proposed algorithm is essentially an equivalent transformation of the original cardinality-constrained optimization. Simulation results validate the effectiveness of the proposed RCAS strategy.

eess.SP↗

arXiv2021

A Reinforcement Learning based approach for Multi-target Detection in Massive MIMO radar

This paper considers the problem of multi-target detection for massive multiple input multiple output (MMIMO) cognitive radar (CR). The concept of CR is based on the perception-action cycle that senses and intelligently adapts to the dynamic environment in order to optimally satisfy a specific mission. However, this usually requires a priori knowledge of the environmental model, which is not available in most cases. We propose a reinforcement learning (RL) based algorithm for cognitive multi-target detection in the presence of unknown disturbance statistics. The radar acts as an agent that continuously senses the unknown environment (i.e., targets and disturbance) and consequently optimizes transmitted waveforms in order to maximize the probability of detection ($P_\mathsf{D}$) by focusing the energy in specific range-angle cells (i.e., beamforming). Furthermore, we propose a solution to the beamforming optimization problem with less complexity than the existing methods. Numerical simulations are performed to assess the performance of the proposed RL-based algorithm in both stationary and dynamic environments. The RL based beamforming is compared to the conventional omnidirectional approach with equal power allocation and to adaptive beamforming with no RL. As highlighted by the proposed numerical results, our RL-based beamformer outperforms both approaches in terms of target detection performance. The performance improvement is even particularly remarkable under environmentally harsh conditions such as low SNR, heavy-tailed disturbance and rapidly changing scenarios.

eess.SP↗

arXiv2020

Massive MIMO Radar for Target Detection

Since the seminal paper by Marzetta from 2010, the Massive MIMO paradigm in communication systems has changed from being a theoretical scaled-up version of MIMO, with an infinite number of antennas, to a practical technology. Its key concepts have been adopted in the 5G new radio standard and base stations, where $64$ fully-digital transceivers have been commercially deployed. Motivated by these recent developments, this paper considers a co-located MIMO radar with $M_T$ transmitting and $M_R$ receiving antennas and explores the potential benefits of having a large number of virtual spatial antenna channels $N=M_TM_R$. Particularly, we focus on the target detection problem and develop a \textit{robust} Wald-type test that guarantees certain detection performance, regardless of the unknown statistical characterization of the clutter disturbance. Closed-form expressions for the probabilities of false alarm and detection are derived for the asymptotic regime $N\to \infty$. Numerical results are used to validate the asymptotic analysis in the finite system regime with different disturbance models. Our results imply that there always exists a sufficient number of antennas for which the performance requirements are satisfied, without any a-priori knowledge of the clutter statistics. This is referred to as the Massive MIMO regime of the radar system.

eess.SP↗

arXiv2019

Scaling up MIMO radar for target detection

This work focuses on target detection in a colocated MIMO radar system. Instead of exploiting the classical temporal domain, we propose to explore the spatial dimension (i.e., number of antennas $M$) to derive asymptotic results for the detector. Specifically, we assume no a priori knowledge of the statistics of the autoregressive data generating process and propose to use a mispecified Wald-type detector, which is shown to have an asymptotic $χ$-squared distribution as $M\to\infty$. Closed-form expressions for the probabilities of false alarm and detection are derived. Numerical results are used to validate the asymptotic analysis in the finite system regime. It turns out that, for the considered scenario, the asymptotic performance is closely matched already for $M\ge 50$.

eess.SP↗

arXiv2019

Semiparametric Stochastic CRB for DOA Estimation in Elliptical Data Model

This paper aims at presenting a numerical investigation of the statistical efficiency of the MUSIC (with different covariance matrix estimates) and the IAA-APES Direction of Arrivals (DOAs) estimation algorithms under a general Complex Elliptically Symmetric (CES) distributed measurement model. Specifically, the density generator of the CES-distributed data snapshots is considered as an additional, infinite-dimensional, nuisance parameter. To assess the efficiency in the considered semiparametric setting, the Semiparametric Stochastic Cramér-Rao Bound (SSCRB) is adopted as lower bound for the Mean Square Error (MSE) of the DOA estimators.

eess.SP↗

arXiv2019

The Semiparametric Cramér-Rao Bound for Complex Elliptically Symmetric Distributions

This letter aims at extending the Constrained Semiparametric Cramer-Rao Bound (CSCRB) for the joint estimation of mean vector and scatter matrix of Real Elliptically Symmetric (RES) distributions to Complex Elliptically Symmetric (CES) distributions. A closed form expression for the complex CSCRB (CCSCRB) is derived by exploiting the so-called \textit{Wirtinger} or $\mathbb{C}\mathbb{R}$-\textit{calculus}. Finally, the CCSCRB for the estimation of the complex mean vector and scatter matrix of a set of complex $t$-distributed random vectors is provided as an example of application.

eess.SP↗

arXiv2019

Semiparametric Slepian-Bangs Formula for Complex Elliptically Symmetric Distributions

This letter aims at deriving a Semiparametric Slepian-Bangs (SSB) formula for Complex Elliptically Symmetric (CES) distributed data vectors. The Semiparametric Cramér-Rao Bound (SCRB), related to the proposed SSB formula, provides a lower bound on the Mean Square Error (MSE) of \textit{any} robust estimator of a parameter vector parameterizing the mean vector and the scatter matrix of the given CES-distributed vector in the presence of an unknown, nuisance, density generator.

eess.SP↗

arXiv2019

Semiparametric CRB and Slepian-Bangs formulas for Complex Elliptically Symmetric Distributions

The main aim of this paper is to extend the semiparametric inference methodology, recently investigated for Real Elliptically Symmetric (RES) distributions, to Complex Elliptically Symmetric (CES) distributions. The generalization to the complex field is of fundamental importance in all practical applications that exploit the complex representation of the acquired data. Moreover, the CES distributions has been widely recognized as a valuable and general model to statistically describe the non-Gaussian behaviour of datasets originated from a wide variety of physical measurement processes. The paper is divided in two parts. In the first part, a closed form expression of the constrained Semiparametric Cramér-Rao Bound (CSCRB) for the joint estimation of complex mean vector and complex scatter matrix of a set of CES-distributed random vectors is obtained by exploiting the so-called \textit{Wirtinger} or $\mathbb{C}\mathbb{R}$-\textit{calculus}. The second part deals with the derivation of the semiparametric version of the Slepian-Bangs formula in the context of the CES model. Specifically, the proposed Semiparametric Slepian-Bangs (SSB) formula provides us with a useful and ready-to-use expression of the Semiparametric Fisher Information Matrix (SFIM) for the estimation of a parameter vector parametrizing the complex mean and the complex scatter matrix of a CES-distributed vector in the presence of unknown, nuisance, density generator. Furthermore, we show how to exploit the derived SSB formula to obtain the semiparametric counterpart of the Stochastic CRB for Direction of Arrival (DOA) estimation under a random signal model assumption. Simulation results are also provided to clarify the theoretical findings and to demonstrate their usefulness in common array processing applications.

eess.SP↗

arXiv2018

Reinforcement learning-based waveform optimization for MIMO multi-target detection

A cognitive beamforming algorithm for colocated MIMO radars, based on Reinforcement Learning (RL) framework, is proposed. We analyse an RL-based optimization protocol that allows the MIMO radar, i.e. the \textit{agent}, to iteratively sense the unknown environment, i.e. the radar scene involving an unknown number of targets at unknown angular positions, and consequently, to synthesize a set of transmitted waveforms whose related beam patter is tailored on the acquired knowledge. The performance of the proposed RL-based beamforming algorithm is assessed through numerical simulations in terms of Probability of Detection ($P_D$).

eess.SP↗

arXiv2018

Semiparametric Inference and Lower Bounds for Real Elliptically Symmetric Distributions

This paper has a twofold goal. The first aim is to provide a deeper understanding of the family of the Real Elliptically Symmetric (RES) distributions by investigating their intrinsic semiparametric nature. The second aim is to derive a semiparametric lower bound for the estimation of the parametric component of the model. The RES distributions represent a semiparametric model where the parametric part is given by the mean vector and by the scatter matrix while the non-parametric, infinite-dimensional, part is represented by the density generator. Since, in practical applications, we are often interested only in the estimation of the parametric component, the density generator can be considered as nuisance. The first part of the paper is dedicated to conveniently place the RES distributions in the framework of the semiparametric group models. The second part of the paper, building on the mathematical tools previously introduced, the Constrained Semiparametric Cramér-Rao Bound (CSCRB) for the estimation of the mean vector and of the constrained scatter matrix of a RES distributed random vector is introduced. The CSCRB provides a lower bound on the Mean Squared Error (MSE) of any robust $M$-estimator of mean vector and scatter matrix when no a-priori information on the density generator is available. A closed form expression for the CSCRB is derived. Finally, in simulations, we assess the statistical efficiency of the Tyler's and Huber's scatter matrix $M$-estimators with respect to the CSCRB.

eess.SP↗

arXiv2018

A fresh look at the Semiparametric Cramér-Rao Bound

This paper aims at providing a fresh look at semiparametric estimation theory and, in particular, at the Semiparametric Cramér-Rao Bound (SCRB). Semiparametric models are characterized by a finite-dimensional parameter vector of interest and by an infinite-dimensional nuisance function that is often related to an unspecified functional form of the density of the noise underlying the observations. We summarize the main motivations and the intuitive concepts about semiparametric models. Then we provide a new look at the classical estimation theory based on a geometrical Hilbert space-based approach. Finally, the semiparametric version of the Cramér-Rao Bound for the estimation of the finite-dimensional vector of the parameters of interest is provided.

eess.SP↗

arXiv2018

Cognitive Radars: A Reality?

This paper describes some key ideas and applications of cognitive radars, highlighting the limits and the path forward. Cognitive radars are systems based on the perception-action cycle of cognition that sense the environment, learn from it relevant information about the target and the background, then adapt the radar sensor to optimally satisfy the needs of their mission according to a desired goal. The concept of cognitive radar was introduced originally for active radar only. In this paper we describe how this paradigm can be applied also to passive radar. In particular, we describe (i) cognitive active radars that work in a spectrally dense environment and change the transmitted waveform on-the-fly to avoid interference with the primary user of the channel, such as broadcast or communication systems, (ii) cognitive active radars that adjust transmit waveform parameters to achieve a specified level of target tracking performance, and (iii) cognitive passive radars, that contrary to the active radars cannot directly change the transmitted waveforms, but can instead select the best source of opportunity to improve detection and tracking performance.

eess.SP↗