会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明申请
    • CLONED AND ORIGINAL CIRCUIT SHAPE MERGING
    • 克隆和原始电路形状合并
    • US20050160390A1
    • 2005-07-21
    • US10707845
    • 2004-01-16
    • Henry BongesMichael GrayJason HibbelerKevin McCullenRobert Walker
    • Henry BongesMichael GrayJason HibbelerKevin McCullenRobert Walker
    • G06F17/50
    • G06F17/5068
    • A method, system and program product for merging cloned and original circuit shapes such that a union thereof does not include a notch. The invention determines, for a cell including an original circuit shape and at least one overlapping clone of the original circuit shape, whether each clone corner point of each overlapping clone is within a threshold distance of a corresponding original corner point of the original circuit shape; and generates, in the case that each clone corner point of each overlapping clone circuit shape is within a threshold distance, a union of each overlapping clone and the original circuit shape such that the union does not contain a notch. The union is generated using a point code that sets a new position for a union corner point to remove a notch based on the original shape's direction and the edge orientations previous to and next to the corner point.
    • 用于合并克隆和原始电路形状的方法,系统和程序产品,使得其联合不包括缺口。 本发明对于包括原始电路形状的单元和原始电路形状的至少一个重叠克隆来确定每个重叠克隆的每个克隆角点是否处于原始电路形状的相应原始角点的阈值距离内; 并且在每个重叠克隆电路形状的每个克隆角点处于阈值距离内的情况下,生成每个重叠克隆的结合和原始电路形状,使得联合不包含凹口。 联合是使用点代码生成的,该点代码为联合角点设置新位置,以根据原始形状的方向和角点之前和之后的边缘方向去除凹口。
    • 10. 发明申请
    • CIRCUIT AREA MINIMIZATION USING SCALING
    • 使用缩放的电路面积最小化
    • US20050125748A1
    • 2005-06-09
    • US10707287
    • 2003-12-03
    • Michael GrayKevin McCullenGustavo TellezRobert Walker
    • Michael GrayKevin McCullenGustavo TellezRobert Walker
    • G06F17/50H01L21/82
    • G06F17/5068
    • A method, system and program product that implements area minimization of a circuit design while respecting the explicit and implicit design constraints, in the form of ground rules and user intent. A longest path algorithm is used to generate a scaling factor. The scaling factor is used to reduce the size of the circuit design to the minimum legal size. The scaling may be followed by application of minpert analysis to correct any errors introduced by the scaling. The resulting design is shrunk (or expanded) with all elements shrinking (or growing) together by the same factor, and with the relative relationships of elements maintained. In addition, the invention is operational in the presence of a positive cycle, can be run with scaling that freezes the sizes of any structure or ground rule, and can be applied to technology migration.
    • 一种方法,系统和程序产品,其以基本规则和用户意图的形式实现电路设计的区域最小化,同时遵守显式和隐式设计约束。 最长路径算法用于生成比例因子。 缩放因子用于将电路设计的尺寸减小到最小法律尺寸。 缩放可能之后是应用minpert分析来校正由缩放引入的任何错误。 所产生的设计缩小(或扩展),所有元素都通过相同的因素一起缩减(或增长),并保持元素的相对关系。 此外,本发明在存在正循环的情况下是可操作的,可以用缩放来运行,其结冰或冻结规则的尺寸,并且可以应用于技术迁移。