Table - PMC

Skip to main content

View full-text article in PMC

. 2019 Dec 9;19(24):5416. doi: 10.3390/s19245416

Algorithm 1 Fault injection campaign.

1:
set $E n d T i m e$ = 100 $μ$ s
2:
set $T o t a l R u n s$ = 1000
3:
functionGoldenRun( $a r c h$ )
4:
simulate( $a r c h$ ) until $E n d T i m e$
5:
return $a r c h . o u t p u t s$
6:
end function
7:
functionFaultInjection( $a r c h$ , $r u n$ )
8:
for i = 0 to $T o t a l R u n s$ - 1 do
9:
$f l i p f l o p \leftarrow r a n d o m (a r c h . f l i p f l o p)$
10:
simulate( $a r c h$ ) until random( $E n d T i m e$ )
11:
$f l i p f l o p \leftarrow! f l i p f l o p$
12:
simulate( $a r c h$ ) until $E n d T i m e$
13:
$r u n (i) \leftarrow a r c h . o u t p u t s$
14:
end for
15:
end function
16:
functionErrorPropagation( $r u n$ )
17:
for i = 0 to $T o t a l R u n s$ - 1 do
18:
if $r u n (i)! = G o l d e n R u n (a r c h)$ then
19:
$e r r o r \leftarrow e r r o r + 1$
20:
end if
21:
end for
22:
return $e r r o r$
23:
end function