2010 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE 2010) 2010
DOI: 10.1109/date.2010.5457022
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing Data-Flow Graphs with min/max, adding and relational operations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…[81], [82]. In [81], the authors describe a technique using Taylor Expansion Diagrams (TED) [83], to optimize DFGs of arithmetic expressions for hardware synthesis. In [82], authors concentrate on optimizing DFGs with min-max, adding and relational operations by adding/deleting nodes.…”
Section: Compilation Of Design Specificationmentioning
confidence: 99%
“…[81], [82]. In [81], the authors describe a technique using Taylor Expansion Diagrams (TED) [83], to optimize DFGs of arithmetic expressions for hardware synthesis. In [82], authors concentrate on optimizing DFGs with min-max, adding and relational operations by adding/deleting nodes.…”
Section: Compilation Of Design Specificationmentioning
confidence: 99%