DSpace
 

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/1895

Full metadata record

DC FieldValueLanguage
dc.contributor.authorNaseer, A R-
dc.contributor.authorBalakrishnan, M-
dc.contributor.authorA Kumar-
dc.date.accessioned2006-06-29T10:43:07Z-
dc.date.available2006-06-29T10:43:07Z-
dc.date.issued1997-
dc.identifier.citationVLSI Design, Proceedings, Tenth International Conference on, 134 - 139p.en
dc.identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/1895-
dc.description.abstractFor technologies with significant interconnection delays, optimal clock period selection before/during high-level synthesis is not practical. In our approach, we start with a synthesized RTL data path structure, perform place and route and back-annotate the interconnection delays. A set of potentially optimal clock periods are chosen by evaluating `critical' paths to minimize the dead time associated with operations. Finally, the controller costs at these clock periods along with the execution times decide the optimal clock period. Extensive experimental results on data paths synthesized from high-level synthesis benchmarks establish both the utility as well as the efficiency of our approachen
dc.format.extent72094 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectoptimal clock perioden
dc.subjectsynthesized RTL data pathen
dc.titleOptimal clock period for synthesized data pathsen
dc.typeArticleen
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
naseeropt1997.pdf70.4 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