loading...
Bounding Algorithms for Design Space Exploration
Ann Arbor, Michigan March 04-March 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GLSV.1999.757420Ninth Great Lakes Symposium on VLSI
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Samit Chaudhuri, Magrnu Design Automatim
Robert A. Walker, Kent State University
This paper describes .several new algorithms J&R computing lower bounds on the length of the schedule and the number of functional units in high-level synthesis.
Citation:
Samit Chaudhuri, Robert A. Walker, "Bounding Algorithms for Design Space Exploration," glsvlsi, pp.234, Ninth Great Lakes Symposium on VLSI, 1999
Usage of this product signifies your acceptance of the Terms of Use.