Robust adaptive beamforming in partly calibrated sparse sensor arrays
IEEE Transactions on Signal Processing
Multidimensional Systems and Signal Processing
| Hi-index | 35.69 |
The problem of using a partly calibrated array for maximum likelihood (ML) bearing estimation of possibly coherent signals buried in unknown correlated noise fields is shown to admit a neat solution under fairly general conditions. More exactly, this paper assumes that the array contains some calibrated sensors, whose number is only required to be larger than the number of signals impinging on the array, and also that the noise in the calibrated sensors is uncorrelated with the noise in the other sensors. These two noise vectors, however, may have arbitrary spatial autocovariance matrices. Under these assumptions the many nuisance parameters (viz., the elements of the signal and noise covariance matrices and the transfer and location characteristics of the uncalibrated sensors) can be eliminated from the likelihood function, leaving a significantly simplified concentrated likelihood whose maximum yields the ML bearing estimates. The ML estimator introduced in this paper, and referred to as MLE, is shown to be asymptotically equivalent to a recently proposed subspace-based bearing estimator called UNCLE and rederived herein by a much simpler approach than in the original work. A statistical analysis derives the asymptotic distribution of the MLE and UNCLE estimates, and proves that they are asymptotically equivalent and statistically efficient. In a simulation study, the MLE and UNCLE methods are found to possess very similar finite-sample properties as well. As UNCLE is computationally more efficient, it may be the preferred technique in a given application