Please use this identifier to cite or link to this item: http://nopr.niscpr.res.in/handle/123456789/24170
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhuvaneswari, M C-
dc.contributor.authorSivanandam, S N-
dc.date.accessioned2013-11-25T08:58:18Z-
dc.date.available2013-11-25T08:58:18Z-
dc.date.issued2003-02-
dc.identifier.issn0975-1017 (Online); 0971-4588 (Print)-
dc.identifier.urihttp://hdl.handle.net/123456789/24170-
dc.description21-26en_US
dc.description.abstractTesting is an essential part of any VLSI manufacturing system as it is necessary to separate bad circuits from the good ones. The testing process detects the physical defects produced during fabrication. Test generation for sequential circuits is a search problem over large vector space, proportional to the number of inputs and number of states. Genetic Algorithm (GA) has been effectively used for Automatic Test Pattern Generation. In this paper, two new crossover operators, the sequence based and the weight-based, are proposed. The proposed operators significantly improve the performance of a GA-based test pattern generator for stuck-at-faults in synchronous sequential circuits. The effectiveness of the approach is demonstrated on the ISCAS89 sequential benchmark circuits. Experimental results on the ISCAS89 sequential benchmark circuits demonstrate that the weight-based crossover operator is effective for GA-based test generation. The weight-based crossover provides high fault coverage and compact test vectors for most of the benchmark circuits.en_US
dc.language.isoen_USen_US
dc.publisherNISCAIR-CSIR, Indiaen_US
dc.rights CC Attribution-Noncommercial-No Derivative Works 2.5 Indiaen_US
dc.sourceIJEMS Vol.10(1) [February 2003]en_US
dc.titleNew crossover operators for GA-based synchronous sequential circuit testingen_US
dc.typeArticleen_US
Appears in Collections:IJEMS Vol.10(1) [February 2003]

Files in This Item:
File Description SizeFormat 
IJEMS 10(1) 21-26.pdf1.18 MBAdobe PDFView/Open


Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.