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.
|ジャーナル||IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers|
|出版ステータス||出版済み - 1998|
|イベント||Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design, ICCAD - San Jose, CA, USA|
継続期間: 11月 8 1998 → 11月 12 1998
!!!All Science Journal Classification (ASJC) codes
- コンピュータ サイエンスの応用
- コンピュータ グラフィックスおよびコンピュータ支援設計