A Deterministic Built-In-Self-Test Generator Based on Cellular Automata Structures

This paper proposes a new approach for designing a cost-effective, on-chip, deterministic, built-in, self-test generator. Given a set of precomputed test vectors (obtained by an ATPG tool) with a predetermined fault coverage, a simple test vector generator (TVG) is synthesized to apply the given test set in a minimal test time. To achieve this objective, cellular automata (CA) structures have been used in which the rule space is not limited to the linear rules commonly used in CA studies recently. Based on some new notations and new formulations of CA properties, two techniques are developed to synthesize such a TVG which is used to generate an ordered/unordered deterministic test vector set. The resulting TVG is very efficient in terms of hardware size and speed performance, and is very regular and testable. Simulation of various benchmark combinational circuits has given good results when compared to alternative solutions. >

[1]  Stephen Wolfram,et al.  Universality and complexity in cellular automata , 1983 .

[2]  Wilfried Daehn,et al.  Accelerated test pattern generation by cone-oriented circuit partitioning , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[3]  Janak H. Patel,et al.  Design of Test Pattern Generators for Built-In Test , 1984, ITC.

[4]  D. Michael Miller,et al.  The analysis of one-dimensional linear cellular automata and their aliasing properties , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Hugo De Man,et al.  Cellular automata based self-test for programmable data paths , 1990, Proceedings. International Test Conference 1990.

[6]  Howard C. Card,et al.  Cellular automata-based pseudorandom number generators for built-in self-test , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Howard C. Card,et al.  Group Properties of Cellular Automata and VLSI Applications , 1986, IEEE Transactions on Computers.

[8]  Robert K. Brayton,et al.  Sequential circuit design using synthesis and optimization , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[9]  Wilfried Daehn,et al.  Hardware Test Pattern Generation for Built-In Testing , 1981, International Test Conference.

[10]  H. Fujiwara,et al.  ON THE ACCELERATION OF TEST GENERATION ALGORlTHMS , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..

[11]  Sheldon B. Akers,et al.  Test set embedding in a built-in self-test environment , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[12]  Wilfried Daehn,et al.  A Hardware Approach to Self-Testing of Large Programmable Logic Arrays , 1981, IEEE Transactions on Computers.

[13]  Hideo Fujiwara,et al.  On the Acceleration of Test Generation Algorithms , 1983, IEEE Transactions on Computers.

[14]  F. Brglez,et al.  A neutral netlists of 10 combinational circuits and a target translator in FORTRAN , 1985 .

[15]  Jacob Savir,et al.  Built In Test for VLSI: Pseudorandom Techniques , 1987 .

[16]  Lin-Bao Yang,et al.  Cellular neural networks: theory , 1988 .

[17]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[18]  B. Kaminska,et al.  Cellular Automata Synthesis Based On Precomputed Test Vectors For Built-in Self-test , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[19]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[20]  Hugo De Man,et al.  Optimized BIST Strategies for Programmable Data Paths Based on Cellular Automata , 1992, Proceedings International Test Conference 1992.