The Community for Technology Leaders
Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing (1994)
Austin, TX, USA
June 15, 1994 to June 17, 1994
ISBN: 0-8186-5520-8
pp: 446-455
Xinghao Chen , CAIP Center, Rutgers Univ., Piscataway, NJ, USA
ABSTRACT
Automatic test pattern generation (ATPG) for sequential circuits involves making decisions in the state and combinational search spaces defined by a sequential circuit. The search spaces are exponential in the memory elements and primary inputs, respectively, making exhaustive search impractical. Since the circuit topology does not change, ATPG search for different faults may share identical decision spaces. However, existing sequential circuit ATPG algorithms are not capable of recognizing identical search decision spaces. Consequently, they reenter previously-explored decision spaces. We propose a dynamic learning algorithm that identifies previously-explored decision spaces during reverse-time sequential circuit test generation based on decomposition equivalences. This algorithm runs two and 3.3 times faster than GENTEST and HITEC, respectively, on the 1989 ISCAS benchmarks, compresses 24% of the learned information and identifies 85% of all previously-explored decision spaces by state covering. We provide theorems with proofs, examples and results.<>
INDEX TERMS
logic testing, sequential circuits, learning systems, search problems, combinatorial circuits
CITATION

Xinghao Chen and M. Bushnell, "Dynamic state and objective learning for sequential circuit automatic test generation using recomposition equivalence," Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing(FTCS), Austin, TX, USA, 1994, pp. 446-455.
doi:10.1109/FTCS.1994.315618
92 ms
(Ver 3.3 (11022016))