Complexity Analysis of the Marginalized Particle Filter
2005 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 53, no 11, 4408-4411 p.Article in journal (Refereed) Published
In this paper, the computational complexity of the marginalized particle filter is analyzed and a general method to perform this analysis is given. The key is the introduction of the equivalent flop measure. In an extensive Monte Carlo simulation, different computational aspects are studied and compared with the derived theoretical results.
Place, publisher, year, edition, pages
IEEE Signal Processing Society, 2005. Vol. 53, no 11, 4408-4411 p.
Complexity analysis, Kalman filter, Equivalent flop, Marginalized particle filter, Nonlinear estimation
IdentifiersURN: urn:nbn:se:liu:diva-11751DOI: 10.1109/TSP.2005.857061OAI: oai:DiVA.org:liu-11751DiVA: diva2:18185