Grid-free compressive beamforming

The direction-of-arrival (DOA) estimation problem involves the localization of a few sources from a limited number of observations on an array of sensors, thus it can be formulated as a sparse signal reconstruction problem and solved efficiently with compressive sensing (CS) to achieve high-resolution imaging. On a discrete angular grid, the CS reconstruction degrades due to basis mismatch when the DOAs do not coincide with the angular directions on the grid. To overcome this limitation, a continuous formulation of the DOA problem is employed and an optimization procedure is introduced, which promotes sparsity on a continuous optimization variable. The DOA estimation problem with infinitely many unknowns, i.e., source locations and amplitudes, is solved over a few optimization variables with semidefinite programming. The grid-free CS reconstruction provides high-resolution imaging even with non-uniform arrays, single-snapshot data and under noisy conditions as demonstrated on experimental towed array data.Comment: 14 pages, 8 figures, journal pape

Rational invariant subspace approximations with applications

Includes bibliographical references.Subspace methods such as MUSIC, Minimum Norm, and ESPRIT have gained considerable attention due to their superior performance in sinusoidal and direction-of-arrival (DOA) estimation, but they are also known to be of high computational cost. In this paper, new fast algorithms for approximating signal and noise subspaces and that do not require exact eigendecomposition are presented. These algorithms approximate the required subspace using rational and power-like methods applied to the direct data or the sample covariance matrix. Several ESPRIT- as well as MUSIC-type methods are developed based on these approximations. A substantial computational saving can be gained comparing with those associated with the eigendecomposition-based methods. These methods are demonstrated to have performance comparable to that of MUSIC yet will require fewer computation to obtain the signal subspace matrix

Sensor array signal processing : two decades later

Caption title.Includes bibliographical references (p. 55-65).Supported by Army Research Office. DAAL03-92-G-115 Supported by the Air Force Office of Scientific Research. F49620-92-J-2002 Supported by the National Science Foundation. MIP-9015281 Supported by the ONR. N00014-91-J-1967 Supported by the AFOSR. F49620-93-1-0102Hamid Krim, Mats Viberg

Robust Multiple Signal Classification via Probability Measure Transformation

In this paper, we introduce a new framework for robust multiple signal classification (MUSIC). The proposed framework, called robust measure-transformed (MT) MUSIC, is based on applying a transform to the probability distribution of the received signals, i.e., transformation of the probability measure defined on the observation space. In robust MT-MUSIC, the sample covariance is replaced by the empirical MT-covariance. By judicious choice of the transform we show that: 1) the resulting empirical MT-covariance is B-robust, with bounded influence function that takes negligible values for large norm outliers, and 2) under the assumption of spherically contoured noise distribution, the noise subspace can be determined from the eigendecomposition of the MT-covariance. Furthermore, we derive a new robust measure-transformed minimum description length (MDL) criterion for estimating the number of signals, and extend the MT-MUSIC framework to the case of coherent signals. The proposed approach is illustrated in simulation examples that show its advantages as compared to other robust MUSIC and MDL generalizations

A Fast DOA Estimation Algorithm Based on Polarization MUSIC

A fast DOA estimation algorithm developed from MUSIC, which also benefits from the processing of the signals' polarization information, is presented. Besides performance enhancement in precision and resolution, the proposed algorithm can be exerted on various forms of polarization sensitive arrays, without specific requirement on the array's pattern. Depending on the continuity property of the space spectrum, a huge amount of computation incurred in the calculation of 4-D space spectrum is averted. Performance and computation complexity analysis of the proposed algorithm is discussed and the simulation results are presented. Compared with conventional MUSIC, it is indicated that the proposed algorithm has considerable advantage in aspects of precision and resolution, with a low computation complexity proportional to a conventional 2-D MUSIC

Fully Quaternion-Valued Adaptive Beamforming Based on Crossed-Dipole Arrays

Based on crossed-dipole antenna arrays, quaternion-valued data models have been developed for both direction of arrival estimation and beamforming in the past. However, for almost all the models, and especially for adaptive beamforming, the desired signal is still complex-valued as in the quaternion-valued Capon beamformer. Since the complex-valued desired signal only has two components, while there are four components in a quaternion, only two components of the quaternion-valued beamformer output are used and the remaining two are simply discarded, leading to significant redundancy in its implementation. In this work, we consider a quaternion-valued desired signal and develop a fully quaternion-valued Capon beamformer which has a better performance and a much lower complexity. Furthermore, based on this full quaternion model, the robust beamforming problem is also studied in the presence of steering vector errors and a worst-case-based robust beamformer is developed. The performance of the proposed methods is verified by computer simulations

Fully Quaternion-Valued Adaptive Beamforming Based on Crossed-Dipole Arrays

Based on crossed-dipole antenna arrays, quaternion-valued data models have been developed for both direction of arrival estimation and beamforming in the past. However, for almost all the models, and especially for adaptive beamforming, the desired signal is still complex-valued as in the quaternion-valued Capon beamformer. Since the complex-valued desired signal only has two components, while there are four components in a quaternion, only two components of the quaternion-valued beamformer output are used and the remaining two are simply discarded, leading to significant redundancy in its implementation. In this work, we consider a quaternion-valued desired signal and develop a fully quaternion-valued Capon beamformer which has a better performance and a much lower complexity. Furthermore, based on this full quaternion model, the robust beamforming problem is also studied in the presence of steering vector errors and a worst-case-based robust beamformer is developed. The performance of the proposed methods is verified by computer simulations