Calculation of unate cube set algebra using zero-suppressed BDDs

Abstract.The multiple transition fault model has been used to represent alternative defective gate combinations in the circuit. However, the number of faults is very large even of modest size circuits and therefore the defective configuration may not be considered. It is shown that multiple transition faults can be stored compactly in Binary Decision Diagrams. Furthermore, important operations for identifying the location of failures are implemented without fault enumeration. Experimental results on some of the largest ISCAS'85, ISCAS'89. and ITC'99 benchmarks demonstrate the scalability of the proposed method.

show abstract

“…Let a test vector be T = {01, 11}. At each gate, all possible MTF that may occur until that gate are stored in ZBDD data structure [12]- [14].…”

Section: Generation Storage and Manipulation Of Faults Without Enumementioning

confidence: 99%

Operations on Multiple Transition Faults without Enumeration

Toulas

Tragoudas

2016

MATEC Web Conf.

View full text Add to dashboard Cite

show abstract

“…In this section, we discuss unate cube set algebra [17] based on ZBDD manipulation. A cube set consists of a number of cubes, each of which is a combination of literals.…”

Section: Unate Cube Set Algebra Based On Zbddsmentioning

confidence: 99%

“…Such a procedure is impractical when we deal with very large numbers of cubes. Minato [17] presented the fast algorithms for computing them.…”

Section: Algorithmsmentioning

confidence: 99%

Zero-suppressed BDDs and their applications

Minato

2001

STTT

Self Cite

View full text Add to dashboard Cite

In many real-life problems, we are often faced with manipulating sets of combinations. I n t h i s a r t icle, we study a special type of OBDDs, called Zerosuppressed BDD (ZBDD). This data structure represents sets of combinations more eciently than using original OBDDs. We discuss the basic data structures and algorithms for manipulating ZBDDs in contrast with the original OBDDs. We also present some practical applications of ZBDDs, such as solving combinatorial problems with unate cube set algebra, logic synthesis method, Petri net processing, etc. We show that ZBDD is a useful option in the OBDD techniques, suitable for a part of practical applications.

show abstract

“…The basic ZBDD operations used in the proposed method are listed in Table 1. More details about the operations can be found in [6] [7]. The pseudo-code of the basic algorithm is given in Table 2.…”

Section: Count(ë)mentioning

confidence: 99%

Exact grading of multiple path delay faults

Padmanaban¹,

Tragoudas²

Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition

View full text Add to dashboard Cite

The problem of fault grading for multiple path delay faults is studied and a method of obtaining the exact coverage is presented. The faults covered are represented and manipulated as sets by zero-suppressed binary decision diagrams (ZBDD), which are shown to be able to store a very large number of path delay faults. For the extreme case of memory problem, a method to estimate the coverage of the test set is also presented. The problem of fault grading is solved with a polynomial number of BDD operations. Experimental results on the ISCAS'85 benchmark include test sets from ATPG tools and specifically designed tests in order to investigate the limitations and properties of the proposed method.

show abstract

Calculation of unate cube set algebra using zero-suppressed BDDs

Cited by 21 publications

References 9 publications

Operations on Multiple Transition Faults without Enumeration

Operations on Multiple Transition Faults without Enumeration

Zero-suppressed BDDs and their applications

Exact grading of multiple path delay faults

Contact Info

Product

Resources

About