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

by: KW Cheung, HC So, WK Ma, YT Chan

Signal Processing, IEEE Transactions on [see also Acoustics, Speech, and Signal Processing, IEEE Transactions on], Vol. 52, No. 4. (2004), pp. 1121-1130.

View FullText article

IEEE Explore

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

zhensong

Find related articles with these CiteULike tags

localization

Abstract

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/spl acute/r-Rao lower bound and the optimal circular error probability at sufficiently high signal-to-noise ratio conditions.

@article{citeulike:1049054, abstract = {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/spl acute/r-Rao lower bound and the optimal circular error probability at sufficiently high signal-to-noise ratio conditions.}, author = {Cheung, K. W. and So, H. C. and Ma, W. K. and Chan, Y. T. }, citeulike-article-id = {1049054}, journal = {Signal Processing, IEEE Transactions on [see also Acoustics, Speech, and Signal Processing, IEEE Transactions on]}, keywords = {localization}, number = {4}, pages = {1121--1130}, posted-at = {2007-01-18 17:13:29}, priority = {2}, title = {Least squares algorithms for time-of-arrival-based mobile location}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1275684}, volume = {52}, year = {2004} }

RIS record

TY - JOUR ID - citeulike:1049054 L3 - citeulike-article-id:1049054 TI - Least squares algorithms for time-of-arrival-based mobile location JF - Signal Processing, IEEE Transactions on [see also Acoustics, Speech, and Signal Processing, IEEE Transactions on] VL - 52 IS - 4 SP - 1121 EP - 1130 N2 - 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/spl acute/r-Rao lower bound and the optimal circular error probability at sufficiently high signal-to-noise ratio conditions. KW - localization AU - Cheung, KW AU - So, HC AU - Ma, WK AU - Chan, YT PY - 2004/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1275684 ER -

RIS BibTeX