This paper proposes an algorithm for designing efficient space response compactors for built-in self-testing of VLSI circuits. This algorithm can be applied independently from the structure of circuits under test.
In conventional space response compa...
This paper proposes an algorithm for designing efficient space response compactors for built-in self-testing of VLSI circuits. This algorithm can be applied independently from the structure of circuits under test.
In conventional space response compactors, high hardware overhead is required and fault coverage is reduced by aliasing which maps faulty circuit's response to fault-free one. However, the proposed algorithm of designing space response compactors reduces hardware overheads without reducing the fault coverage. Also, the algorithm can be applied even to general N-input logic gate, and the most efficient space response compactor can be designed considering the characteristics of output sequence from the circuit under test.
The proposed algorithm is implemented in C on a SUN SPARC 20 workstation and the experimental results on ISCAS'85 benchmark circuits with pseudorandom patterns generated by LFSR are obtained. The results show the efficiency and validity of the algorithm.