Optimization of Data Flow Computations using Canonical TED Representation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Design & Test Année : 2009

Optimization of Data Flow Computations using Canonical TED Representation

Résumé

This paper describes a systematic method and an experimental software system for high-level transformations of designs specified at behavioral level. The goal is to transform the initial design specifications into an optimized data flow graph (DFG) better suited for high-level synthesis. The optimizing transformations are based on a canonical Taylor Expansion Diagram (TED) representation, followed by structural transformations of the resulting DFG network. The system is intended for data-flow and computation-intensive designs used in computer graphics and digital signal processing applications.

Domaines

Electronique
Fichier principal
Vignette du fichier
IEEE_design_test_TED_1_.pdf (182.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00449995 , version 1 (24-01-2010)

Identifiants

  • HAL Id : hal-00449995 , version 1

Citer

Maciej Ciesielski, Jeremie Guillot, Daniel Gomez-Prado, Quian Ren, Emmanuel Boutillon. Optimization of Data Flow Computations using Canonical TED Representation. IEEE Design & Test, 2009, 26 (4), pp.46-57. ⟨hal-00449995⟩
82 Consultations
351 Téléchargements

Partager

Gmail Facebook X LinkedIn More