Title :
On metrics for comparing interconnect estimation methods for FPGAs
Author :
Kannan, Parivallal ; Balachandran, Shankar ; Bhatia, Dinesh
Author_Institution :
Center for Integrated Circuits & Syst., Univ. of Texas, Richardson, TX, USA
fDate :
4/1/2004 12:00:00 AM
Abstract :
Interconnect management is a critical design issue for large field-programmable gate arrays (FPGA) based designs. One of the most important issues for planning interconnection is the ability to reliably and efficiently predict the interconnect requirements of a given design on a given FPGA architecture. Many interconnect estimation methods have been reported so far and the estimation problem is also under active research. From a CAD tool deployment point of view, comparing these estimation methods is very difficult because of the different reporting methods used by the authors. We make an argument for and propose a new uniform reporting metric, based on comparing the estimates with the results of an actual detailed router on both local and global levels. We then compare some of the well known and promising interconnect estimation methods using our new metric on a large number of benchmark circuits.
Keywords :
VLSI; circuit layout CAD; field programmable gate arrays; integrated circuit interconnections; integrated circuit layout; logic CAD; network routing; CAD tool; Lou´s method; RISA; Rent´s rule; benchmark circuits; congestion; interconnect estimation methods; interconnection planning; large FPGA; routability; routing resource requirement; uniform estimation quality metric; Application specific integrated circuits; Design automation; Field programmable gate arrays; Integrated circuit interconnections; Logic devices; Pins; Random number generation; Routing; Very large scale integration; Wiring;
Journal_Title :
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
DOI :
10.1109/TVLSI.2004.825865