.png){kind=icon}
.png){kind=icon}
Return
A Message Passing Based Iterative Algorithm for Robust TOA Positioning in Impulsive Noise
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2022.3203487.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this contribution, we explore further possibilities for statistical robustification of the traditional l(2)-space based time-of-arrival location estimator under impulsive noise conditions. We replace the non-robust l(2) loss by the l(p) counterpart with 1 <= p < 2, and devise an iteratively reweighted least squares (IRLS) type approach to tackle the l(p)-minimization formulation in O(NIRLSL) time. Here, the iteration number N-IRLS is a constant typically of several tens and L represents the number of sensors. The key enabler for the rapid but reliable update of location estimate at each iteration, is the sum-product message passing implemented in an acyclic factor graph derived from the corresponding subproblem. Numerical results demonstrate the superiority of our algorithm over several existing statistical robustification methods in terms of computational simplicity and positioning accuracy in the presence of impulsive noise.
Keywords:
Impulsive noise
iteratively reweighted least squares
l(p)-norm
message passing
positioning
time-of-arrival.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W