Analysis of a Fixed Point Iteration Algorithm for TOA Localization

A recent work on a fixed point iteration (FPI) al-gorithm for time-of-arrival localization has shown great promise for lower implementation complexity than existing algorithms without compromising on performance. However, this work did not provide a theoretical analysis. In the current paper, we pro-vide a comprehensive theoretical analysis of the convergence and performance of the FPI algorithm. These analyses reveal several useful conclusions about the characteristics of the estimator.