An on-line reconfigurable four-ary tree-based network on chip for distributed particle filters

This paper presents an on-line reconfigurable four-ary tree-based network on chip for distributed particle filters. The proposed architecture model provides the capability of fast prototyping a large scale of particle filters system basing on the idea of reusability. Furthermore, it supports dynamic...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 2nd International Conference on Computer Science and Network Technology s. 2102 - 2106
Hlavní autoři: Wang, Yimu, Pan, Yun, Long, Yanchen, Yan, Xiaolang, Huan, Ruohong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2012
Témata:
Approximation algorithms
Clustering algorithms
Complexity theory
Computer architecture
Distributed Particle Filter
Heuristic algorithms
Network on Chip
Number Partitioning
on-line Reconfiguration
Particle filters
Partitioning algorithms
Switches
System-on-chip
Telecommunication traffic
ISBN:1467329630, 9781467329637
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents an on-line reconfigurable four-ary tree-based network on chip for distributed particle filters. The proposed architecture model provides the capability of fast prototyping a large scale of particle filters system basing on the idea of reusability. Furthermore, it supports dynamic reconfiguration by regrouping PEs so as to reduce the overall traffic loads on communication infrastructure. After formulating the regrouping into number partitioning problem, we apply two heuristic algorithms which are Balanced Largest Differencing Method (BLDM) and Balanced Farthest Binding Method (BFBM) as reconfigure strategies. Finally, system level evaluation indicates that a huge decrease of traffic loads can be achieved with help of reconfigure feature.
ISBN:1467329630
9781467329637
DOI:10.1109/ICCSNT.2012.6526333