arXiv subjects

Daniele Gerosa

Publications and source records attributed to Daniele Gerosa.

12 recordsLinked to original sources

arXiv2026

Statistical Analysis of the Extensive Cancellation Algorithm for Passive Radar Using an Imperfect Reference Signal

Passive radar systems have received tremendous attention over the past few decades, due to their low cost and ability to remain covert during operation. Such systems rely on a so-called Illuminator-of-Opportunity (IO), for example, a commercial TV station. We consider a network of Receiving Nodes (RN) without spatial resolution capability, which receives the direct signal and reflections from both stationary objects (clutter) and possible targets. After suitable preprocessing, the RNs transmit information to a Fusion Center (FC) that performs the final target detection, localization and tracking. Several methods for target localization have been proposed in the literature, and our focus is on the seminal Extensive Cancellation Algorithm (ECA). In this approach, each RN collects information about target parameters, while canceling interference using a projection. This is done by exploiting a separate Reference Channel (RC), which captures the IO signal without interference apart from receiver noise. We derive the statistical properties of the ECA parameter estimates under the assumption of a high Signal-to-Noise Ratio (SNR), and we give a sufficient condition for the SNR in the RC to enable statistically efficient estimates. The theoretical results are corroborated through computer simulations, which indicate that the theory agrees well with empirical results under practical operating conditions. The contributions of this paper can be used, for example, to design experimental setups for feasibility studies and to inform system design for achieving a desired localization accuracy.

eess.SP↗

arXiv2026

Stability Analysis for Autoregressive Sampling Sets

Motivated by recent developments in stochastic modeling of clock jitter in Analog-to-Digital Converters (ADCs) as autoregressive processes of order one (AR(1)), we study the density and stability properties of AR(1)-jittered sampling sets for Paley-Wiener signals. We show that, despite having the correct asymptotic density both on average and almost surely, such sets almost surely fail to be stable sampling sets. We complement this negative result with a finite-dimensional analysis, showing that the corresponding jittered sinc matrices are nonetheless well-conditioned with high probability.

eess.SP↗

arXiv2026

Autoregressive Stochastic Clock Jitter Compensation in Analog-to-Digital Converters

This paper addresses the mathematical modeling and compensation of stochastic discrete-time clock jitter in analog-to-digital converters (ADCs). We model the stochastic clock jitter as a first-order autoregressive (AR(1)) process, and we propose two novel, computationally efficient, pilot-assisted dejittering algorithms for baseband signals: one based on solving a sequence of weighted least-squares problems, and another that exploits the correlated jitter structure via a Kalman filter-based routine. We also propose a conditional maximum-likelihood estimator for the autoregressive parameters, enabling near-optimal Kalman-filter performance even when such parameters vary over time. We further provide a mathematical analysis of the induced linearization errors, and we complement the theory with synthetic simulations to evaluate the proposed techniques across different scenarios. The proposed techniques are shown to yield a 1-15 dB improvement in signal-to-noise-and-distortion ratio (SINADR) and 0.02-1.6 dB in symbol error vector magnitude (EVM), depending on impairment severity and pilot density. The Kalman smoother generally provides superior performance by leveraging additional temporal information.

eess.SP↗

arXiv2026

Separable Delay And Doppler Estimation In Passive Radar

In passive radar, a network of distributed sensors exploit signals from so-called Illuminators-of-Opportunity to detect and localize targets. We consider the case where the IO signal is available at each receiver node through a reference channel, whereas target returns corrupted by interference are collected in a separate surveillance channel. The problem formulation is similar to an active radar that uses a noise-like waveform, or an integrated sensing and communication application. The available data is first split into batches of manageable size. In the direct approach, the target's time-delay and Doppler parameters are estimated jointly by incoherently combining the batch-wise data. We propose a new method to estimate the time-delay separately, thus avoiding a costly 2-D search. Our approach is designed for slowly moving targets, and the accuracy of the time-delay estimate is similar to that of the full batch-wise 2-D method. Given the time-delay, the coherency between batches can be restored when estimating the Doppler parameter. Thereby, the separable approach is found to yield superior Doppler estimates over a wide parameter range. In addition to reducing computational complexity, the proposed separable estimation technique also significantly reduces the communication overhead in a distributed radar setting.

eess.SP↗

arXiv2025

Compensation of correlated autoregressive clock jitter in arrays of Analog-to-Digital Converters

In modern communication systems, the fidelity of analog-to-digital converters (ADCs) is limited by sampling clock jitter, i.e., small random timing deviations that undermine ideal sampling. Traditional scalar models often treat jitter as independent Gaussian noise, which makes it essentially untrackable, whereas real ADCs also exhibit temporally correlated (spectrally colored) imperfections. Moreover, spatial cross-correlations between channels in multiple-input multiple-output (MIMO) ADCs are commonly neglected. This paper addresses the joint tracking and compensation of random, cross-correlated timing errors in ADC arrays by modeling jitter as a coupled vector autoregressive process of order one (VAR(1)). We propose a pilot-tone-based Kalman smoother to track and compensate the jitter, and simulations demonstrate substantial reductions in jitter-induced distortion across diverse scenarios.

eess.SP↗

arXiv2025

Statistical Analysis of Target Parameter Estimation Using Passive Radar

A passive radar system uses one or more so-called Illuminators of Opportunity (IO) to detect and localize targets. In such systems, a reference channel is often used at each receiving node to capture the transmitted IO signal, while targets are detected using the main surveillance channel. The purpose of the present contribution is to analyze a method for estimating the target parameters in such a system. Specifically, we quantify the additional error contribution due to not knowing the transmitted IO waveform perfectly. A sufficient condition for this error to be negligible as compared to errors due to clutter and noise in the surveillance channel is then given.

eess.SP↗

arXiv2021

An unbiased approach to low rank recovery

Low rank recovery problems have been a subject of intense study in recent years. While the rank function is useful for regularization it is difficult to optimize due to its non-convexity and discontinuity. The standard remedy for this is to exchange the rank function for the convex nuclear norm, which is known to favor low rank solutions under certain conditions. On the downside the nuclear norm exhibits a shrinking bias that can severely distort the solution in the presence of noise, which motivates the use of stronger non-convex alternatives. In this paper we study two such formulations. We characterize the critical points and give sufficient conditions for a low rank stationary point to be unique. Moreover, we derive conditions that ensure global optimality of the low rank stationary point and show that these hold under moderate noise levels.

math.OC↗

arXiv2021

Relaxations for Non-Separable Cardinality/Rank Penalties

Rank and cardinality penalties are hard to handle in optimization frameworks due to non-convexity and discontinuity. Strong approximations have been a subject of intense study and numerous formulations have been proposed. Most of these can be described as separable, meaning that they apply a penalty to each element (or singular value) based on size, without considering the joint distribution. In this paper we present a class of non-separable penalties and give a recipe for computing strong relaxations suitable for optimization. In our analysis of this formulation we first give conditions that ensure that the globally optimal solution of the relaxation is the same as that of the original (unrelaxed) objective. We then show how a stationary point can be guaranteed to be unique under the RIP assumption (despite non-convexity of the framework).

math.OC↗

arXiv2021

An unbiased approach to compressed sensing

In compressed sensing a sparse vector is approximately retrieved from an under-determined equation system $Ax=b$. Exact retrieval would mean solving a large combinatorial problem which is well known to be NP-hard. For $b$ of the form $Ax_0+ε$ where $x_0$ and $ε$ is noise, the `oracle solution' is the one you get if you a priori know the support of $x_0$, and is the best solution one could hope for. We provide a non-convex functional whose global minimum is the oracle solution, with the property that any other local minimizer necessarily has high cardinality. We provide estimates of the type $\|\hat x-x_0\|_2\leq C\|ε\|_2$ with constants $C$ that are significantly lower than for competing methods or theorems, and our theory relies on soft assumptions on the matrix $A$, in comparison with standard results in the field. The framework also allows to incorporate a priori information on the cardinality of the sought vector. In this case we show that despite being non-convex, our cost functional has no spurious local minima and the global minima is again the `oracle solution', thereby providing the first method which is guaranteed to find this point for reasonable levels of noise, without resorting to combinatorial methods.

math.OC↗

arXiv2019

On phase retrieval via matrix completion and the estimation of low rank PSD matrices

Given underdetermined measurements of a Positive Semi-Definite (PSD) matrix $X$ of known low rank $K$, we present a new algorithm to estimate $X$ based on recent advances in non-convex optimization schemes. We apply this in particular to the phase retrieval problem for Fourier data, which can be formulated as a rank 1 PSD matrix recovery problem. Moreover, we provide theory for how oversampling affects the stability of the lifted inverse problem.

math.OC↗

arXiv2018

Bias Reduction in Compressed Sensing

Sparsity and rank functions are important ways of regularizing under-determined linear systems. Optimization of the resulting formulations is made difficult since both these penalties are non-convex and discontinuous. The most common remedy is to instead use the $\ell^1$- and nuclear-norms. While these are convex and can therefore be reliably optimized they suffer from a shrinking bias that degrades the solution quality in the presence of noise. In this paper we combine recently developed bias free non-convex alternatives with the nuclear- and $\ell^1-$penalties. This reduces bias and still enables reliable optimization properties. We develop an efficient minimization scheme using derived proximal operators and evaluate the method on several real and synthetic computer vision applications with promising results.

math.OC↗

arXiv2018

A Trace theorem for Martinet--type vector fields

In $\mathbb{R}^3$ we consider the vector fields \[ X_1 =\frac{ \partial }{\partial x},\qquad X_2 =\frac{ \partial }{\partial y}+ |x|^α\frac{ \partial }{\partial z}, \] where $α\in\left[1,+\infty\right[$. Let $\mathbb{R}^3_+ =\{(x,y,z)\in\mathbb{R}^3: z\geq 0\}$ be the (closed) upper half-space and let $f\in C^1 ( \mathbb{R} ^3_+ )$ be a function such that $X_1f, X_2f \in L^ p(\mathbb{R}^3_+)$ for some $p>1$. In this paper, we prove that the restriction of $f$ to the plane $z=0$ belongs to a suitable Besov space that is defined using the Carnot-Carathéodory metric associated with $X_1$ and $X_2$ and the related perimeter measure.

math.CA↗