ePrints

A simple approach of range-based positioning with low computational complexity

Lookup NU author(s): Dr Shouhong Zhu, Dr Zhiguo Ding

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

For range based positioning the least square (LS) criterion and its produced solution exhibit superb estimation performance, but generally at a very high computational complexity. In this letter we consider the issue how to approach such LS solution in estimation performance at low computational complexity. We propose a novel algorithm that is based on the equations linearized from range measurement equations and implements a weighted least square criterion in a computationally efficient way. The proposed algorithm involves a quadratic equation linking the linearization-caused extra variable and the position to be estimated, thus results in a closed form solution.We analyze and simulate its estimation performance, and evidently show that the proposed algorithm can very closely approach the LS solution in estimation performance at a significantly low computational complexity.

Publication metadata

Author(s): Ding Z; Zhu S

Publication type: Article

Publication status: Published

Journal: IEEE Transactions on Wireless Communications

Year: 2009

Volume: 8

Issue: 12

Pages: 5832-5836

ISSN (print): 1536-1276

ISSN (electronic): 1558-2248

Publisher: IEEE

URL: http://dx.doi.org/10.1109/TWC.2009.12.090905

DOI: 10.1109/TWC.2009.12.090905

Altmetrics

Share