会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Physical design automation system and process for designing integrated
circuit chip using
    • 物理设计自动化系统和使用“棋盘”和“抖动”优化设计集成电路芯片的过程
    • US6038385A
    • 2000-03-14
    • US609397
    • 1996-03-01
    • Ranko ScepanovicJames S. KofordAlexander E. AndreevIvan Pavisic
    • Ranko ScepanovicJames S. KofordAlexander E. AndreevIvan Pavisic
    • G06F17/50
    • G06F17/5072
    • A cell placement for an integrated circuit chip is divided into two "chessboard" patterns or "jiggles". Each pattern resembles a chessboard in that it consists of alternating regions of different types or "colors" such that no region of a given color has an edge common with another region of the same color. The jiggles are offset relative to each other such that the regions of one jiggle partially overlap at least two regions of the other jiggle. A placement improvement operation such as simulated annealing is performed sequentially for each color of each jiggle. During each operation, a plurality of parallel processors operate on the regions simultaneously using a previous copy of the entire chip, with one processor being assigned to one or more regions. At the end of each operation, the copy of the chip is updated. The chessboard patterns eliminate unproductive cell moves resulting from adjacent regions having a common edge. The jiggles enable cells to move to their optimal positions from their initial region to any other region on the chip. The regions can have rectangular, triangular or hexagonal shapes.
    • 集成电路芯片的单元布局分为两个“棋盘”图案或“跳棋”。 每个图案类似于棋盘,其由不同类型或“颜色”的交替区域组成,使得给定颜色的区域不具有与相同颜色的另一区域相同的边缘。 跳块相对于彼此偏移,使得一个颤动的区域部分地与另一个摇摆的至少两个区域重叠。 针对每个抖动的每个颜色顺序地执行诸如模拟退火的放置改善操作。 在每个操作期间,多个并行处理器使用整个芯片的先前副本同时在该区域上操作,一个处理器被分配给一个或多个区域。 在每个操作结束时,更新芯片的副本。 棋盘图案消除由具有共同边缘的相邻区域产生的非生产性细胞移动。 这些跳跃使得电池从它们的初始区域移动到其最佳位置到芯片上的任何其它区域。 这些区域可以具有矩形,三角形或六边形形状。
    • 5. 发明授权
    • Advanced modular cell placement system
    • 先进的模块化放置系统
    • US5872718A
    • 1999-02-16
    • US672535
    • 1996-06-28
    • Ranko ScepanovicJames S. KofordAlexander E. Andreev
    • Ranko ScepanovicJames S. KofordAlexander E. Andreev
    • G06F17/50
    • G06F17/5072
    • A system for optimally locating cells on the surface of an integrated circuit chip is presented herein. The system comprises constructing a plurality of neighborhoods containing elements positionally related to one another; initially evaluating the lowest level of region hierarchy; iteratively developing a logical one-dimensional preplacement of elements on said surface; performing an affinity driven discrete preplacement optimization; evaluating whether a highest level of regional hierarchy has been attained; iteratively performing a dispersion driven spring system to levelize cell density and an unconstrained sinusoidal optimization; executing a density levelizing procedure; iteratively optimizing while controlling element densities; removing element overlap; iteratively optimizing for desired spacing between elements, adjusting element spacing, and permuting elements; locating elements on grid lines; and iteratively performing a functional sieve crystallization.
    • 本文提供了用于在集成电路芯片的表面上最佳地定位单元的系统。 该系统包括构成包含彼此位置相关的元素的多个邻域; 初步评估区域层次的最低水平; 迭代地开发所述表面上的元件的逻辑一维预置位; 执行亲和力驱动的离散预置位优化; 评估是否实现了最高层次的区域层级; 迭代地执行色散驱动弹簧系统来平衡细胞密度和无约束正弦优化; 执行密度调整程序; 迭代优化,同时控制元件密度; 去除元件重叠; 迭代地优化元件之间的期望间隔,调整元件间距和排列元件; 在网格线上定位元素; 并迭代进行功能筛结晶。
    • 6. 发明授权
    • Advanced modular cell placement system with neighborhood system driven
optimization
    • 具有邻域系统驱动优化的高级模块化放置系统
    • US5812740A
    • 1998-09-22
    • US674605
    • 1996-06-28
    • Ranko ScepanovicJames S. KofordAlexander E. Andreev
    • Ranko ScepanovicJames S. KofordAlexander E. Andreev
    • G06F17/50G06F15/00
    • G06F17/5072Y10S706/921
    • A system for computing an affinity for relocating a cell on a surface of a semiconductor chip is disclosed herein. The cell is located within a region and belongs to a net of cells. The system initially computes a weight associated with all cells in the net. The sytem then sums the weights of all cells in the net containing the cell for all cells located inside the region and at positions greater than and less than edges of the region and computes the affinity for moving the cell to points on the surface greater than, equal to, and less than the current position of the cell based on the weight sums from said summing function. The computing function further comprises combining the affinities determined based on weight sums with other affinities. The summing function further comprises computing a relationship between the amount of rows and columns of regions on the semiconductor chip surface, and the affinity computation function comprises combining the relationship with the weight sums.
    • 本文公开了一种用于计算在半导体芯片的表面上重新定位单元的亲和度的系统。 细胞位于一个区域内,属于细胞网。 系统最初计算与网中所有单元相关联的权重。 系统然后将位于该区域内部以及大于和小于该区域边缘的位置的所有单元格的网格中包含单元格的所有单元格的权重相加,并计算将单元格移动到表面上的点的亲和力大于, 基于来自所述求和函数的权重和,等于并小于小区的当前位置。 计算功能还包括将基于权重和确定的亲和力与其他亲和度组合。 求和功能还包括计算半导体芯片表面上的行数和列数之间的关系,并且亲和度计算功能包括将关系与权重和组合。
    • 9. 发明授权
    • Advanced modular cell placement system
    • 先进的模块化放置系统
    • US6067409A
    • 2000-05-23
    • US798598
    • 1997-02-11
    • Ranko ScepanovicIvan PavisicJames S. KofordAlexander E. AndreevEdwin Jones
    • Ranko ScepanovicIvan PavisicJames S. KofordAlexander E. AndreevEdwin Jones
    • G06F17/50
    • G06F17/5072
    • A system for determining an affinity associated with relocating a cell located on a surface of a semiconductor chip to a different location on the surface is disclosed herein. Each cell may be part of a cell net containing multiple cells. The system initially defines a bounding box containing all cells in the net which contains the cell. The system then establishes a penalty vector based on the bounding box and borders of a region containing the cell, computes a normalized sum of penalties for all nets having the cell as a member, and calculates the affinity based on the normalized sum of penalties. Also included in the disclosed system are methods and apparatus for capacity and utilization planning of the use of the floor, or the surface area, and the methods and apparatus for parallelizing the process of affinity based placements using multiple processors. Finally, method and apparatus for connecting the cells based on a Steiner Tree method is disclosed.
    • 本文公开了一种用于确定与将位于半导体芯片的表面上的单元重新定位到表面上的不同位置的亲和度的系统。 每个细胞可以是包含多个细胞的细胞网的一部分。 系统最初定义了包含网络中包含单元格的所有单元格的边界框。 然后,该系统基于边界框和包含单元格的区域的边界来建立惩罚向量,计算具有该单元作为成员的所有网络的归一化惩罚总和,并且基于标准化的惩罚总和来计算亲和度。 所公开的系统中还包括用于使用楼层或表面积的容量和利用规划的方法和装置,以及用于使用多个处理器并行化基于亲和力的布置的过程的方法和装置。 最后,公开了基于Steiner Tree方法连接单元的方法和装置。
    • 10. 发明授权
    • Advanced modular cell placement system with overlap remover with minimal
noise
    • 先进的模块化放置系统,具有重叠移除,噪音最小
    • US6026223A
    • 2000-02-15
    • US672937
    • 1996-06-28
    • Ranko ScepanovicJames S. KofordAlexander E. Andreev
    • Ranko ScepanovicJames S. KofordAlexander E. Andreev
    • G06F17/50
    • G06F17/5072
    • A method for refining the position of linearly aligned cells on the surface of a semiconductor chip is disclosed herein. The method comprises defining an array of spaces between cells based on maximum and minimum cell positions, establishing a minimum spacing between cells, and linearly shifting cells in a predetermined manner such that no cells are closer to one another than the minimum spacing between cells. Linear shifting is accomplished by shifting any cell in a positive direction if the spacing associated the cell is less than the minimum spacing between cells; shifting any cell in a negative direction if the spacing associated with the cell is greater than the minimum spacing between cells, but only if all cells on the negative side of the cell have been shifted in their maximum negative direction; and performing positive shifting and negative shifting until all cells have been shifted such that no space between cells is less than the negative space between cells.
    • 本文公开了一种用于精细化半导体芯片表面上线性对准单元的位置的方法。 该方法包括基于最大和最小单元位置来定义单元之间的空间阵列,建立单元之间的最小间隔,并以预定方式线性移位单元,使得没有单元彼此比单元之间的最小间隔更接近。 如果与单元相关联的间隔小于单元之间的最小间距,则通过沿正方向移动任何单元来实现线性移位; 如果与单元相关联的间隔大于单元之间的最小间隔,则只有当单元的负侧上的所有单元已经在其最大负方向上移位时,才使负载方向上的任何单元移动; 并且执行正移位和负移位,直到所有单元已被移位,使得单元之间的空间不小于单元之间的负空间。