TY - JOUR
T1 - A new structural pattern matching algorithm for technology mapping
AU - Zhao, Min
AU - Sapatnekar, Sachin S.
PY - 2001/1/1
Y1 - 2001/1/1
N2 - 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 20× over Matsunaga's fast mapping approach, and orders of magnitude over SIS, with the same or slightly better results, and much lower memory utilization.
AB - 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 20× over Matsunaga's fast mapping approach, and orders of magnitude over SIS, with the same or slightly better results, and much lower memory utilization.
UR - http://www.scopus.com/inward/record.url?scp=0034854482&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034854482&partnerID=8YFLogxK
U2 - 10.1109/DAC.2001.156168
DO - 10.1109/DAC.2001.156168
M3 - Article
AN - SCOPUS:0034854482
SP - 371
EP - 376
JO - Proceedings - Design Automation Conference
JF - Proceedings - Design Automation Conference
SN - 0738-100X
ER -