An Iterative Heuristic for State Justi�cation in Sequential Automatic Test Pattern Generation
State justifcation is one of the most time-consuming tasks in sequential Automatic Test Pattern Generation (ATPG). For states that are difficult to justify, deterministic algorithms take significant CPU time without much success most of the time. In this work, we adopt a hybrid approach for state ju...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2001
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/151/1/An_Iterative_Heuristic_for_State_Justification_in_Sequential_Automatic_Test_Pattern_Generation_GECCO2001.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | State justifcation is one of the most time-consuming tasks in sequential Automatic Test Pattern Generation (ATPG). For states that are difficult to justify, deterministic algorithms take significant CPU time without much success most of the time. In this work, we adopt a hybrid approach for state justification. A new method based on Genetic Algorithms is proposed, in which we engineer state justifcation sequences vector by vector. 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. |
|---|