Title :
A Novel Hueristic and Provable Bounds for Reconfigurable Architecture Design
Author :
Smith, Alastair M. ; Constantinides, George A. ; Cheung, Peter Y K
Author_Institution :
Dept. of Electr. & Electron. Eng., Imperial Coll., London
Abstract :
This paper is concerned with the application of formal optimisation methods to the design of mixed-granularity FPGAs. In particular, the authors 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. The authors extend our previous mathematical programming framework by proposing a novel set of heuristics, capable of providing upper bounds on the achievable reconfigurable-to-fixed-logic performance ratio. The results provide, for the first time, quantifications of the optimal performance/area-enhancing 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
Keywords :
digital signal processing chips; field programmable gate arrays; heuristic programming; integrated circuit layout; mathematical programming; random-access storage; reconfigurable architectures; table lookup; DSP benchmark; LUT logic; RAM blocks; Virtex II; floorplanning; formal optimisation; heuristic bound; mathematical programming framework; mixed-granularity FPGA; multipliers; optimal technology mapping; reconfigurable architecture; Design methodology; Digital signal processing; Field programmable gate arrays; Logic programming; Mathematical programming; Optimization methods; Reconfigurable architectures; Reconfigurable logic; Silicon; Upper bound;
Conference_Titel :
Field-Programmable Custom Computing Machines, 2006. FCCM '06. 14th Annual IEEE Symposium on
Conference_Location :
Napa, CA
Print_ISBN :
0-7695-2661-6
DOI :
10.1109/FCCM.2006.11