Data-Flow Transformations using Taylor Expansion Diagrams

Author

Ciesielski, M. ; Askar, S. ; Gomez-Prado, D. ; Guillot, J. ; Boutillon, E.

Author_Institution

Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA

fYear

2007

fDate

16-20 April 2007

Firstpage

1

Lastpage

6

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

Keywords

data flow graphs; Taylor expansion diagrams; data flow graph; data-flow transformations; Data flow computing; Data mining; Data structures; Flow graphs; Hardware design languages; High level synthesis; Optimization methods; Polynomials; Signal processing algorithms; Taylor series;

fLanguage

English

Publisher

ieee

Conference_Titel

Design, Automation & Test in Europe Conference & Exhibition, 2007. DATE '07

Conference_Location

Nice

Print_ISBN

978-3-9810801-2-4

Type

conf

DOI

10.1109/DATE.2007.364634

Filename

4211839