arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0605143cs.AR
收藏

I/O时序和内存约束下的高级综合

High-level synthesis under I/O Timing and Memory constraints

Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eric Senn, Eric Martin

摘要:

复杂的片上系统的设计需要考虑到通信和存储器访问的限制,集成专用的硬件加速器。在本文中,我们提出了一种方法和一个工具,允许DSP算法的高层次综合,在I/O时序和内存的限制。基于正式模型和通用架构,该工具可以帮助设计人员找到一个合理的权衡所需的I/O时序行为和内部存储器访问并行电路之间。我们的方法的兴趣证明了FFT算法的案例研究。

英文摘要:

The design of complex Systems-on-Chips implies to take into account communication and memory access constraints for the integration of dedicated hardware accelerator. In this paper, we present a methodology and a tool that allow the High-Level Synthesis of DSP algorithm, under both I/O timing and memory constraints. Based on formal models and a generic architecture, this tool helps the designer to find a reasonable trade-off between both the required I/O timing behavior and the internal memory access parallelism of the circuit. The interest of our approach is demonstrated on the case study of a FFT algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑