Stefano Fortunati

Stefano Fortunati

Auto-generated profile, based on publicly available information

Stefano Fortunati

SAMOVAR, Tlcom SudParis, Institut Polytechnique de Paris, Palaiseau, France

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 November 2017 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
SFStefano Fortunati
Stefano Fortunati
GFGini Fulvio
Gini Fulvio
MGMaria Sabrina Greco
Maria Sabrina Greco
CRChrist D. Richmond
Christ D. Richmond
Inferring information from a set of acquired data is the main objective of any signal processing (SP) method. The common problem of estimating the value of a vector of parameters from a set of noisy measurements is at the core of a plethora of scientific and technological advances in recent decades, including wireless communications, radar and sonar, biomedicine, image processing, and seismology.

17 January 2020 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SFStefano Fortunati
Stefano Fortunati
LSLuca Sanguinetti
Luca Sanguinetti
GFGini Fulvio
Gini Fulvio
MGMaria Sabrina Greco
Maria Sabrina Greco
BHBraham Himed
Braham Himed
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_T M_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

30 July 2014 in EURASIP Journal on Advances in Signal Processing
Verified
Journal Article
Open access
PDF file
SFStefano Fortunati
Stefano Fortunati
RGRaffaele Grasso
Raffaele Grasso
FGFulvio Gini
Fulvio Gini
MGMaria Sabrina Greco
Maria Sabrina Greco
KLKevin LePage
Kevin LePage
This paper deals with the problem of estimating the directions of arrival (DOA) of multiple source signals from a single observation vector of an array data. In particular, four estimation algorithms based on the theory of compressed sensing (CS), i.e., the classicalℓ1minimization (or Least Absolute Shrinkage and Selection Operator, LASSO), the fast smoothℓ0minimization, and the Sparse Iterative Covariance-Based Estimator, SPICE and the Iterative Adaptive Approach for Amplitude and Phase Estimation, IAA-APES algorithms, are analyzed, and their statistical properties are investigated and compared with the classical Fourier beamformer (FB) in different simulated scenarios. We show that unlike the classical FB, a CS-based beamformer (CSB) has some desirable properties typical of the adaptive algorithms (e.g., Capon and MUSIC) even in the single snapshot case. Particular attention is devoted to the super-resolution property. Theoretical arguments and simulation analysis provide evidence that a CS-based beamformer can achieve resolution beyond the classical Rayleigh limit. Finally, the theoretical findings are validated by processing a real sonar dataset.

24 February 2021 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
AAAya Mostafa Ahmed
Aya Mostafa Ahmed
AAAlaa Alameer Ahmad
Alaa Alameer Ahmad
SFStefano Fortunati
Stefano Fortunati
ASAydin Sezgin
Aydin Sezgin
MGMaria Sabrina Greco
Maria Sabrina Greco
GFGini Fulvio
Gini Fulvio
This article considers the problem of multitarget detection for massive multiple input multiple output 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 multitarget 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 beamformin 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.

8 February 2016 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SFStefano Fortunati
Stefano Fortunati
FGFulvio Gini
Fulvio Gini
MGMaria Sabrina Greco
Maria Sabrina Greco
This paper focuses on the application of recent results on lower bounds under misspecified models to the estimation of the scatter matrix of complex elliptically symmetric (CES) distributed random vectors. Buildings upon the original works of Q. H. Vuong [Cramér-Rao Bounds for Misspecified Models, Div. of the Humanities and Social Sci., California Inst. of Technol., Pasadena, CA, USA, Working Paper 652, Oct. 1986] and Richmond-Horowitz [“Parameter Bounds on Estimation Accuracy Under Model Misspecification,” IEEE Trans. Signal Process., vol. 63, no. 9, pp. 2263-2278, May 2015], a lower bound, named misspecified Cramér-Rao bound (MCRB), for the error covariance matrix of any unbiased (in a proper sense) estimator of a deterministic parameter vector under misspecified models, is introduced. Then, we show how to apply these results to the problem of estimating the scatter matrix of CES distributed data under data mismodeling. In particular, the performance of the maximum likelihood (ML) estimator are compared, under mismatched conditions, with the MCRB and with the classical CRB in some relevant study cases.

6 December 2010 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SFStefano Fortunati
Stefano Fortunati
AFAlfonso Farina
Alfonso Farina
FGFulvio Gini
Fulvio Gini
AGAntonio Graziano
Antonio Graziano
MGMaria Sabrina Greco
Maria Sabrina Greco
SGSofia Giompapa
Sofia Giompapa
An important prerequisite for successful multisensor integration is that the data from the reporting sensors are transformed to a common reference frame free of systematic or registration bias errors. If not properly corrected, the registration errors can seriously degrade the global surveillance system performance by increasing tracking errors and even introducing ghost tracks. The relative sensor registration (or grid-locking) process aligns remote data to local data under the assumption that the local data are bias free and that all biases reside with the remote sensor. In this paper, we consider all registration errors involved in the grid-locking problem, i.e., attitude, measurement, and position biases. A linear least squares (LS) estimator of these bias terms is derived and its statistical performance compared to the hybrid Cramér-Rao lower bound (HCRLB) as a function of sensor locations, sensors number, and accuracy of sensor measurements.