High-level synthesis under I/O Timing and Memory constraints
Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eric Senn, Eric Martin
Abstract
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.
Create a lesson
Related papers
LLMs in Digital EDA: A perspective on shifting roles from Generation to Orchestration
Matthew Youngman, Cristian Sestito, Themis Prodromakis
HOLMES: In-Context Failure-Center Localization for High-Dimensional Yield Estimation
Wei W. Xing, Xixi Zhou, Kaiqi Huang et al.
Redwood: A Frontier AI Accelerator Designed, Verified, and Deployed from Scratch in 2 Weeks by AI
Architect Labs
Beyond Edge Cuts: Activity-Weighted Multicast Hypergraph Mapping for Spiking Neural Networks on Mesh NoCs
Amirreza Khorasanian
MeshReduce-U: Compiler-Guided Communication Reduction for Irregular Neural Reductions on Mesh NoCs
Amirreza Khorasanian
Ankhdjet: An Open-Source Compiler for Mask-Programmed Ternary Compute-in-ROM on an Open PDK
Mohnish Pai