{"title":"单指令多数据粒子滤波器","authors":"S. Maskell, Ben Alun-Jones, M. Macleod","doi":"10.1109/NSSPW.2006.4378818","DOIUrl":null,"url":null,"abstract":"Particle filters are often claimed to be readily parallelisable. However, the resampling step is non-trivial to implement in a fine-grained parallel architecture. While approaches have been proposed that modify the particle filter to be amenable to such implementation, this paper's novelty lies in its description of a Single Instruction Multiple Data (SIMD) implementation of a particle filter that uses N processors to process N particles. The resulting algorithm has a time complexity of O((log N)2) when performing resampling using N processors. The algorithm has been implemented using C for Graphics (CG), a language that enables the heavily pipelined architecture of modern graphics cards to be used to imitate a SIMD processor. Initial results are presented.","PeriodicalId":388611,"journal":{"name":"2006 IEEE Nonlinear Statistical Signal Processing Workshop","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"A Single Instruction Multiple Data Particle Filter\",\"authors\":\"S. Maskell, Ben Alun-Jones, M. Macleod\",\"doi\":\"10.1109/NSSPW.2006.4378818\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Particle filters are often claimed to be readily parallelisable. However, the resampling step is non-trivial to implement in a fine-grained parallel architecture. While approaches have been proposed that modify the particle filter to be amenable to such implementation, this paper's novelty lies in its description of a Single Instruction Multiple Data (SIMD) implementation of a particle filter that uses N processors to process N particles. The resulting algorithm has a time complexity of O((log N)2) when performing resampling using N processors. The algorithm has been implemented using C for Graphics (CG), a language that enables the heavily pipelined architecture of modern graphics cards to be used to imitate a SIMD processor. Initial results are presented.\",\"PeriodicalId\":388611,\"journal\":{\"name\":\"2006 IEEE Nonlinear Statistical Signal Processing Workshop\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Nonlinear Statistical Signal Processing Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NSSPW.2006.4378818\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Nonlinear Statistical Signal Processing Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSSPW.2006.4378818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31
摘要
粒子滤波通常被认为是易于并行的。但是,在细粒度并行体系结构中实现重新采样步骤是非常重要的。虽然已经提出了修改粒子滤波器以适应这种实现的方法,但本文的新颖之处在于它描述了使用N个处理器处理N个粒子的粒子滤波器的单指令多数据(SIMD)实现。当使用N个处理器进行重采样时,所得算法的时间复杂度为O((log N)2)。该算法是使用C for Graphics (CG)实现的,这种语言使现代显卡的大量流水线架构能够用来模拟SIMD处理器。提出了初步结果。
A Single Instruction Multiple Data Particle Filter
Particle filters are often claimed to be readily parallelisable. However, the resampling step is non-trivial to implement in a fine-grained parallel architecture. While approaches have been proposed that modify the particle filter to be amenable to such implementation, this paper's novelty lies in its description of a Single Instruction Multiple Data (SIMD) implementation of a particle filter that uses N processors to process N particles. The resulting algorithm has a time complexity of O((log N)2) when performing resampling using N processors. The algorithm has been implemented using C for Graphics (CG), a language that enables the heavily pipelined architecture of modern graphics cards to be used to imitate a SIMD processor. Initial results are presented.