Factor graphs for mobile position location

Jung Chieh Chen; Ching Shyang Maa; Jiunn Tsair Chen

Factor graphs for mobile position location

Jung Chieh Chen
, Ching Shyang Maa
, Jiunn Tsair Chen

Department of Electrical Engineering

Research output: Contribution to journal › Conference article › peer-review

13 Citations (Scopus)

Abstract

Making use of the network side time-of-arrival (TOA) measurements, we propose a low-complexity high-accuracy algorithm to estimate the location of a target mobile station (MS). Under a factor graph framework, the proposed algorithm efficiently exchange soft information among local processing units in the mobile switching center (MSC) to iteratively purify the estimate of the MS location. Numerical results show that the proposed algorithm not only enjoys advantages of low complexity, suitable for integrated-circuit implementation, but it is also able to achieve performance very close to the optimum achievable bound, the maximum likelihood (ML) bound.

Original language	English
Pages (from-to)	393-396
Number of pages	4
Journal	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume	2
Publication status	Published - 2003
Event	2003 IEEE International Conference on Accoustics, Speech, and Signal Processing - Hong Kong, Hong Kong Duration: 2003 Apr 6 → 2003 Apr 10

All Science Journal Classification (ASJC) codes

Software
Signal Processing
Electrical and Electronic Engineering

Cite this

@article{d961dd21f523425ab9ac6d82cf3186d4,

title = "Factor graphs for mobile position location",

abstract = "Making use of the network side time-of-arrival (TOA) measurements, we propose a low-complexity high-accuracy algorithm to estimate the location of a target mobile station (MS). Under a factor graph framework, the proposed algorithm efficiently exchange soft information among local processing units in the mobile switching center (MSC) to iteratively purify the estimate of the MS location. Numerical results show that the proposed algorithm not only enjoys advantages of low complexity, suitable for integrated-circuit implementation, but it is also able to achieve performance very close to the optimum achievable bound, the maximum likelihood (ML) bound.",

author = "Chen, \{Jung Chieh\} and Maa, \{Ching Shyang\} and Chen, \{Jiunn Tsair\}",

year = "2003",

language = "English",

volume = "2",

pages = "393--396",

journal = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

issn = "1520-6149",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2003 IEEE International Conference on Accoustics, Speech, and Signal Processing ; Conference date: 06-04-2003 Through 10-04-2003",

}

TY - JOUR

T1 - Factor graphs for mobile position location

AU - Chen, Jung Chieh

AU - Maa, Ching Shyang

AU - Chen, Jiunn Tsair

PY - 2003

Y1 - 2003

N2 - Making use of the network side time-of-arrival (TOA) measurements, we propose a low-complexity high-accuracy algorithm to estimate the location of a target mobile station (MS). Under a factor graph framework, the proposed algorithm efficiently exchange soft information among local processing units in the mobile switching center (MSC) to iteratively purify the estimate of the MS location. Numerical results show that the proposed algorithm not only enjoys advantages of low complexity, suitable for integrated-circuit implementation, but it is also able to achieve performance very close to the optimum achievable bound, the maximum likelihood (ML) bound.

AB - Making use of the network side time-of-arrival (TOA) measurements, we propose a low-complexity high-accuracy algorithm to estimate the location of a target mobile station (MS). Under a factor graph framework, the proposed algorithm efficiently exchange soft information among local processing units in the mobile switching center (MSC) to iteratively purify the estimate of the MS location. Numerical results show that the proposed algorithm not only enjoys advantages of low complexity, suitable for integrated-circuit implementation, but it is also able to achieve performance very close to the optimum achievable bound, the maximum likelihood (ML) bound.

UR - https://www.scopus.com/pages/publications/0141813346

UR - https://www.scopus.com/pages/publications/0141813346#tab=citedBy

M3 - Conference article

AN - SCOPUS:0141813346

SN - 1520-6149

VL - 2

SP - 393

EP - 396

JO - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

JF - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

T2 - 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing

Y2 - 6 April 2003 through 10 April 2003

ER -

Factor graphs for mobile position location

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this