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: 𝑉_CED = {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 𝑛_𝑟=𝑛_𝑟+1

(7)  Given Ψ, isolate the faulty nodes:

   𝜙_𝑖←0 and 𝜙_𝑗←0, if 𝑐_𝑖𝑗=1, and 𝜓_𝑖𝑗=0

   𝜙_𝑖←1 if 𝜙_𝑗=0, 𝑐_𝑖𝑗=1, and 𝜓_𝑖𝑗=1

(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