Abstract
Pattern matching algorithm is simple and fast comparing to other matching algorithms such as Boolean matching. One major drawback of the pattern matching is that there is a case where a cell needs a lot of patterns representing its logic function. That is because patterns are decomposed into 2-AND/NOT patterns to match against decomposed subject graphs. Furthermore, the conventional technology mapper does not pay much attention to relations among patterns. Each pattern is tried to match independently. In this paper, a novel pattern matching algorithm that does not require patterns to be decomposed and couple of speeding up techniques utilizing inter-relations among cells are described. These methods are very effective for large cell libraries with complex cells. Experimental results show that our methods gain matching time up to 40 times faster.
| Original language | English |
|---|---|
| Pages (from-to) | 118-123 |
| Number of pages | 6 |
| Journal | IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers |
| Publication status | Published - Dec 1 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design, ICCAD - San Jose, CA, USA Duration: Nov 8 1998 → Nov 12 1998 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
Cite this
On accelerating pattern matching for technology mapping. / Matsunaga, Yusuke.
In: IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, 01.12.1998, p. 118-123.Research output: Contribution to journal › Conference article
}
TY - JOUR
T1 - On accelerating pattern matching for technology mapping
AU - Matsunaga, Yusuke
PY - 1998/12/1
Y1 - 1998/12/1
N2 - Pattern matching algorithm is simple and fast comparing to other matching algorithms such as Boolean matching. One major drawback of the pattern matching is that there is a case where a cell needs a lot of patterns representing its logic function. That is because patterns are decomposed into 2-AND/NOT patterns to match against decomposed subject graphs. Furthermore, the conventional technology mapper does not pay much attention to relations among patterns. Each pattern is tried to match independently. In this paper, a novel pattern matching algorithm that does not require patterns to be decomposed and couple of speeding up techniques utilizing inter-relations among cells are described. These methods are very effective for large cell libraries with complex cells. Experimental results show that our methods gain matching time up to 40 times faster.
AB - Pattern matching algorithm is simple and fast comparing to other matching algorithms such as Boolean matching. One major drawback of the pattern matching is that there is a case where a cell needs a lot of patterns representing its logic function. That is because patterns are decomposed into 2-AND/NOT patterns to match against decomposed subject graphs. Furthermore, the conventional technology mapper does not pay much attention to relations among patterns. Each pattern is tried to match independently. In this paper, a novel pattern matching algorithm that does not require patterns to be decomposed and couple of speeding up techniques utilizing inter-relations among cells are described. These methods are very effective for large cell libraries with complex cells. Experimental results show that our methods gain matching time up to 40 times faster.
UR - http://www.scopus.com/inward/record.url?scp=0032308185&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032308185&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:0032308185
SP - 118
EP - 123
JO - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
JF - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
SN - 1092-3152
ER -