loading...
Cellular automata for deterministic sequential test pattern generation
Monterey, California April 27-May 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/VTEST.1997.59944215th IEEE VLSI Test Symposium (VTS'97)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
S. Chiusano, Dipt. di Autom. e Inf., Politecnico di Torino, Italy
F. Corno, Dipt. di Autom. e Inf., Politecnico di Torino, Italy
P. Prinetto, Dipt. di Autom. e Inf., Politecnico di Torino, Italy
M. Sonza Reorda, Dipt. di Autom. e Inf., Politecnico di Torino, Italy
This paper addresses the issue of identifying a Cellular Automaton able to generate deterministic input patterns to detect stuck-at faults inside an FSM. A suitable hardware structure is first identified. An evolutionary algorithm is then proposed, which directly identifies a Cellular Automaton able to reach a very good Fault Coverage. The novelty of the method consists in combining the generation of test patterns with the synthesis of a Cellular Automaton able to reproduce them. Experimental results are provided, which show that the proposed hardware architecture and algorithmic approach outperform more traditional solutions, based on ATPG tools and FSM synthesis, from the point of view of both applicability and area occupation, while reaching the same Fault Coverage.
Index Terms:
deterministic automata; deterministic sequential test pattern generation; cellular automata; cellular automaton identification; stuck-at faults; FSM; hardware structure; evolutionary algorithm; fault coverage; area occupation; BIST; ASIC testing
Citation:
S. Chiusano, F. Corno, P. Prinetto, M. Sonza Reorda, "Cellular automata for deterministic sequential test pattern generation," vts, pp.60, 15th IEEE VLSI Test Symposium (VTS'97), 1997
Usage of this product signifies your acceptance of the Terms of Use.