Iterative Sparse Asymptotic Minimum Variance Based Approaches for Array Processing

  title={Iterative Sparse Asymptotic Minimum Variance Based Approaches for Array Processing},
  author={Habti Abeida and Qilin Zhang and Jian Li and Nadjim Merabtine},
  journal={IEEE Transactions on Signal Processing},
This paper presents a series of user parameter-free iterative Sparse Asymptotic Minimum Variance (SAMV) approaches for array processing applications based on the asymptotically minimum variance (AMV) criterion. With the assumption of abundant snapshots in the direction-of-arrival (DOA) estimation problem, the signal powers and noise variance are jointly estimated by the proposed iterative AMV approach, which is later proved to coincide with the Maximum Likelihood (ML) estimator. We then propose… 

Figures from this paper

Efficient sparse parameter estimation based methods for two-dimensional DOA estimation of coherent signals

: This study addresses the problem of direction-of-arrival (DOA) estimation of coherent signals via sparse parameter estimation. Since many sparse methods provide good performances regardless of

A Discretization-Free Sparse and Parametric Approach for Linear Array Signal Processing

An exact discretization-free method, named as sparse and parametric approach (SPA), is proposed for uniform and sparse linear arrays that carries out parameter estimation in the continuous range based on well-established covariance fitting criteria and convex optimization and is statistically consistent under uncorrelated sources.

Robust direction‐of‐arrival estimation based on sparse asymptotic minimum variance

Simulation results show that, compared with other algorithms, the RSAMV algorithm has higher spatial resolution ability and weak target detection ability, its spatial spectrum has higher sparseness than other sparse algorithms and its performance is more robust than other SAMV algorithms.

Sparse Asymptotic Minimum Variance Bearing Estimation of Underwater Acoustic Sources

The sparse asymptotic minimum variance (SAMV) approach for array processing was developed by Abeida et al. and applied to the one-dimensional (1-D) problem of direction-of-arrival (DOA) estimation of

Parameter estimation of coherently distributed sources using sparse representation

In this paper, a new estimator of coherently distributed source employing the sparse representation technology is proposed by utilizing subspace fitting principle. The proposed method uses the

A Two-Step Compressed Sensing Approach for Single-Snapshot DOA Estimation of Closely Spaced Signals

Single-snapshot direction-of-arrival (DOA) estimation plays an important role in dynamic target detection and tracking applications. Because a single-snapshot signal provides few information for



Source Localization and Sensing: A Nonparametric Iterative Adaptive Approach Based on Weighted Least Squares

This paper presents a nonparametric and hyperparameter, free-weighted, least squares-based iterative adaptive approach for amplitude and phase estimation (IAA-APES) in array processing and shows that further improvements in resolution and accuracy can be achieved by applying the parametric relaxation-based cyclic approach (RELAX).

Fast implementation of sparse iterative covariance-based estimation for source localization.

Fast implementations of the sparse iterative covariance-based estimation (SPICE) algorithm are presented for source localization with a uniform linear array (ULA) and it is shown that the computational complexity of the SPICE algorithm can be mitigated by exploiting the Toeplitz structure of the array output covariance matrix using Gohberg-Semencul factorization.

Fast implementation of sparse iterative covariance-based estimation for array processing

It is shown in this paper that the computational complexity of the SPICE algorithm can be reduced by exploiting the Toeplitz structure of the array output covariance matrix using the Gohberg-Semencul factorization.

Efficiency of subspace-based DOA estimators

ML estimation of signal power in the presence of unknown noise field-simple approximate estimator and explicit Cramer-Rao bound

It is shown analytically that the AML estimator achieves the CRB in the majority of practically important cases and computer simulations show that the estimation errors of the AMl estimator are very close to theCRB for a wide SNR range.

A sparse signal reconstruction perspective for source localization with sensor arrays

This work presents a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold that has a number of advantages over other source localization techniques, including increased resolution, improved robustness to noise, limitations in data quantity, and correlation of the sources.

Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm

A view of the algorithm as a novel optimization method which combines desirable characteristics of both classical optimization and learning-based algorithms is provided and Mathematical results on conditions for uniqueness of sparse solutions are also given.

Asymptotically minimum variance second-order estimation for noncircular signals with application to DOA estimation

  • J. Delmas
  • Computer Science
    IEEE Transactions on Signal Processing
  • 2004
This paper addresses asymptotically minimum variance (AMV) algorithms within the class of algorithms based on second-order statistics for estimating direction-of-arrival (DOA) parameters of possibly

Bayesian SAR imaging

A maximum a posteriori (MAP) algorithm and a sparse learning via iterative minimization (SLIM) algorithm are introduced to synthetic aperture radar (SAR) imaging and it is shown how MAP and SLIM can be adapted to the SAR imaging application and used to enhance the image quality.

SPICE: A Sparse Covariance-Based Estimation Method for Array Processing

This paper presents a novel SParse Iterative Covariance-based Estimation approach, abbreviated as SPICE, to array processing. The proposed approach is obtained by the minimization of a covariance