Skip to main content

Resampling Algorithms for Particle Filters: A Computational Complexity Perspective

Abstract

Newly developed resampling algorithms for particle filters suitable for real-time implementation are described and their analysis is presented. The new algorithms reduce the complexity of both hardware and DSP realization through addressing common issues such as decreasing the number of operations and memory access. Moreover, the algorithms allow for use of higher sampling frequencies by overlapping in time the resampling step with the other particle filtering steps. Since resampling is not dependent on any particular application, the analysis is appropriate for all types of particle filters that use resampling. The performance of the algorithms is evaluated on particle filters applied to bearings-only tracking and joint detection and estimation in wireless communications. We have demonstrated that the proposed algorithms reduce the complexity without performance degradation.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Miodrag Bolić.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bolić, M., Djurić, P.M. & Hong, S. Resampling Algorithms for Particle Filters: A Computational Complexity Perspective. EURASIP J. Adv. Signal Process. 2004, 403686 (2004). https://doi.org/10.1155/S1110865704405149

Download citation

Keywords and phrases

  • particle filters
  • resampling
  • computational complexity
  • sequential implementation