(2005) Evolutionary algorithms for state justification in sequential automatic test pattern generation.
|
PDF
J_ElMaleh_EISEEC_March2005.pdf Download (402kB) | Preview |
Abstract
Sequential circuit test generation using deterministic, fault-oriented algorithms is highly complex and time consuming. New approaches are needed to enhance the existing techniques, both to reduce execution time and improve fault coverage. Evolutionary algorithms have been effective in solving many search and optimization problems. A common search operation in sequential Automatic Test Pattern Generation is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. In this work, a hybrid approach which uses a combination of evolutionary and deterministic algorithms for state justification is proposed. A General Algorithm is employed, to engineer state justification sequences vector by vector. This is in contrast to previous approaches where GA is applied to the whole sequence. The proposed method is compared with previous GA-based approaches. Significant improvements have been obtained for ISCAS benchmark circuits in terms of state coverage and CPU time. Furhtermore, it is demonstrated that the state justification sequence generated, helps the ATPG in detecting a large number of hard to detect faults.
| Item Type: | Article |
|---|---|
| Subjects: | Computer |
| Department: | College of Computing and Mathematics > Computer Engineering |
| Depositing User: | AbdulRahman |
| Date Deposited: | 09 Mar 2008 12:24 |
| Last Modified: | 01 Nov 2019 13:23 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/261 |