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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Design Automation, 2001 Proceedings s. 371 - 376
Hlavní autori: Zhao, Min, Sapatnekar, Sachin S.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: New York, NY, USA ACM 01.01.2001
IEEE
Edícia:ACM Conferences
Predmet:
ISBN:1581132972, 9781581132977
ISSN:0738-100X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:1581132972
9781581132977
ISSN:0738-100X
DOI:10.1145/378239.378526