Name
Abstract | ||
|---|---|---|
Editor's note:This article provides an overview of a canonical representation for arithmetic expressions and how it can be used to obtain various factorizations of such expressions to optimize them. The applicability of the approach is demonstrated in a high-level synthesis flow.—Andres Takach, Mentor Graphics |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/MDT.2009.82 | IEEE Design & Test of Computers |
Keywords | Field | DocType |
data mining,optimization,canonical representation,additives,taylor expansion,boolean functions,hardware,arithmetic expression,polynomials,high level synthesis,data structures,symbolic algebra | Boolean function,Data structure,Algebra,Expression (mathematics),Computer science,High-level synthesis,Symbolic computation,Theoretical computer science,Canonical form,Dataflow,Computer engineering,Taylor series | Journal |
Volume | Issue | ISSN |
26 | 4 | 0740-7475 |
Citations | PageRank | References |
2 | 0.44 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maciej J. Ciesielski | 1 | 629 | 74.80 |
| Jérémie Guillot | 2 | 14 | 2.28 |
| Daniel Gomez-Prado | 3 | 5 | 1.55 |
| Emmanuel Boutillon | 4 | 272 | 40.10 |