Compile-time area estimation for LUT-based FPGAs

29Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Cameron Project has developed a system for compiling codes written in a high-level language called SA-C, to FPGA-based reconfigurable computing systems. In order to exploit the parallelism available on the FPGAs, the SA-C compiler performs a large number of optimizations such as full loop unrolling, loop fusion and strip-mining. However, since the area on an FPGA is limited, the compiler needs to know the effect of compiler optimizations on the FPGA area; this information is typically not available until after the synthesis and place and route stage, which can take hours. In this article, we present a compile-time area estimation technique to guide SA-C compiler optimizations. We demonstrate our technique for a variety of benchmarks written in SA-C. Experimental results show that our technique predicts the area required for a design to within 2.5% of actual for small image processing operators and to within 5.0% for larger benchmarks. The estimation time is in the order of milliseconds, compared with minutes for the synthesis tool. © 2006 ACM.

Cite

CITATION STYLE

APA

Kulkarni, D., Najjar, W. A., Rinker, R., & Kurdahi, F. J. (2006). Compile-time area estimation for LUT-based FPGAs. ACM Transactions on Design Automation of Electronic Systems, 11(1), 104–122. https://doi.org/10.1145/1124713.1124721

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free