Least Squares Algorithms for Time-of-Arrival-Based Mobile Location

Localization of mobile phones is of considerable interest in wireless communications. In this correspondence,tw o 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 Cramér–Rao lower bound and the optimal circular error probability at sufficiently high signal-to-noise ratio conditions.