A parallel genetic algorithm for automatic generation of test sequences for digital circuits

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper deals with the problem of Automatic Generation of Test Sequences for digital circuits. Genetic Algorithms have been successfully proposed to solve this industrially critical problem; however, they have some drawbacks, e.g., they are often unable to detect some hard to test faults, and require a careful tuning of the algorithm parameters. In this paper, we describe a new parallel version of an existing GA-based ATPG, which exploits competing sub-populations to overcome these problems. The new approach has been implemented in the PVM environment and has been evaluated on a workstation network using some of the standard benchmark circuits. The results show that it is able to significantly improve the results quality (by testing some critical faults) at the expense of increased CPU time requirements.

Cite

CITATION STYLE

APA

Corno, F., Prinetto, P., Rebaudengo, M., & Reorda, M. S. (1996). A parallel genetic algorithm for automatic generation of test sequences for digital circuits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1067, pp. 454–459). Springer Verlag. https://doi.org/10.1007/3-540-61142-8_583

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free