Identifying sequentially untestable faults using illegal states
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper, we first present an algorithm (FILL) which efficiently identifies a large subset of the illegal states in a synchronous sequential circuit, without assuming a global reset mechanism. A second algorithm, FUNI, finds sequentially untestable faults whose detection requires some of the illegal states computed by FlLL. Although based on binary decision diagrams (BDDs), FILL is able to process large circuits by using a new functional partitioning procedure. The incremental building of the set of illegal states guarantees that FILL mill always obtain at least a partial solution. FUNI is a direct method that identifies untestable faults without using the exhaustive search involved in automatic test generation (ATG). Experimental results show that FUNI finds a large number of untestable faults up to several orders of magnitude faster than an ATG algorithm that targeted the faults identified by FUNI, Also, many untestable faults identified by FUNI were aborted by the test generator.Keywords
This publication has 14 references indexed in Scilit:
- The Best Flip-Flops to ScanPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Combinational ATPG theorems for identifying untestable faults in sequential circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Low-cost redundancy identification for combinational circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sequentially untestable faults identified without search ("simple implications beat exhaustive search!")Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Don't care minimization of multi-level sequential logic networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Digital Systems Testing and Testable DesignPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- A transitive closure algorithm for test generationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Algorithms for approximate FSM traversalPublished by Association for Computing Machinery (ACM) ,1993
- The multiple observation time test strategyIEEE Transactions on Computers, 1992
- One-pass redundancy identification and removalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992