Exploiting the Selfish Gene Algorithm for Evolving Cellular Automata
IJCNN2000: IEEE-INNS-ENNS International Joint Conference Neural Networks, Como (I), July 2000, pp. 577-581
KEYWORDS: Approximate Methods,
BIST,
Cellular Automata,
Evolutionary Algorithms,
Gate-Level,
Selfish Gene,
Simulation-Based Approaches
ABSTRACT
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. Testing is a key issue in the design and production of digital circuits and the adoption of Built-In Self-Test (BIST) techniques is increasingly popular. In this paper, the Selfish Gene algorithm is adopted for determining the logic for a BIST architecture based on Cellular Automata (CA). A Genetic Algorithm has already been proposed for identifying good BIST architectures based on CA. However, adopting 2-bit cells, such method introduced a significant area overhead. Thanks to the adoption of the new and more powerful search engine, we were able to identify simpler BIST structures with a lower area overhead, but still able to obtain the same fault coverage.
| Related files: | |
|---|---|
| ijcnn2000.pdf | Adobe Acrobat portable document |
Copyright note for papers published by the IEEE Computer Society:
Copyright IEEE. Personal use of this material is permitted. However,
permission to reprint/republish this material for advertising or
promotional purposes or for creating new collective works for resale
or redistribution to servers or lists, or to reuse any copyrighted
component of this work in other works, must be obtained from the IEEE.
[CSSq00] F. Corno, M. Sonza Reorda, G. Squillero, "Exploiting the Selfish Gene Algorithm for Evolving Cellular Automata," IJCNN2000: IEEE-INNS-ENNS International Joint Conference Neural Networks, Como (I), July 2000, pp. 577-581