Accuracy comparison of LS and squared-range LS for source localization

Authors:
Erik G. Larsson;Danyo Danev
Affiliations:
Department of Electrical Engineering, ISY, Linköping University, Linköping, Sweden;Department of Electrical Engineering, ISY, Linköping University, Linköping, Sweden
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 5
Cited 0

System identification: theory for the user

System identification: theory for the user
System identification

System identification
Fundamentals of statistical signal processing: estimation theory

Fundamentals of statistical signal processing: estimation theory
Least squares algorithms for time-of-arrival-based mobile location

IEEE Transactions on Signal Processing
Exact and Approximate Solutions of Source Localization Problems

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

In this correspondence, we compute a closed-form expression for the asymptotic (large-sample) accuracy of the recently proposed squared-range least-squares (SR-LS) method for source localization [A. Beck, P. Stoica, and J. Li, "Exact and approximate solutions of source localization problems," IEEE Trans. Signal Process., vol. 56, no. 5, pp. 1770-1778, May 2008]. We compare its accuracy to that of the classical least-squares (LS) method and show that LS and SR-LS perform differently in general. We identify geometries where the performances of the methods are identical but also geometries when the difference in performance is unbounded.