High-level delay estimation technique for porting C-based applications on FPGA

Rapid area-time estimation is an instrumental step for efficient design exploration of FPGA-based implementations. In this paper, we address the issue of high-level delay estimation for porting C-based applications onto FPGA. In particular, we present a framework which incorporates a compiler to generate optimized high-level IR (intermediate representation) of the C-applications and an estimation model that is based on an architecture template with application-specific heterogeneous functional units. In order to accurately predict the post place and route delay of the design, the proposed estimation strategy performs a simplified floor-planning process. This leads to more accurate interconnect delay estimation, which is then combined with the pre-characterized delay parameters of the components. Experimental results based on a set of embedded functions show that the proposed estimation technique can achieve comparable results with synthesis results from a commercial FPGA tool in significantly shorter amount of time. In particular, the proposed method has an average error of only 4% with a maximum error of 10%. In addition, the proposed method leads to more consistent estimation results when compared to the Xilinx synthesis tool and to a naive approach that only employs pre-characterized parameters in the estimation model.

[1]  Stephen Dean Brown,et al.  Difficulty of predicting interconnect delay in a timing driven FPGA CAD flow , 2006, SLIP '06.

[2]  Scott A. Mahlke,et al.  High-level synthesis of nonprogrammable hardware accelerators , 2000, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors.

[3]  Louis Scheffer,et al.  Why interconnect prediction doesn't work , 2000, SLIP '00.

[4]  Dinesh Bhatia,et al.  A priori wirelength and interconnect estimation based on circuit characteristics , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  João M. P. Cardoso,et al.  On estimations for compiling software to FPGA-based systems , 2005, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05).

[6]  William Fornaciari,et al.  An area estimation methodology for FPGA based designs at systemc-level , 2004, Proceedings. 41st Design Automation Conference, 2004..

[7]  Sung-Mo Kang,et al.  An empirical model for accurate estimation of routing delay in FPGAs , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[8]  Jean Luc Philippe,et al.  Design Space Pruning Through Early Estimations of Area/Delay Tradeoffs for FPGA Implementations , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Alok N. Choudhary,et al.  Accurate area and delay estimators for FPGAs , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[10]  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.

[11]  Pedro C. Diniz,et al.  Using estimates from behavioral synthesis tools in compiler-directed design space exploration , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[12]  Mike Hutton,et al.  Interconnect prediction for programmable logic devices , 2001, SLIP '01.

[13]  Robert A. Walker,et al.  Computing lower bounds on functional units before scheduling , 1994, ISSS '94.

[14]  Fadi J. Kurdahi,et al.  Compile-time area estimation for LUT-based FPGAs , 2006, TODE.

[15]  Minjoong Rim,et al.  Estimating performance characteristics of loop transformations , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[16]  Fadi J. Kurdahi,et al.  Area and timing estimation for lookup table based FPGAs , 1996, Proceedings ED&TC European Design and Test Conference.

[17]  Scott A. Mahlke,et al.  Trimaran: An Infrastructure for Research in Instruction-Level Parallelism , 2004, LCPC.

[18]  Minjoong Rim,et al.  Lower-bound performance estimation for the high-level synthesis scheduling problem , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Michael Feuer Connectivity of Random Logic , 1982, IEEE Transactions on Computers.

[20]  Nikil D. Dutt,et al.  A comprehensive estimation technique for high-level synthesis , 1995, Proceedings of the Eighth International Symposium on System Synthesis.