Fast multidimensional scaling analysis for mobile positioning

The problem of locating and tracking a mobile station (MS) in which real-time computation is needed has received considerable attentions. In this letter, a fast and computationally simple subspace-based algorithm for mobile positioning with the use of time-of-arrival (TOA) measurements of three base stations (BSs) is derived and analysed. Since the Lagrange multiplier is introduced to avoid eigendecomposition of multidimensional similarity matrix, the proposed algorithm offers very competitive performance at low computational complexity.