Boolean Technology Mapping Based on Logic Decomposition
The decomposition tree of a logic function first appears in the work of Ashenhurst [1]. It is a canonical [1, 2], tree-like logic network representing the decomposition properties of that function. We present an algorithm for technology mapping based on the use of such trees for the representation o...
Uloženo v:
| Vydáno v: | 16th Brazilian Symposium on Integrated Circuit Design (SBCCI 2003) s. 35 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
Washington, DC, USA
IEEE Computer Society
08.09.2003
|
| Edice: | ACM Conferences |
| Témata: | |
| ISBN: | 076952009X, 9780769520094 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The decomposition tree of a logic function first appears in the work of Ashenhurst [1]. It is a canonical [1, 2], tree-like logic network representing the decomposition properties of that function. We present an algorithm for technology mapping based on the use of such trees for the representation of library elements. Decomposition information is also embedded in the representation of leaf-dags of the subject graph. Because library functions are represented by trees, this approach allows us to combine Boolean matching with ef.cient tree-based matching algorithms. In this way, Boolean matching can now be used not only for incremental optimization, but also for building the initial mapping "from scratch". Finally, we remark that bycombining this method with the one of Lehman et al. we are able to represent implicitly a search space of unprecedented size for a subject graph. The algorithm has been implemented in C++ in a propotype mapper, VERSE, and tested on several common synthesis benchmarks. |
|---|---|
| Bibliografie: | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| ISBN: | 076952009X 9780769520094 |
| DOI: | 10.5555/942808.943942 |