Transformation synthesis for data intensive applications to FPGAs


Without the adequate awareness of trade-off between different resources, it is extremely difficult for system synthesis tools to achieve high performance solutions when mapping the applications to FPGA-based computing engines. In this paper, we present an automatic synthesis methodology which attacks both memory and logic assignments by interacting with behavioral synthesis. The problem is formulated as part of the heuristic algorithm by exploiting application specific information and organizing possible data structures and computations for data-intensive applications. We have evaluated the proposed framework on a set of DSP benchmarks and a real multimedia application by generating register-transfer level (RTL) implementations. The results show that, by using our proposed techniques, it is possible the synthesized designs obtain significant (avg. of 34.8%) performance improvements over the conventional synthesis approaches.

DOI: 10.1145/1127908.1127988

5 Figures and Tables

Cite this paper

@inproceedings{Huang2006TransformationSF, title={Transformation synthesis for data intensive applications to FPGAs}, author={Renqiu Huang and Ranga Vemuri}, booktitle={ACM Great Lakes Symposium on VLSI}, year={2006} }