Distance-Ranked Fault Identification of Reconfigurable Hardware Bitstreams via Functional Input

Algorithm 1

Exhaustive evaluation of configurations for fault diagnosis.

Require: 𝑁

Ensure: Φ

(1) Starting from the first configuration

  Initialize CUT = 1

(2) while CUT < 𝑁  do

(3)  Choose the next configuration from the configurations pool as slack

   Designate the CUT as active configuration, and RS = CUT + 1 as slack.

   Then, the pair under test is given by: 𝑉_CED = {CUT, RS}

(4)  Exhaustive evaluation method involves applying all the points in the input space of circuit

   Perform concurrent comparison to the same inputs for various edges of the graph represented by connectivity matrix 𝐂

(5)  Evaluate all the possible configurations pair to complete the syndrome matrix

   Update the Syndrome Matrix Ψ based upon comparisons outcome of all possible inputs

(6)  CUT = CUT + 1

(7) end while

(8) This method involves exploration of the entire input-space and thus exposes all the operationally manifested faults

  Given Ψ, isolate the faulty nodes:

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

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