Data-flow transformations using Taylor expansion diagrams

Authors:
M. Ciesielski;S. Askar;D. Gomez-Prado;J. Guillot;E. Boutillon
Affiliations:
University of Massachusetts, Amherst, MA;University of Massachusetts, Amherst, MA;University of Massachusetts, Amherst, MA;Université de Bretagne Sud, Lorient, France;Université de Bretagne Sud, Lorient, France
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
2007

Citing 11
Cited 4

High-level transformations for minimizing syntactic variances

DAC '93 Proceedings of the 30th international Design Automation Conference
Optimum and heuristic transformation techniques for simultaneous optimization of latency and throughput

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Synthesis-for-testability using transformations

ASP-DAC '95 Proceedings of the 1995 Asia and South Pacific Design Automation Conference
High level synthesis for reconfigurable datapath structures

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
Computational Aspects of VLSI

Computational Aspects of VLSI
Efficient factorization of DSP transforms using taylor expansion diagrams

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Taylor Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs

IEEE Transactions on Computers
Variable ordering for taylor expansion diagrams

HLDVT '04 Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International
Using global code motions to improve the quality of results for high-level synthesis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimizing power using transformations

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Formal verification of high-level data-flow synthesis designs using relational modeling and symbolic computation

Integration, the VLSI Journal
Optimization of data-flow computations using canonical TED representation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimizing data-flow graphs with min/max, adding and relational operations

Proceedings of the Conference on Design, Automation and Test in Europe
Optimizing data flow graphs to minimize hardware implementation

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

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.