Exploiting the Selfish Gene algorithm for evolving hardware cellular automata

Testing is a key issue in the design and production of digital circuits and the adoption of built-in self test techniques is increasingly popular. This paper shows an application in the field of electronic CAD of the Selfish Gene algorithm, an evolutionary algorithm based on a recent interpretation of the Darwinian theory. A three-phase optimization algorithm is exploited for determining the structure of a built-in self test architecture that is able to achieve good fault coverage results with a reduced area overhead. Experimental results show that the attained fault coverage is substantially higher than what can be obtained by previously proposed methods with comparable area requirements.

[1]  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..

[2]  Andrzej Krasniewski,et al.  Circular self-test path: a low-cost BIST technique for VLSI circuits , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Giovanni Squillero,et al.  Evolving Cellular Automata for Self-Testing Hardware , 2000, ICES.

[4]  Tommaso Toffoli,et al.  Cellular automata machines - a new environment for modeling , 1987, MIT Press series in scientific computation.

[5]  Giovanni Squillero,et al.  The selfish gene algorithm: a new evolutionary optimization strategy , 1998, SAC '98.

[6]  Giovanni Squillero,et al.  A new evolutionary algorithm inspired by the selfish gene theory , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[7]  Paolo Prinetto,et al.  On the identification of optimal cellular automata for built-in self-test of sequential circuits , 1998, Proceedings. 16th IEEE VLSI Test Symposium (Cat. No.98TB100231).

[8]  B. Koenemann,et al.  Built-in logic block observation techniques , 1979 .

[9]  Paolo Prinetto,et al.  Cellular automata for deterministic sequential test pattern generation , 1997, Proceedings. 15th IEEE VLSI Test Symposium (Cat. No.97TB100125).

[10]  Shujian Zhang,et al.  Minimal cost one-dimensional linear hybrid cellular automata of degree through 500 , 1995, J. Electron. Test..

[11]  Hugo De Man,et al.  Cellular automata based deterministic self-test strategies for programmable data paths , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Bozena Kaminska,et al.  A Deterministic Built-In-Self-Test Generator Based on Cellular Automata Structures , 1995, IEEE Trans. Computers.

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

[14]  Paolo Prinetto,et al.  A genetic algorithm for automatic generation of test logic for digital circuits , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[15]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[16]  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..

[17]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[18]  F. Corno,et al.  Optimizing deceptive functions with the SG-Clans algorithm , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[19]  R. McLeod,et al.  Cellular automata circuits for built-in self test , 1990 .

[20]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.