Performance analysis of higher order ESPRIT for localization of near-field sources

Most existing array processing techniques for estimating the directions of arrival (DOAs) or signal copy rely heavily on the plane-wave assumption of far-field sources. When the sources are located relatively close to the array, these techniques may no longer perform satisfactorily. In this paper we...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 1998-03, Vol.46 (3), p.709-719
Main Authors: Yuen, N., Friedlander, B.
Format: Article
Language:English
Subjects:
Applied sciences
Array signal processing
Azimuth
Detection, estimation, filtering, equalization, prediction
Direction of arrival estimation
Exact sciences and technology
Higher order statistics
Information, signal and communications theory
Least squares methods
Parameter estimation
Performance analysis
Sensor arrays
Signal and communications theory
Signal processing
Signal processing algorithms
Signal, noise
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Most existing array processing techniques for estimating the directions of arrival (DOAs) or signal copy rely heavily on the plane-wave assumption of far-field sources. When the sources are located relatively close to the array, these techniques may no longer perform satisfactorily. In this paper we present an asymptotic performance analysis of an ESPRIT-like method for passive localization of nearfield sources. The algorithm, which is based on fourth-order cumulants, is formulated for observations collected from a single uniformly spaced linear array. We examine the least-squares version of the algorithm and derive the expressions for the asymptotic variance of the estimated DOAs (relative to a reference sensor) and estimated ranges of the sources. We also derive an algorithm independent bound on the asymptotic variance of the estimated parameters. This bound can be used as a measure against the theoretically predicted algorithmic performance. Some insight into the achievable performance of this algorithm is obtained by numerical evaluation of the bound for several test cases of interest, and the results are compared with those obtained by numerical evaluation of the theoretically predicted performance. Monte Carlo simulations are used to verify the theoretical analysis.
ISSN:1053-587X
1941-0476
DOI:10.1109/78.661337