By Topic

Least squares algorithms for time-of-arrival-based mobile location

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
K. W. Cheung ; Dept. of Comput. Eng. & Inf. Technol., City Univ. of Hong Kong, China ; H. C. So ; W. -K. Ma ; Y. T. Chan

Localization of mobile phones is of considerable interest in wireless communications. In this correspondence, two algorithms are developed for accurate mobile location using the time-of-arrival measurements of the signal from the mobile station received at three or more base stations. The first algorithm is an unconstrained least squares (LS) estimator that has implementation simplicity. The second algorithm solves a nonconvex constrained weighted least squares (CWLS) problem for improving estimation accuracy. It is shown that the CWLS estimator yields better performance than the LS method and achieves both the Crame´r-Rao lower bound and the optimal circular error probability at sufficiently high signal-to-noise ratio conditions.

Published in:

IEEE Transactions on Signal Processing  (Volume:52 ,  Issue: 4 )