Reducing fault dictionary size for million-gate large circuits

In general, fault dictionary is prevented from practical applications in fault diagnosis due to its extremely large size. Several previous works are proposed for the fault dictionary size reduction. However, some of them fail to bring down the size to an acceptable level, and others might not be able to handle today's million-gate circuits due to their high time and space complexity. In this article, an algorithm is presented to reduce the size of pass-fail dictionary while still preserving high diagnostic resolution. The proposed algorithm possesses low time and space complexity by avoiding constructing the huge distinguishability table, which inevitably boosts up the required computation complexity. Experimental results demonstrate that the proposed algorithm is capable of handling industrial million-gate large circuits in a reasonable amount of runtime and memory.

[1]  Irith Pomeranz,et al.  On the generation of small dictionaries for fault location , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[2]  Irith Pomeranz,et al.  Fault dictionary compression and equivalence class computation for sequential circuits , 1993, ICCAD.

[3]  Dong Sam Ha,et al.  HOPE: an efficient parallel fault simulator for synchronous sequential circuits , 1992, DAC '92.

[4]  Alex Orailoglu,et al.  Fault dictionary size reduction through test response superposition , 2002, Proceedings. IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[5]  Irith Pomeranz,et al.  Fault dictionary compression and equivalence class computation for sequential circuits , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[6]  Sreejit Chakravarty,et al.  Simulation and generation of I/sub DDQ/ tests for bridging faults in combinational circuits , 1993, Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium.

[7]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[8]  Sreejit Chakravarty,et al.  Algorithms for IDDQ measurement based diagnosis of bridging faults , 1992, J. Electron. Test..

[9]  Hai Zhou,et al.  Parallel CAD: Algorithm Design and Programming Special Section Call for Papers TODAES: ACM Transactions on Design Automation of Electronic Systems , 2010 .

[10]  Sreejit Chakravarty,et al.  Simulation and generation of IDDQ tests for bridging faults in combinational circuits , 1993, VTS.

[11]  Sarita Thakar,et al.  On the generation of test patterns for combinational circuits , 1993 .

[12]  R. Li,et al.  Dynamic fault detection and diagnosis using neural networks , 1990, Proceedings. 5th IEEE International Symposium on Intelligent Control 1990.

[13]  Irith Pomeranz,et al.  On the generation of small dictionaries for fault location , 1992, ICCAD.

[14]  Janak H. Patel,et al.  Algorithms to compute bridging fault coverage of IDDQ test sets , 1997, TODE.

[15]  Ellis Horowitz,et al.  Fundamentals of Data Structures , 1984 .

[16]  Daniel G. Saab,et al.  Dynamic fault diagnosis on reconfigurable hardware , 1999, DAC '99.

[17]  H. K. Lee,et al.  HOPE: an efficient parallel fault simulator , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[18]  Vamsi Boppana,et al.  Fault dictionary compaction by output sequence removal , 1994, ICCAD.

[19]  Ellis Horowitz,et al.  Fundamentals of data structures in C , 1976 .

[20]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[21]  W. Kent Fuchs,et al.  Dynamic diagnosis of sequential circuits based on stuck-at faults , 1996, Proceedings of 14th VLSI Test Symposium.

[22]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .