From algorithm graph specification to automatic synthesis of FPGA circuit: A seamless flow of graphs transformations

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The control, signal and image processing applications are complex in terms of algorithms, hardware architectures and real-time/ embedded constraints. System level CAD softwares are then useful to help the designer for prototyping and optimizing such applications. These tools are oftently based on design flow methodologies. This paper presents a seamless design flow which transforms a data dependence graph specifying the application into an implementation graph containing both data and control paths. The proposed approach follows a set of rules based on the RTL model and on mechanisms of synchronized data transfers in order to transform automatically the initial algorithmic graph into the implementation graph. This transformation flow is part of the extension of our AAA (Algorithm-Architecture Adequation) rapid prototyping methodology to support the optimized implementation of real-time applications on reconfigurable circuits. It has been implemented in SynDEx1, a system level CAD software tool that supports AAA. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Kaouane, L., Akil, M., Sorel, Y., & Grandpierre, T. (2003). From algorithm graph specification to automatic synthesis of FPGA circuit: A seamless flow of graphs transformations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2778, 934–943. https://doi.org/10.1007/978-3-540-45234-8_90

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free