Abstract
Making use of the time-of-arrival measurements and their stochastic properties, we propose a low-complexity high-accuracy algorithm to estimate the location of a target mobile station (MS). Under a factor graph framework, in the proposed algorithm, soft-information is efficiently exchanged among local processing units 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 bound.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
