Research Article
Distance-Ranked Fault Identification of Reconfigurable Hardware Bitstreams via Functional Input
Algorithm 2
SFH state transition algorithm for functional diagnosis of configurations.
Require: | Ensure: | (1) Initialize CUT = 1 | (2) while () and (CUT < ) do | (3) The configurations under test in SFH method are selected in a round-robin manner | Designate the CUT as active configuration, and RS as slack. Then, the pair under test is given by: = {CUT, RS} | (4) Perform concurrent comparison to the same inputs for various edges of the graph represented by connectivity | matrix | (5) The comparison outcome in SFH method is binary. A 1 corresponds to discrepant behavior while a 0 corresponds | to healthy configurations | Update the Syndrome Matrix based upon comparisons outcome during an evaluation interval | (6) Increment the reload number | (7) Given , isolate the faulty nodes: | and , if , and | if , , and | (8) end while | (9) A healthy configuration can check the health of other configuration when instantiated concurrently for discrepancy check. | Use a healthy identified configuration to test all other configurations |
|