2015
DOI: 10.1016/j.microrel.2015.03.010
|View full text |Cite
|
Sign up to set email alerts
|

Swarm intelligence driven design space exploration of optimal k-cycle transient fault secured datapath during high level synthesis based on user power–delay budget

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 14 publications
(13 citation statements)
references
References 40 publications
0
13
0
Order By: Relevance
“…Multi‐cycle transient fault security at behavioral level was handled in [6, 27, 28] through concurrent error detection scheme where replication of control data flow graph (CDFG) operations were performed. Once the scheduling of the dual modular redundant CDFG was generated, then specific hardware allocation rules were imposed to ensure detectability.…”
Section: Related Prior Workmentioning
confidence: 99%
See 3 more Smart Citations
“…Multi‐cycle transient fault security at behavioral level was handled in [6, 27, 28] through concurrent error detection scheme where replication of control data flow graph (CDFG) operations were performed. Once the scheduling of the dual modular redundant CDFG was generated, then specific hardware allocation rules were imposed to ensure detectability.…”
Section: Related Prior Workmentioning
confidence: 99%
“…Once the scheduling of the dual modular redundant CDFG was generated, then specific hardware allocation rules were imposed to ensure detectability. Sengupta and Sedaghat's approach [6] presents more comprehensive hardware allocation rules, as it encompasses the condition of minimal hardware availability as well. In other words, Sengupta and Sedaghat's approach [6] can provide multi‐cycle fault security even with the availability of single hardware type which is not possible in [28].…”
Section: Related Prior Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In PSO-DSE, each dimension (d) of a particle position X i (except the last dimension) is updated using the following function [33], [36]:…”
Section: ) Particle Movement Using Velocitymentioning
confidence: 99%