Particle filtering: the need for speed

DOI10.1155/2010/181403zbMATH Open1204.68263OpenAlexW2007118171WikidataQ59253799 ScholiaQ59253799MaRDI QIDQ623980FDOQ623980

Gustaf Hendeby, Fredrik Gustafsson, Rickard Karlsson

Publication date: 8 February 2011

Published in: EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2010/181403

Recommendations

• Parallel particle filtering
• scientific article
• Design and implementation of flexible resampling mechanism for high-speed parallel particle filters
• Analysis of parallelizable resampling algorithms for particle filtering
• Generic hardware architectures for sampling and resampling in particle filters

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Marginalized particle filters for mixed linear/nonlinear state-space models
• Resampling algorithms and architectures for distributed particle filters
• Parallelization of random number generators and long-range correlations

Cited In (7)

• Sequential Monte Carlo methods for filtering of unobservable components of multidimensional diffusion Markov processes
• Fast and effective generation of the proposal distribution for particle filters
• Parallel particle filtering
• Efficient Delay-Tolerant Particle Filtering
• Numerical fitting‐based likelihood calculation to speed up the particle filter
• Particle MCMC algorithms and architectures for accelerating inference in state-space models
• Title not available (Why is that?)

Uses Software

• CUDA
• OpenGL
• MAGMA

This page was built for publication: Particle filtering: the need for speed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623980)