EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

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

Full metadata record

DC FieldValueLanguage
dc.contributor.authorHarikumer, S-
dc.contributor.authorS Kumar-
dc.identifier.citationVLSI Design, Proceedings, Tenth International Conference on, 239 - 242p.en
dc.description.abstractSpeeding up logic simulation is important to reduce design time of complex systems. Hardware emulation through reconfigurable systems (RS) built using FPGA's offer an cheap and efficient method to achieve the required speed-up. Emulation through RS poses some unique problems because of the limited circuit and I/O resources. A preparatory step for emulation using RS is to partition the circuit into as few parts as possible satisfying the resource constraints. This paper presents multi-objective search based optimal and approximate algorithms for circuit partitioning for this purposeen
dc.format.extent49506 bytes-
dc.subjectreconfigurable systemsen
dc.subjectapproximate algorithmsen
dc.titleMultiobjective search based algorithms for circuit partitioning problem for acceleration of logic simulationen
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
harikumarmul1997.pdf48.35 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