NDLI: Exact Path Delay Fault Coverage Calculation of Partitioned Circuits

Content Provider	IEEE Xplore Digital Library
Author	Kocan, F. Lun Li Saab, D.G.
Copyright Year	1968
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 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 for the ISCAS85 circuits that illustrate the trade-off between the computation time, the number of partitions, the values of Delta, and the reported coverage. The results indicate that as Delta and the number of partitions increase, the runtime does not increase after some point since the cost of set operations reduces as more partitions are created.
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	858
Ending Page	864
Page Count	7
File Size	1923804
File Format	PDF
ISSN	00189340
Volume Number	58
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-06-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Probability density function Partitioning algorithms Integrated circuit modeling Memory management Circuit faults Delay Data structures graph theory. Path delay fault partitioned circuits nonenumerative exact coverage ZBDD Graph Theory Reliability Testing and Fault-Tolerance Test generation Simulation Path Delay Fault Partitioned circuits Nonenumerative Exact Coverage
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the ZBDD-based nonenumerative path delay fault coverage calculation

Function-based compact test pattern generation for path delay faults

NEST: a nonenumerative test generation method for path delay faults in combinational circuits

Exact path delay fault coverage with fundamental ZBDD operations

Improved nonenumerative path-delay fault-coverage estimation based on optimal polynomial-time algorithms

Input Necessary Assignments for Testing of Path Delay Faults in Standard-Scan Circuits

A fast nonenumerative automatic test pattern generator for path delay faults

An efficient nonenumerative method to estimate the path delay fault coverage in combinational circuits

Transition Path Delay Faults: A New Path Delay Fault Model for Small and Large Delay Defects

Exact Path Delay Fault Coverage Calculation of Partitioned Circuits

Similar Documents

On the ZBDD-based nonenumerative path delay fault coverage calculation

Function-based compact test pattern generation for path delay faults

NEST: a nonenumerative test generation method for path delay faults in combinational circuits

Exact path delay fault coverage with fundamental ZBDD operations

Improved nonenumerative path-delay fault-coverage estimation based on optimal polynomial-time algorithms

Input Necessary Assignments for Testing of Path Delay Faults in Standard-Scan Circuits

A fast nonenumerative automatic test pattern generator for path delay faults

An efficient nonenumerative method to estimate the path delay fault coverage in combinational circuits

Transition Path Delay Faults: A New Path Delay Fault Model for Small and Large Delay Defects

Exact Path Delay Fault Coverage Calculation of Partitioned Circuits