Array Processing Estimation Research Articles

Combining MUSIC Spatial Sampling and Bootstrap to Estimate Closed Space DOA for Few Samples

DOA estimation in array processing uses MUSIC (Multiple Signal Classification) algorithm, mainly. It’s the most investigated technique and is very attractive because of its simplicity. However, it meets drawbacks and fails when only very few samples are available and the sources are very close or highly correlated. In these conditions, the problem is more intricate and the detection of targets becomes arduous. To overcome these problems, a new algorithm is developed in this paper. We combine bootstrap technique to increase sample size, spatial sampling and MUSIC method to improve resolution. Through different simulations, the performance and the effectiveness of the proposed approach, referred as spatial Sampling and Bootstrapped technique ‘’SSBoot’’, are demonstrated.

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

Direction of arrival (DOA) estimation in array processing using uniform/sparse linear arrays is concerned in this paper. While sparse methods via approximate parameter discretization have been popular in the past decade, the discretization may cause problems, e.g., modeling error and increased computations due to dense sampling. In this paper, an exact discretization-free method, named as sparse and parametric approach (SPA), is proposed for uniform and sparse linear arrays. SPA carries out parameter estimation in the continuous range based on well-established covariance fitting criteria and convex optimization. It guarantees to produce a sparse parameter estimate without discretization required by existing sparse methods. Theoretical analysis shows that the SPA parameter estimator is a large-snapshot realization of the maximum likelihood estimator and is statistically consistent (in the number of snapshots) under uncorrelated sources. Other merits of SPA include improved resolution, applicability to arbitrary number of snapshots, robustness to correlation of the sources and no requirement of user-parameters. Numerical simulations are carried out to verify our analysis and demonstrate advantages of SPA compared to existing methods.

Maximum Likelihood-Based Direction-of-Arrival Estimator for Discrete Sources

This paper addresses the problem of direction-of-arrival (DOA) parameter estimation in array processing when the signals are inherently discrete, which is the case mainly in the digital communication context. Based on the particular structure of the signal space in the data model, a maximum likelihood-based approach is introduced. The strategy consists in transforming the parameter estimation problem into a decision task. It is shown through numerical simulations that the proposed solution closely follows the performance limit given by the Cramer–Rao bound. Some important features of the technique are as follows: (i) it is capable of handling any number of sources, provided that the number of sensors is greater than or equal to two and the number of snapshots is sufficiently greater than the cardinality of the signal space; (ii) the estimation quality is not affected by the angle and phase separation; and (iii) it offers the possibility to deal with uncalibrated arrays.

A unified approach to sparse signal processing

A unified view of the area of sparse signal processing is presented in tutorial form by bringing together various fields in which the property of sparsity has been successfully exploited. For each of these fields, various algorithms and techniques, which have been developed to leverage sparsity, are described succinctly. The common potential benefits of significant reduction in sampling rate and processing manipulations through sparse signal processing are revealed. The key application domains of sparse signal processing are sampling, coding, spectral estimation, array processing, component analysis, and multipath channel estimation. In terms of the sampling process and reconstruction algorithms, linkages are made with random sampling, compressed sensing, and rate of innovation. The redundancy introduced by channel coding in finite and real Galois fields is then related to over-sampling with similar reconstruction algorithms. The error locator polynomial (ELP) and iterative methods are shown to work quite effectively for both sampling and coding applications. The methods of Prony, Pisarenko, and MUltiple SIgnal Classification (MUSIC) are next shown to be targeted at analyzing signals with sparse frequency domain representations. Specifically, the relations of the approach of Prony to an annihilating filter in rate of innovation and ELP in coding are emphasized; the Pisarenko and MUSIC methods are further improvements of the Prony method under noisy environments. The iterative methods developed for sampling and coding applications are shown to be powerful tools in spectral estimation. Such narrowband spectral estimation is then related to multi-source location and direction of arrival estimation in array processing. Sparsity in unobservable source signals is also shown to facilitate source separation in sparse component analysis; the algorithms developed in this area such as linear programming and matching pursuit are also widely used in compressed sensing. Finally, the multipath channel estimation problem is shown to have a sparse formulation; algorithms similar to sampling and coding are used to estimate typical multicarrier communication channels.

A unified approach to sparse signal processing

A unified view of the area of sparse signal processing is presented in tutorial form by bringing together various fields in which the property of sparsity has been successfully exploited. For each of these fields, various algorithms and techniques, which have been developed to leverage sparsity, are described succinctly. The common potential benefits of significant reduction in sampling rate and processing manipulations through sparse signal processing are revealed. The key application domains of sparse signal processing are sampling, coding, spectral estimation, array processing, component analysis, and multipath channel estimation. In terms of the sampling process and reconstruction algorithms, linkages are made with random sampling, compressed sensing, and rate of innovation. The redundancy introduced by channel coding in finite and real Galois fields is then related to over-sampling with similar reconstruction algorithms. The error locator polynomial (ELP) and iterative methods are shown to work quite effectively for both sampling and coding applications. The methods of Prony, Pisarenko, and MUltiple SIgnal Classification (MUSIC) are next shown to be targeted at analyzing signals with sparse frequency domain representations. Specifically, the relations of the approach of Prony to an annihilating filter in rate of innovation and ELP in coding are emphasized; the Pisarenko and MUSIC methods are further improvements of the Prony method under noisy environments. The iterative methods developed for sampling and coding applications are shown to be powerful tools in spectral estimation. Such narrowband spectral estimation is then related to multi-source location and direction of arrival estimation in array processing. Sparsity in unobservable source signals is also shown to facilitate source separation in sparse component analysis; the algorithms developed in this area such as linear programming and matching pursuit are also widely used in compressed sensing. Finally, the multipath channel estimation problem is shown to have a sparse formulation; algorithms similar to sampling and coding are used to estimate typical multicarrier communication channels.

Super resolution time delay estimation via MODE-WRELAX

We consider estimating time delays and amplitudes (real- or complex-valued) from the superposition of very closely spaced signals with known shapes. The well-known high resolution MODE (Method Of Direction Estimation) algorithm, which was originally proposed for angle estimation in array processing, is modified and used with our efficient time delay estimation method WRELAX (Weighted Fourier transform and RELAXation based) algorithm to deal with this problem. The proposed method is referred to as MODE-WRELAX. MODE-WRELAX provides better accuracy than MODE and higher resolution than WRELAX. Moreover, it can be used for both complex- and real-valued signals (including those with highly oscillatory correlation functions). Numerical results show that the MODE-WRELAX estimates can approach the corresponding Cramer-Rao bound. Efficient implementation of the algorithm is also discussed.

Min-norm interpretations and consistency of MUSIC, MODE and ML

The multiple signal characterization (MUSIC) approach, its generalization to correlated signals known as the method of direction estimation (MODE), and the deterministic maximum likelihood (ML) approach for bearing estimation in array processing are shown to be signal subspace fitting approaches in a minimum norm sense. MODE, for example, is shown to be an approach in which the array manifold is linearly estimated from principal empirical eigenvectors in a minimum weighted Frobenius norm sense. Using the min-norm interpretations, a unified proof for strong consistency of the three approaches is provided for stationary and ergodic signals.