Abstract
Particle filtering is a reliable Monte Carlo algorithm for estimating the state of a system in modeling nonlinear, non-gaussian elements for estimation and tracking applications in various fields, including robotics, navigation, and computer vision. However, particle filtering can be computationally expensive, particularly in high-dimensional state spaces, and can be a bottleneck for real-time applications due to high memory consumption. This paper proposes a particle filter accelerator that employs a cellular automata-based pseudo-random number generator and an improved systematic resampler based on the Vose Alias method. The particles are distributed across several sub-filters, performing concurrent resampling and importance weights computations. The proposed accelerator employed the inherent parallelism and pipelining stages of FPGAs to compute the resampling stage in a parallel fashion and significantly enhance particle convergence time. The proposed accelerator deployed on the zedboard (ZC7020) system-on-chip achieves a low execution time of approximately 4.63μs, 21.3%speedup, and 3.1%area reduction compared to the recent particle filter accelerator. The proposed design also demonstrates modularity, achieved through multiple parallel hardware subfilters that provide high throughput for real-time sensor data processing. Furthermore, the proposed accelerator performs a high sampling frequency of 216kHz, making it suitable for high throughput and real-time applications.
Funding Information
  • Challengeable Future Defense Technology Research and Development Program through the Agency for Defense Development (ADD) funded by the Defense Acquisition Program Administration (DAPA) in 2023 (912906601)

This publication has 21 references indexed in Scilit: