A new structural pattern matching algorithm for technology mapping

In this paper, a new structural matching algorithm for technology mapping is proposed. The algorithm is based on a key observation that the matches for a node in a subject Boolean network are related to the matches for its children. The structural relationships between the library cells are modeled...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Design Automation, 2001 Proceedings S. 371 - 376
Hauptverfasser: Zhao, Min, Sapatnekar, Sachin S.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: New York, NY, USA ACM 01.01.2001
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
Applied computing > Physical sciences and engineering > Electronics
Applied computing > Physical sciences and engineering > Engineering
Computer science
Computer systems organization
Contracts
Hardware
Logic
Mathematics of computing > Discrete mathematics
Network synthesis
Pattern matching
Permission
Software libraries
Table lookup
Theory of computation > Design and analysis of algorithms > Data structures design and analysis > Pattern matching
Tree data structures
ISBN:1581132972, 9781581132977
ISSN:0738-100X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, a new structural matching algorithm for technology mapping is proposed. The algorithm is based on a key observation that the matches for a node in a subject Boolean network are related to the matches for its children. The structural relationships between the library cells are modeled using a lookup table. The proposed method is fast, has low memory usage, and is easy to implement. Experimental results show speedups of 20x over Matsunaga's fast mapping approach, and orders of magnitude over SIS, with the same or slightly better results, and much lower memory utilization.
Bibliographie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:1581132972
9781581132977
ISSN:0738-100X
DOI:10.1145/378239.378526