Data-Flow Transformations Using Taylor Expansion Diagrams - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Data-Flow Transformations Using Taylor Expansion Diagrams

Abstract

An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical, word-level data structure, Taylor Expansion Diagram (TED), is used as a vehicle to effect this transformation. The problem is formulated as that of applying a sequence of decomposition cuts to a TED that transforms it into a DFG optimized for a particular objective. A systematic approach to arrive at such a decomposition is described. Experimental results show that such constructed DFG provides a better starting point for architectural synthesis than those extracted directly from HDL specifications.
Fichier principal
Vignette du fichier
DATA_07_TED.pdf (161.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00167364 , version 1 (20-08-2007)

Identifiers

  • HAL Id : hal-00167364 , version 1

Cite

Maciej Ciesielski, Serkan Askar, Daniel Gomez-Prado, Jeremie Guillot, Emmanuel Boutillon. Data-Flow Transformations Using Taylor Expansion Diagrams. DATE'2007, Apr 2007, Nice, France. ⟨hal-00167364⟩

Collections

CNRS LESTER
51 View
240 Download

Share

Gmail Facebook X LinkedIn More