Extending Pitchmatching Algorithms to Layouts with Multiple Grid Constraints

スポンサーリンク

概要

• 論文の詳細を見る

• Pitchmatching algorithms are widely used in layout environments where no grid constraints are imposed. However, realistic layouts include multiple grid constraints which facilitate the applications of automatic routing. Hence, pitchmatching algorithms should be extended to those realistic layouts. This paper formulates a pitchmatching problem with multiple grid constraints. An algorithm for solving this problem is constructed as an extension of conventional pitchmatching algorithms. The computational complexity is also discussed in comparison with a conventional naive algorithm. Finally, examples and application results to realistic layouts are presented.

• 一般社団法人電子情報通信学会の論文
• 1996-06-25

著者

• Miyashita Hiroshi

  NTT LSI Laboratories

関連論文

• An Automated Approach to Generating Leaf Cells for a Macro Cell Configuration
• A Preconstrained Compaction Method Applied to Direct Design-Rule Conversion of CMOS Layouts
• Extending Pitchmatching Algorithms to Layouts with Multiple Grid Constraints

スポンサーリンク