Network-side mobile position location using factor graphs

Jung-Chieh Chen

doi:10.1109/TWC.2006.03401

Return

Network-side mobile position location using factor graphs

2006-10-01

PRE

Jung-Chieh Chen *

Yeong-Cheng Wang

DOI：10.1109/TWC.2006.03401

Original

Original request for help

Save

Abstract

En 中文

A low-complexity high-accuracy algorithm is proposed to estimate the location of a target MS based on network-side time-of-arrival (TOA) measurements. Under a factor graph framework, the proposed algorithm first constructs a graphical model for the mobile position location problem by dividing the problem into many mutually-interactive local constraints. Each local constraint is enforced by a separate local processing unit. Efficient exchange of soft-information among local processing units in the mobile switching center (MSC) then iteratively purifies the estimate of the MS location. Numerical results show that the proposed algorithm not only enjoys low complexity, suitable for integrated-circuit implementation, but it is also able to achieve performance very close to the optimum achievable solution accuracy, the maximum likelihood (ML) solution accuracy.

Keywords:

TOA

position location

factor graph

soft-information

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.