Data-flow transformations using Taylor expansion diagrams

13 years 11 months ago

Download www.ecs.umass.edu

Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data ﬂow 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 speciﬁcations.

Maciej J. Ciesielski, Serkan Askar, Daniel Gomez-P

Real-time Traffic

Data ﬂow Graph | DATE 2007 | Hardware | Taylor Expansion Diagram | Word-level Data Structure |

claim paper

» Optimizing data flow graphs to minimize hardware implementation

» Translating data flow to synchronous block diagrams

» The utilization of a Taylor seriesbased transformation in fingerprint verification

» Control and Data Flow Testing on Function Block Diagrams

» An Automated Approach to Transform Use Cases into Activity Diagrams

» On nonlinear transformations of stochastic variables and its application to nonlinear filt...

» Efficient subset selection based on the Renyi entropy

» Automatic online tuning for fast Gaussian summation

Post Info
More Details (n/a)

Added	02 Jun 2010
Updated	02 Jun 2010
Type	Conference
Year	2007
Where	DATE
Authors	Maciej J. Ciesielski, Serkan Askar, Daniel Gomez-Prado, Jérémie Guillot, Emmanuel Boutillon

Comments (0)

Sciweavers

Data-flow transformations using Taylor expansion diagrams

Data ﬂow Graph | DATE 2007 | Hardware | Taylor Expansion Diagram | Word-level Data Structure |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers