Area and timing estimation for lookup table based FPGAs

The importance of efficient area and timing estimation techniques is well-established in High-Level Synthesis (HLS), since it allows more efficient exploration of the design space while providing HLS tools with the capability of predicting the effects of technology-specific tools on the design space. Much of previous work has focused on estimation techniques that use very simple cost models based solely on the gate and/or literal count. Those models are not accurate enough to allow effective design space exploration since the effects of interconnect can indeed dominate the final design cost. The situation becomes even worse when the design is targeted to Field Programmable Gate Array (FPGA) technologies since the wire delay may contribute up to 60% of the overall design delay. In this paper, we present an approach of estimating area and timing for lookup table based FPGAs that takes into account not only gate area and delay but also the wiring effects. We select Xilinx XC4000 series as our main concentration because of their popularity. We tested our estimator with several benchmarks and the results show that we can get accurate area and timing estimates efficiently.

[1]  Martine D. F. Schlag,et al.  EMPIRICAL EVALUATION OF MULTILEVEL LOGIC MINIMIZATION TOOLS FOR A FIELD-PROGRAMMABLE GATE ARRAY TECHNOLOGY , 1991 .

[2]  Kevin Karplus Amap: a technology mapper for selector-based field-programmable gate arrays , 1991, 28th ACM/IEEE Design Automation Conference.

[3]  Fadi J. Kurdahi,et al.  Combined topological and functionality based delay estimation using a layout-driven approach for high level applications , 1994, EURO-DAC '92.

[4]  Fadi J. Kurdahi,et al.  ChipEst-FPGA: a tool for chip level area and timing estimation of lookup table based FPGAs for high level applications , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[5]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Frank Vahid,et al.  100-hour design cycle: a test case , 1994, EURO-DAC '94.

[7]  Majid Sarrafzadeh,et al.  Complexity of the lookup-table minimization problem for FPGA technology mapping , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Jason Cong,et al.  FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Aart J. de Geus,et al.  Logic synthesis and optimization benchmarks for the 1986 Design Automation Conference , 1986, DAC.

[10]  Jonathan Rose,et al.  Chortle: a technology mapping program for lookup table-based field programmable gate arrays , 1990, 27th ACM/IEEE Design Automation Conference.

[11]  Robert J. Francis A tutorial on logic synthesis for lookup-table based FPGAs , 1992, ICCAD.

[12]  Jason Cong,et al.  On Area/Depth Trade-off in LUT-Based FPGA Technology Mapping , 1993, 30th ACM/IEEE Design Automation Conference.

[13]  Giovanni De Micheli,et al.  Technology mapping for a two-output RAM-based field programmable gate array , 1991, Proceedings of the European Conference on Design Automation..

[14]  Jason Cong,et al.  On area/depth trade-off in LUT-based FPGA technology mapping , 1994, IEEE Trans. Very Large Scale Integr. Syst..