Accelerated test pattern generation by cone-oriented circuit partitioning
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 418-421
- https://doi.org/10.1109/edac.1990.136684
Abstract
An efficient cone oriented circuit partitioning method is presented, which significantly speeds up automatic test pattern generation for combinational circuits. The advantages gained by the proposed partitioning method are based on the increase in the number of dominators in the circuit graph. In contrast to conventional ATPG working on the unpartitioned circuit test generation is less time consuming now and redundancies can often be identified without any backtracks. Experimental results illustrate the superiority of the cone oriented partitioning approach. Independent of the underlying ATPG algorithm the cone oriented partitioning results on average in a performance increase by more than a factor of 2.Keywords
This publication has 9 references indexed in Scilit:
- ON THE ACCELERATION OF TEST GENERATION ALGORlTHMSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Advanced automatic test pattern generation and redundancy identification techniquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Administration, OTA differ on test verificationEos, 1988
- A topological search algorithm for ATPGPublished by Association for Computing Machinery (ACM) ,1987
- An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic CircuitsIEEE Transactions on Computers, 1981
- A Nine-Valued Circuit Model for Test GenerationIEEE Transactions on Computers, 1976
- Finding Dominators in Directed GraphsSIAM Journal on Computing, 1974
- Enhancing Testability of Large-Scale Integrated Circuits via Test Points and Additional LogicIEEE Transactions on Computers, 1973
- Diagnosis of Automata Failures: A Calculus and a MethodIBM Journal of Research and Development, 1966