会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Timing-driven placement method utilizing novel interconnect delay model
    • 利用新型互连延迟模型的定时驱动放置方法
    • US06901571B1
    • 2005-05-31
    • US09010396
    • 1998-01-21
    • Dusan PetranovicRanko ScepanovicIvan Pavisic
    • Dusan PetranovicRanko ScepanovicIvan Pavisic
    • G06F17/50
    • G06F17/5072
    • A method for optimal placement of cells on a surface of an integrated circuit, comprising the steps of comparing a placement of cells to predetermined cost criteria and moving cells to alternate locations on the surface if necessary to satisfy the cost criteria. The cost criteria include a timing criterion based upon interconnect delay, where interconnect delay is modeled as a RC tree expressed as a function of pin-to-pin distance. The method accounts for driver to sink interconnect delay at the placement level, a novel aspect resulting from use of the RC tree model, which maximally utilizes available net information to produce an optimal timing estimate. Preferred versions utilize a RC tree interconnect delay model that is consistent with timing models used at design levels above placement, such as synthesis, and below placement, such as routing. Additionally, preferred versions can utilize either a constructive placement or iterative improvement placement method.
    • 一种用于在集成电路的表面上最佳地放置单元的方法,包括以下步骤:如果需要满足成本标准,将单元的布局与预定成本标准进行比较并将单元移动到表面上的替代位置。 成本标准包括基于互连延迟的定时标准,其中互连延迟被建模为作为针对针距离的函数的RC树。 该方法考虑了驱动程序以在布局级别中接收互连延迟,这是由使用RC树模型产生的新颖的方面,其最大限度地利用可用的网络信息来产生最佳的时序估计。 首选版本使用RC树互连延迟模型,其与在布局之上的设计级别(例如合成)以及在布局之下(例如路由)使用的定时模型一致。 另外,优选版本可以利用建设性位置或迭代改进放置方法。
    • 8. 发明授权
    • 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.
    • 集成电路芯片的单元布局分为两个“棋盘”图案或“跳棋”。 每个图案类似于棋盘,其由不同类型或“颜色”的交替区域组成,使得给定颜色的区域不具有与相同颜色的另一区域相同的边缘。 跳块相对于彼此偏移,使得一个颤动的区域部分地与另一个摇摆的至少两个区域重叠。 针对每个抖动的每个颜色顺序地执行诸如模拟退火的放置改善操作。 在每个操作期间,多个并行处理器使用整个芯片的先前副本同时在该区域上操作,一个处理器被分配给一个或多个区域。 在每个操作结束时,更新芯片的副本。 棋盘图案消除由具有共同边缘的相邻区域产生的非生产性细胞移动。 这些跳跃使得电池从它们的初始区域移动到其最佳位置到芯片上的任何其它区域。 这些区域可以具有矩形,三角形或六边形形状。
    • 9. 发明授权
    • Modifying timing graph to avoid given set of paths
    • 修改时序图以避免给定的路径集
    • US06292924B1
    • 2001-09-18
    • US08964997
    • 1997-11-05
    • Ivan PavisicAnatoli A. BolotovAlexander E. AndreevRanko Scepanovic
    • Ivan PavisicAnatoli A. BolotovAlexander E. AndreevRanko Scepanovic
    • G06F1750
    • G06F17/5031
    • Integrated circuit chips (IC's) require proper placement of many cells (groups of circuit components) and complex routing of wires to connect the pins of the cells. Designing of the IC's require meeting real-world constraints such as minimization of the circuit area, minimization of wire length within the circuit, and minimization of the time the IC requires to perform its function, referred to as the IC delay. In order to design circuits to meet a given set of requirements, each signal path of the circuit must be analyzed. Because of the large number of the cells and the complex connections, the number of paths is very large and requires much computing power to analyze. Also, some of the paths are not important for the purposes of the operations of the chip and can be discounted during the analysis process. The present invention discloses a method and apparatus used to avoid analyzing non-important paths, referred to as false paths of a directed timing graph. To avoid the false paths, the timing graph representing the circuit is modified to exclude the false paths before the graph is analyzed. To modify the timing graph, duplicate nodes are constructed, duplicate edges are constructed, and some edges of the original graph are cut and replaced by mixed edges connecting non-duplicate nodes to duplicate nodes. Finally, mixed edges are created to connect duplicate nodes to non-duplicate nodes, integrating the duplicate graph with the original graph.
    • 集成电路芯片(IC)需要适当放置许多单元(电路组件组)和复杂的导线布线以连接单元的引脚。 IC的设计需要满足实际的限制,例如最小化电路面积,最小化电路内的电线长度,以及使IC执行其功能所需的时间最小化,称为IC延迟。 为了设计电路以满足给定的一组要求,必须分析电路的每个信号路径。 由于大量的单元和复杂的连接,路径数量非常多,需要很多计算能力进行分析。 此外,一些路径对于芯片的操作的目的不重要,并且可以在分析过程期间被折扣。 本发明公开了一种用于避免分析非重要路径的方法和装置,被称为定向定时图的假路径。 为了避免错误路径,修改表示电路的时序图,以排除图表分析之前的虚假路径。 为了修改时序图,构造了重复的节点,构建了重复的边,原始图的一些边被剪切,并将不重复的节点连接到重复节点的混合边替换。 最后,创建混合边以将重复节点连接到非重复节点,将重复图与原始图集成。
    • 10. 发明授权
    • Method and apparatus for congestion removal
    • 阻塞消除的方法和装置
    • US6068662A
    • 2000-05-30
    • US906945
    • 1997-08-06
    • Ranko ScepanovicAlexander E. AndreevIvan Pavisic
    • Ranko ScepanovicAlexander E. AndreevIvan Pavisic
    • G06F17/50G06F19/00
    • G06F17/5072
    • Integrated circuit chips (IC's) require proper placement of many cells (groups of circuit components) and complex routing of wires to connect the pins of the cells. Because of the large number of the cells and the complex connections required, it is essential that placement of the cell and the wire routine be done correctly to avoid any congestion of wires. The present invention discloses method and apparatus to reduce or to eliminate cell placement and wire routing congestion. The congestion reduction is achieved by first examining regions of the IC to determine whether horizontal or vertical congestion exists. If horizontal congestion exists, then the cells are moved, within the columns, vertically to give more room for the cells and in between the cells for the routing of the wires. If vertical congestion exists, then the cells are moved to different columns to alleviate congestion. The present invention discloses techniques of determining horizontal and vertical congestion and the techniques for moving the cells. The movement of the cells to other columns may create overlapping of the cells or overloading of the columns. The present invention also discloses the methods to resolve the overlapping and overloading problems.
    • 集成电路芯片(IC)需要适当放置许多单元(电路组件组)和复杂的导线布线以连接单元的引脚。 由于需要大量的单元和复杂的连接,所以必须正确地进行单元和电线程序的布置,以避免导线堵塞。 本发明公开了减少或消除小区布置和布线拥塞的方法和装置。 通过首先检查IC的区域以确定是否存在水平或垂直拥塞来实现拥塞减少。 如果存在水平拥堵,那么单元在列内垂直移动,为单元格提供更多的空间,并且在单元之间用于导线的布线。 如果存在垂直拥塞,则将小区移动到不同的列以减轻拥塞。 本发明公开了确定水平和垂直拥塞的技术以及移动小区的技术。 细胞到其他柱的运动可能造成细胞重叠或柱的重载。 本发明还公开了解决重叠和重载问题的方法。