loading...
A Novel Hueristic and Provable Bounds for Reconfigurable Architecture Design
Napa, California April 24-April 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FCCM.2006.1114th Annual IEEE Symposium on Field-P ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Alastair M. Smith, Imperial College London
George A. Constantinides, Imperial College London
Peter Y. K. Cheung, Imperial College London
This paper is concerned with the application of formal optimisation methods to the design of mixed-granularity FPGAs. In particular, we investigate the appropriate mix and floorplan of heterogeneous elements: multipliers, RAMs, and LUT-based logic, in order to maximise the performance of a set of DSP benchmark applications, given a fixed silicon budget. We extend our previous mathematical programming framework by proposing a novel set of heuristics, capable of providing upper bounds on the achievable reconfigurable-tofixed- logic performance ratio. Our results provide, for the first time, quantifications of the optimal performance/areaenhancing capability of multipliers and RAM blocks within a system context, and indicate that only a minimal performance benefit can be achieved over Virtex II by re-organising the device floorplan, when using optimal technology mapping.
Citation:
Alastair M. Smith, George A. Constantinides, Peter Y. K. Cheung, "A Novel Hueristic and Provable Bounds for Reconfigurable Architecture Design," fccm, pp.275-276, 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.