Performance analysis of direction finding with large arrays andfinite data

  • Authors:
  • M. Viberg;B. Ottersten;A. Nehorai

  • Affiliations:
  • Dept. of Appl. Electron., Chalmers Univ. of Technol., Goteborg;-;-

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 1995

Quantified Score

Hi-index 35.68

Visualization

Abstract

This paper considers analysis of methods for estimating the parameters of narrow-band signals arriving at an array of sensors. This problem has important applications in, for instance, radar direction finding and underwater source localization. The so-called deterministic and stochastic maximum likelihood (ML) methods are the main focus of this paper. A performance analysis is carried out assuming a finite number of samples and that the array is composed of a sufficiently large number of sensors. Several thousands of antennas are not uncommon in, e.g., radar applications. Strong consistency of the parameter estimates is proved, and the asymptotic covariance matrix of the estimation error is derived. Unlike the previously studied large sample case, the present analysis shows that the accuracy is the same for the two ML methods. Furthermore, the asymptotic covariance matrix of the estimation error coincides with the deterministic Cramer-Rao bound. Under a certain assumption, the ML methods can be implemented by means of conventional beamforming for a large enough number of sensors. We also include a simple simulation study, which indicates that both ML methods provide efficient estimates for very moderate array sizes, whereas the beamforming method requires a somewhat larger array aperture to overcome the inherent bias and resolution problem