A Preconstrained Compaction Method Applied to Direct Design-Rule Conversion of CMOS Layouts
スポンサーリンク
概要
- 論文の詳細を見る
This paper describes a preconstrained compaction method and its application to the direct design-rule conversion of CMOS layouts. This approach can convert already designed physical patterns into compacted layouts that satisfy user-specified design rules. Furthermore, preconstrained compaction can eliminate unnecessarily extended diffusion areas and polysilicon wires which tend to be created with conventional longest path based compactions. Preconstrained compaction can be constructed by combining a longest path algorithm with forward and backward slack processes and a preconstraint generation process. This contrasts with previously proposed approaches based on longest path algorithms followed by iterative improvement processes, which include applications of linear programming. The layout styles in those approaches are usually limited to a model where fixed-shaped rectilinear blocks are moved so as to minimize the total length of rectilinear interconnections among the blocks. However, preconstrained compaction can be applied to reshaping polygonal patterns such as diffusion and channel areas. Thus, this compaction method makes it possible to reuse CMOS leaf and macro cell layouts even if design rules change. The proposed preconstrained compaction approach has been applied to direct design-rule conversion from 0.8-μm to 0.5-μm rules of CMOS layouts containing from several to 10,195 transistors. Experimental results demonstrate that a 10.6% reduction in diffusion areas can be achieved without unnecessary extensions of polysilicon wires with a 39% increase in processing times compared with conventional approaches.
- 社団法人電子情報通信学会の論文
- 1994-10-25
著者
関連論文
- 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