EPrints@IIT Delhi >
Faculty Research Publicatons  >
Electrical Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1875

Full metadata record

DC FieldValueLanguage
dc.contributor.authorRavikumar, C P-
dc.contributor.authorRajarajan, N-
dc.identifier.citationVLSI Design, Proceedings, Ninth International Conference on, 118 - 121p.en
dc.description.abstractIn this paper, we consider genetic algorithms for two problems connected with scan path design for VLSI circuits. The first problem, called partial scan path selection, is to optimize the number of flip-flops to be included in the scan path, at the same time maximizing the fault coverage. The second problem, called multiple scan configuration, is to divide the scan path into a specified number of subchains in order to minimize the test application time. Both problems are combinatorial optimization problems and we show that they lend themselves effectively to a genetic formulation. Our algorithms have been implemented on a Sun/SPARC in the OASIS design automation environment. We have tested our algorithms on standard benchmarks and the results are encouraging. Compared to other existing methods for scan design, the genetic paradigm is attractive due to its simplicity, potential to generate a global optimal solution, and capability to model compound objective functionsen
dc.format.extent52421 bytes-
dc.subjectscan pathen
dc.subjectgenetic paradigmen
dc.titleGenetic algorithms for scan path designen
Appears in Collections:Electrical Engineering

Files in This Item:

File Description SizeFormat
ravikumargen1996.pdf51.19 kBAdobe PDFView/Open
View Statistics

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


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback