首页> 美国政府科技报告 >Compact: Compaction of Hierarchial Chip Layouts Based on a Constraint Graph Method with Double-Sided Constraints
【24h】

Compact: Compaction of Hierarchial Chip Layouts Based on a Constraint Graph Method with Double-Sided Constraints

机译:紧凑:基于双边约束约束图法的层次芯片布局压缩

获取原文

摘要

The compaction program COMPACT used in interactive computer aided design of integrated circuit layouts is described. The compaction method is based on a constraint graph. Compaction is achieved in one or more subsequent steps by grouping the layout elements into features and then shifting these features together in horizontal or vertical direction. The nodes and edges of the graph represent the features and the constraints between the features. The compaction algorithm can handle one-sided and two-sided constraints. The two-sided constraints are resolved by backtracking. Constraints on the shift of layout elements which overlap each other are determined with a linear method. For determination of constraints of nonoverlapping elements, windowing and shadowing techniques are used to reduce computation time.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号