ACM Home Page
Please provide us with feedback. Feedback
Transformation synthesis for data intensive applications to FPGAs
Full text PdfPdf (148 KB)
Source Great Lakes Symposium on VLSI archive
Proceedings of the 16th ACM Great Lakes symposium on VLSI table of contents
Philadelphia, PA, USA
POSTER SESSION: Poster session 2 table of contents
Pages: 349 - 352  
Year of Publication: 2006
ISBN:1-59593-347-6
Authors
Renqiu Huang  University of Cincinnati, Cincinnati, OH
Ranga Vemuri  University of Cincinnati, Cincinnati, OH
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 16,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1127908.1127988
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
N. Dutt and C. Ramachandran. Benchmarks for the 1992 high level synthesis workshop. Tech. Rep. 92-107, Dep. Inform. Comput. Sci., Univ. California, Irvin, 1992.
3
 
4
P. Kollig and B. Al-Hashimi. Simultaneous scheduling, allocation and binding in high-level synthesis. Electronics Letters, 33(18), Aug. 1997.
 
5
B. T. Messmer. Efficient Graph Matching Algorithms for PreProcessed Model Graphs. PhD thesis, University of Berne, Nov 1995.
 
6
 
7
N. Narasimhan. Formal-Asssertions Based Verification in a High-Level Synthesis System. PhD thesis, University of Cincinnati, 1998.
 
8
J. Nestor and D. Thomas. Behavioral synthesis with interfaces. In Proceedings of ICCAD, Nov 1986.
 
9
10
 
11
P. Paulin and J. Knight. Force directed scheduling for the behavioral synthesis of asics. IEEE Transactions on CAD, volume 8:661--679, Jun 1989.
 
12
13
 
14
M. A. Turk and A. P. Pentland. Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3(1):71--96, 1991.

Collaborative Colleagues:
Renqiu Huang: colleagues
Ranga Vemuri: colleagues