Test set compaction algorithms for combinational circuits

313Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents two new algorithms, Redundant Vector Elimination (RVE) and Essential Fault Reduction (EFR), for generating compact test sets for combinational circuits under the single stuck at fault model, and a new heuristic for estimating the minimum single stuck at fault test set size. These algorithms together with the dynamic compaction algorithm are incorporated into an advanced ATPG system for combinational circuits, called MinTest. MinTest found better lower bounds and generated smaller test sets than the previously published results for the ISCAS85 and full scan version of the ISCAS89 benchmark circuits.

Cite

CITATION STYLE

APA

Hamzaoglu, I., & Patel, J. H. (1998). Test set compaction algorithms for combinational circuits. In IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers (pp. 283–289). IEEE Comp Soc. https://doi.org/10.1145/288548.288615

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free