On Line Pruning of ZBDD for Path Delay Fault Coverage Calculation
Yazarlar (3)
Doç. Dr. Fatih KOÇAN Bobby B. Lyle School of Engineering, Amerika Birleşik Devletleri
Mehmet H. Gunes
Bobby B. Lyle School of Engineering, Amerika Birleşik Devletleri
Doç. Dr. Atakan Kurt Fatih Üniversitesi, Türkiye
Makale Türü Özgün Makale (SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale)
Dergi Adı IEICE Transactions on Information and Systems
Dergi ISSN 0916-8532 Wos Dergi Scopus Dergi
Dergi Tarandığı Indeksler SCI-Expanded
Makale Dili İngilizce Basım Tarihi 07-2005
Kabul Tarihi – Yayınlanma Tarihi 01-07-2005
Cilt / Sayı / Sayfa 88 / 7 / 1381–1388 DOI 10.1093/ietisy/e88-d.7.1381
Makale Linki http://dl.acm.org/citation.cfm?id=1184635.1184690&coll=DL&dl=GUIDE&CFID=67251196&CFTOKEN=99503634
UAK Araştırma Alanları
Algoritmalar ve Hesaplama Kuramı
Özet
Zero-suppressed BDDs (ZBDDs) have been used in the nonenumerative path delay fault (PDF) grading of VLSI circuits. One basic and one cut-based grading algorithm are proposed to grade circuits with polynomial and exponential number of PDFs, respectively. In this article, we present a new ZBDD-based basic PDF grading algorithm to enable grading of some circuits with exponential number of PDFs without using the cut-based algorithm. The algorithm overcomes the memory overflow problems by dynamically pruning the ZBDD at run-time. This new algorithm may give exact or pessimistic coverage depending on the statuses of the pruned nodes. Furthermore, we re-assess the performance of the static variable ordering heuristics in ZBDDs for PDF coverage calculation. The proposed algorithm combined with the efficient static variable ordering heuristics can avoid ZBDD size explosion in many circuits …
Anahtar Kelimeler
On-line pruning | Path delay fault | Simulation | ZBDD
Pdf İndir
BM Sürdürülebilir Kalkınma Amaçları
Atıf Sayıları
Web of Science 1
Google Scholar 3
On Line Pruning of ZBDD for Path Delay Fault Coverage Calculation

Paylaş