Graph signals arise from physical networks, such as power and communication systems, or a result of convenient representation data with complex structure, social networks. We consider the problem general graph signal recovery noisy, corrupted, incomplete measurements under structural parametric constraints, smoothness in frequency domain. In this paper, we formulate non-Bayesian estimation weig...

This paper addresses data-aided (DA) synchronization, in which the reference parameter acquisition is aided by a training sequence known to the receiver. The Cramer–Rao lower bound (CRB) for the DA timing and/or carrier phase recovery is presented. For DA parameter estimation, the CRB typically varies with the training sequence. This indicates that different training sequences offer fundamental...

In this paper, we model complex signals by approximating the phase and the logarithm of the time-varying amplitude of the signal as a finite-order polynomial. We refer to a signal that has this form as an exponential polynomial signal (EPS). We derive an iterative maximum-likelihood (ML) estimation algorithm to estimate the unknown parameters of the EPS model. The initialization of the ML algor...

This paper investigates a direct Target Motion Analysis (TMA) estimator for the problem of calculating the states (i.e. source positions, velocities, etc.) of multiple sources from measurements made with multiple (fixed or moving) antenna arrays. We use the novel Subspace Data Fusion (SDF) approach and extend it to the multisensor case. In the SDF approach, subspaces are formed in a first pre-p...

This paper establishes the large-sample accuracy properties of two nonlinear least-squares estimators (NLSE) of sine waves parameters: the basic NLSE, which ignores the possible correlation of the noise, and the optimal NLSE, which, besides the sine-wave parameters, also estimates the noise correlation (appropriately parametrized). It is shown that these two NLS estimators have the same accurac...

In this paper, we address the data-aided joint estimation of frequency offsets and channel coefficients in the uplink transmission of MIMO-OFDMA systems. A compact and informative expression of the Cramér-Rao Bound (CRB) is derived for large training sequence sizes. It is shown that the asymptotic performance bounds do not depend on the number of users and the values of the frequency offsets. M...

In this paper we present a performance model for depth estimation using single image depth from defocus (SIDFD). Our model is based on an original expression of the Cramér-Rao bound (CRB) in this context. We show that this model is consistent with the expected behavior of SIDFD. We then study the influence on the performance of the optical parameters of a conventional camera such as the focal l...

The problem of training symbol placement for the estimation of block-fading channel is first considered. The channel is frequency selective with correlated random taps. The Cramér-Rao Bound (CRB) on the mean square error (MSE) of channel estimators is derived and minimized with respect to the pilot symbols and their placement. It is shown that, among all orthogonal pilot sequence placements, th...

We consider discrete wavelet transform (DWT) multiscale products for detection and estimation of steps. Here the DWT is an overcomplete approximation to smoothed gradient estimation, with smoothing varied over dyadic scale, as developed by Mallat and Zhong. We show that the multiscale product approach, as first proposed by Rosenfeld for edge detection, is a nonlinear whitening transformation. W...

The information about the distance of separation between two point targets that is contained in scattering data is explored in the context of the scalar Helmholtz operator via the Fisher information and associated Cramér-Rao bound (CRB) relevant to unbiased target separation estimation. The CRB results are obtained for the exact multiple scattering model and, for reference, also for the single ...