Detection of a signal in linear subspace with bounded mismatch

We consider the problem of detecting a signal of interest in a background of noise with unknown covariance matrix, taking into account a possible mismatch between the actual steering vector and the presumed one. We assume that the former belongs to a known linear subspace, up to a fraction of its energy. When the subspace of interest consists of the presumed steering vector, this amounts to assuming that the angle between the actual steering vector and the presumed steering vector is upper bounded. Within this framework, we derive the generalized likelihood ratio test (GLRT). We show that it involves solving a minimization problem with the constraint that the signal of interest lies inside a cone. We present a computationally efficient algorithm to find the maximum likelihood estimator (MLE) based on the Lagrange multiplier technique. Numerical simulations illustrate the performance and the robustness of this new detector, and compare it with the adaptive coherence estimator which assumes that the steering vector lies entirely in a subspace

Adaptive detection with bounded steering vectors mismatch angle

We address the problem of detecting a signal of interest (SOI), using multiple observations in the primary data, in a background of noise with unknown covariance matrix. We consider a situation where the signal signature is not known perfectly, but its angle with a nominal and known signature is bounded. Furthermore, we consider a possible scaling inhomogeneity between the primary and the secondary noise covariance matrix. First, assuming that the noise covariance matrix is known, we derive the generalized-likelihood ratio test (GLRT), which involves solving a semidefinite programming problem. Next, we substitute the unknown noise covariance matrix for its estimate obtained from secondary data, to yield the final detector. The latter is compared with a detector that assumes a known signal signature

Detection in the presence of surprise or undernulled interference

We consider the problem of detecting a signal of interest in the presence of colored noise, in the case of a covariance mismatch between the test cell and the training samples. More precisely, we consider a situation where an interfering signal (e.g., a sidelobe target or an undernulled interference) is present in the test cell and not in the secondary data. We show that the adaptive coherence estimator (ACE) is the generalized likelihood ratio test for such a problem, which may explain the previously observed fact that theACE has excellent sidelobe rejection capability, at the price of low mainlobe target sensitivity

Direction finding for an extended target with possibly non-symmetric spatial spectrum

We consider the problem of estimating the direction of arrival (DOA) of an extended target in radar array processing. Two algorithms are proposed that do not assume that the power azimuthal distribution of the scatterers is symmetric with respect to the mass center of the target. The first one is based on spectral moments which are easily related to the target’s DOA. The second method stems from a previous paper by the present authors and consists of a least-squares fit on the elements of the covariance matrix. Both methods are simple and are shown to provide accurate estimates. Furthermore, they extend the range of unambiguous DOAs that can be estimated, compared with the same previous paper

Steering vector errors and diagonal loading

Diagonal loading is one of the most widely used and effective methods to improve robustness of adaptive beamformers. In this paper, we consider its application to the case of steering vector errors, i.e. when there exists a mismatch between the actual steering vector of interest and the presumed one. More precisely, we address the problem of optimally selecting the loading level with a view to maximise the signal to interference plus noise ratio in the presence of random steering vector errors. First, we derive an expression for the optimal loading for a given steering vector error and we show that this loading is negative. Next, this optimal loading is averaged with respect to the probability density function of the steering vector errors, yielding a very simple expression for the average optimal loading. Numerical simulations attest to the validity of the analysis and show that diagonal loading with the optimal loading factor derived herein provides a performance close to optimum

Robust adaptive beamforming using a Bayesian steering vector error model

We propose a Bayesian approach to robust adaptive beamforming which entails considering the steering vector of interest as a random variable with some prior distribution. The latter can be tuned in a simple way to reflect how far is the actual steering vector from its presumed value. Two different priors are proposed, namely a Bingham prior distribution and a distribution that directly reveals and depends upon the angle between the true and presumed steering vector. Accordingly, a non-informative prior is assigned to the interference plus noise covariance matrix R, which can be viewed as a means to introduce diagonal loading in a Bayesian framework. The minimum mean square distance estimate of the steering vector as well as the minimum mean square error estimate of R are derived and implemented using a Gibbs sampling strategy. Numerical simulations show that the new beamformers possess a very good rate of convergence even in the presence of steering vector errors

CFAR matched direction detector

In a previously published paper by Besson et al., we considered the problem of detecting a signal whose associated spatial signature is known to lie in a given linear subspace, in the presence of subspace interference and broadband noise of known level. We extend these results to the case of unknown noise level. More precisely, we derive the generalized-likelihood ratio test (GLRT) for this problem, which provides a constant false-alarm rate (CFAR) detector. It is shown that the GLRT involves the largest eigenvalue and the trace of complex Wishart matrices. The distribution of the GLRT is derived under the hypothesis. Numerical simulations illustrate its performance and provide a comparison with the GLRT when the noise level is known

Regularized Covariance Matrix Estimation in Complex Elliptically Symmetric Distributions Using the Expected Likelihood Approach - Part 2: The Under-Sampled Case

In the first part of this series of two papers, we extended the expected likelihood approach originally developed in the Gaussian case, to the broader class of complex elliptically symmetric (CES) distributions and complex angular central Gaussian (ACG) distributions. More precisely, we demonstrated that the probability density function (p.d.f.) of the likelihood ratio (LR) for the (unknown) actual scatter matrix \mSigma_{0} does not depend on the latter: it only depends on the density generator for the CES distribution and is distribution-free in the case of ACG distributed data, i.e., it only depends on the matrix dimension $M$ and the number of independent training samples $T$, assuming that $T \geq M$. Additionally, regularized scatter matrix estimates based on the EL methodology were derived. In this second part, we consider the under-sampled scenario ($T \leq M$) which deserves a specific treatment since conventional maximum likelihood estimates do not exist. Indeed, inference about the scatter matrix can only be made in the $T$-dimensional subspace spanned by the columns of the data matrix. We extend the results derived under the Gaussian assumption to the CES and ACG class of distributions. Invariance properties of the under-sampled likelihood ratio evaluated at \mSigma_{0} are presented. Remarkably enough, in the ACG case, the p.d.f. of this LR can be written in a rather simple form as a product of beta distributed random variables. The regularized schemes derived in the first part, based on the EL principle, are extended to the under-sampled scenario and assessed through numerical simulations