Results

**1 - 2**of**2**### unknown title

"... Abstract—Exact Path Delay Fault (PDF) coverage calculation of large circuits with an exponential number of detectable PDFs requires exponential memory space. This often yields memory ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—Exact Path Delay Fault (PDF) coverage calculation of large circuits with an exponential number of detectable PDFs requires exponential memory space. This often yields memory

### ZBDD-Based Exact Path Delay Fault Coverage Calculation of Partitioned Circuits

"... Abstract — Exact Path Delay Fault (PDF) coverage calculation of large circuits with an exponential number of detectable PDFs requires exponential memory space. This often yields memory overflow in computations. One common approach to avoid memory overflow is to partition or virtually cut the circuit ..."

Abstract
- Add to MetaCart

Abstract — Exact Path Delay Fault (PDF) coverage calculation of large circuits with an exponential number of detectable PDFs requires exponential memory space. This often yields memory overflow in computations. One common approach to avoid memory overflow is to partition or virtually cut the circuits into several subcircuits, and to perform coverage calculation at the partition-level of the circuit. Partitioning reduces the number of PDFs to be stored in memory exponentially at the expense of losing some coverage. This paper describes a method based on ZBDDs to improve the reported coverage value by recovering the lost PDFs up to a user controlled degree (), which is a function of the number of partitions. The reported coverage monotonically increases as increases: the exact coverage value is guaranteed for a certain value of. Experimental results are provided for the ISCAS85 circuits that illustrate the trade off between the computation time, the number of partitions, the values of and the reported coverage. I.