首页> 外文OA文献 >Optimal cutting directions and rectangle orientation algorithm
【2h】

Optimal cutting directions and rectangle orientation algorithm

机译:最优切削方向和矩形方向算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The first stage in hierarchical approaches to Floorplan Design defines topological relations between components that intend to optimize a given objective in a circuit board. These relations determine a placement that is subsequently optimized in order to minimize a cost measurement (that will probably be one between chip area or perimeter). The board optimization gives rise to multiple subproblems that need to be answered in order to obtain a good solution. Among the most relevant ones we find the problem of defining the optimal orientation of cells and the definition of the optimal cutting sequence that minimize the placement board area. We will present a generalization of an algorithm due to Stockmeyer so that it obtains a solution that not only defines the optimal cell orientation but also the slicing cuts sequence that will lead to this optimal orientation and overall area minimization.
机译:平面图设计的分层方法的第一阶段定义了旨在优化电路板上给定目标的组件之间的拓扑关系。这些关系确定了一个布局,该布局随后进行了优化以最小化成本测量(可能是芯片面积或周长之间的一个)。电路板的优化产生了多个子问题,需要解决这些子问题才能获得良好的解决方案。在最相关的问题中,我们发现了定义单元的最佳方向和定义最佳切割顺序(最小化放置板面积)的问题。我们将对归因于Stockmeyer的算法进行概括,以使其获得不仅定义最佳像元定向的解决方案,而且还获得导致最佳定向和总面积最小化的切片序列。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号