DocumentCode
1747917
Title
A new structural pattern matching algorithm for technology mapping
Author
Zhao, Min ; Sapatnekar, Sachin S.
Author_Institution
Adv. Tools, Motorola Inc., Austin, TX, USA
fYear
2001
fDate
2001
Firstpage
371
Lastpage
376
Abstract
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.
Keywords
Boolean functions; cellular arrays; logic CAD; pattern matching; software libraries; library cells; lookup table; memory usage; memory utilization; structural pattern matching algorithm; subject Boolean network; technology mapping; Computer science; Contracts; Logic; Network synthesis; Pattern matching; Permission; Software libraries; Table lookup; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 2001. Proceedings
ISSN
0738-100X
Print_ISBN
1-58113-297-2
Type
conf
DOI
10.1109/DAC.2001.156168
Filename
935537
Link To Document