C Is For Circuits: Capturing Fpga Circuits As Sequential Code For Portability

FPGA08: ACM/SIGDA International Symposium on Field Programmable Gate Arrays Monterey California USA February, 2008(2008)

引用 13|浏览6
暂无评分
摘要
Synthesizing common sequential algorithms, captured in a language like C, to FPGA circuits is now well-known to provide dramatic speedups for numerous applications, and to provide tremendous portability and adaptability advantages over circuit implementations of an application. However. many applications targeted to FPGAs are still designed and distributed at the circuit level, due in part to tremendous human ingenuity being exercised at that level to achieve exceptional performance and efficiency. A question then arises as to whether applications for FPGAs will have to be distributed as circuits to achieve desired performance and efficiency,v or if instead a more pot-table language like C might be used. Given a set of common synthesis transformations, we studied the extent to which circuits published in FCCM in the past 6 years could be captured as sequential code and then synthesized back to the published circuit. The study showed that a surprising 82% of the 35 circuits chosen for the study could be rederived from some form of standard C code, suggesting that standard C code, without extensions, may be an effective means for distributing FPGA applications.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要