Low-cost redundancy identification for combinational circuits
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 315-318
- https://doi.org/10.1109/icvd.1994.282710
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- The Best Flip-Flops to ScanPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- SEARCH STATE EQUIVALENCE FOR REDUNDANCY IDENTIFICATION AND TEST GENERATIONPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Recursive Learning: An attractive alternative to the decision tree for test generation in digital ciPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Combinational profiles of sequential benchmark circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Identification of undetectable faults in combinational circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Redundancy removal and simplification of combinational circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Combinational ATPG theorems for identifying untestable faults in sequential circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A transitive closure algorithm for test generationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Dynamic redundancy identification in automatic test generationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- One-pass redundancy identification and removalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992