Exact Path Delay Fault Coverage Calculation of Partitioned Circuits
Yazarlar (3)
Doç. Dr. Fatih KOÇAN Bobby B. Lyle School of Engineering, Amerika Birleşik Devletleri
Lun Li
Texas Instruments, Amerika Birleşik Devletleri
Texas Instruments, Amerika Birleşik Devletleri
Daniel G. Saab
Case School of Engineering, Amerika Birleşik Devletleri
Case School of Engineering, Amerika Birleşik Devletleri
| Makale Türü | Özgün Makale (SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale) | ||
| Dergi Adı | IEEE Transactions on Computers | ||
| Dergi ISSN | 0018-9340 Wos Dergi Scopus Dergi | ||
| Dergi Tarandığı Indeksler | SCI | ||
| Makale Dili | İngilizce | Basım Tarihi | 06-2009 |
| Kabul Tarihi | – | Yayınlanma Tarihi | 01-06-2009 |
| Cilt / Sayı / Sayfa | 58 / 6 / 858–864 | DOI | 10.1109/TC.2008.205 |
| Makale Linki | http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=4663062&openedRefinements%3D*%26filter%3DAND%28NOT%284283010803%29%29%26searchField%3DSearch+All%26queryText%3DExact+Path+Delay+Fault+Coverage | ||
| UAK Araştırma Alanları |
Algoritmalar ve Hesaplama Kuramı
|
||
| Özet |
| 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 circuits into several subcircuits and to perform coverage calculation at the partition-level circuit. Partitioning reduces the number of PDFs to be stored in memory exponentially at the expense of losing considerable coverage. This paper describes an algorithm to improve the reported coverage value by recovering the lost PDFs up to a user-controlled degree (Delta), which is a function of the length of cut net sequences. The reported coverage monotonically increases as Delta increases: the exact coverage value is guaranteed when Delta is equal to the number of consecutive partitions on the longest path. Experimental results are provided … |
| Anahtar Kelimeler |
| Exact coverage | Graph theory | Nonenumerative | Partitioned circuits | Path delay fault |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Web of Science | 3 |
| Google Scholar | 7 |