会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Memory-saving method and apparatus for partitioning high fanout nets
    • 用于分割高扇出网络的存储器保存方法和装置
    • US06154874A
    • 2000-11-28
    • US62219
    • 1998-04-17
    • Ranko ScepanovicAlexander E. AndreevPedja Raspopovic
    • Ranko ScepanovicAlexander E. AndreevPedja Raspopovic
    • G06F17/50
    • G06F17/5077
    • An object of the present invention is to provide for a method and apparatus to partition high fanout nets into smaller subnets. Said method includes the steps of identifying elementary pairs of pins in the net, each such elementary pair defining a line; eliminating lines such that a planar graph is formed; eliminating further lines such that a spanning tree is formed, said spanning tree connecting each pin in the net; identifying basic elements, each basic element forming a portion of said spanning tree; and constructing a connected cover for said net, said connected cover comprising a plurality of said basic elements. Said elementary pairs are identified by determining for each pin in said net a relative x-coordinate and a relative y-coordinate, constructing for each pin a combined binary coordinate as a function of the pin's relative x-coordinate and relative y-coordinate, ordering the pins in accordance with their respective combined binary coordinates, iteratively combining the pins until one pin remains, and iteratively expanding the pins.
    • 本发明的目的是提供一种将高扇出网分成较小子网的方法和装置。 所述方法包括以下步骤:识别网中的基本对引脚,每个这样的基本对定义一条线; 消除形成平面图形的线条; 消除形成生成树的更多的线,所述生成树连接网中的每个引脚; 识别基本元素,形成所述生成树的一部分的每个基本元素; 以及构建所述网的连接的盖,所述连接的盖包括多个所述基本元件。 通过确定所述网中的每个针的相对x坐标和相对的y坐标来识别所述基本对,所述相对的x坐标和相对的y坐标构成了作为销的相对x坐标和相对y坐标的函数的组合二进制坐标 根据它们各自组合的二进制坐标的引脚,迭代地组合引脚直到保持一个引脚,并且迭代地扩展引脚。
    • 4. 发明授权
    • Method and apparatus for hierarchical global routing descend
    • 分级全局路由下降的方法和装置
    • US06175950B1
    • 2001-01-16
    • US09062217
    • 1998-04-17
    • Ranko ScepanovicAlexander E. AndreevElyar E. GasanovPedja Raspopovic
    • Ranko ScepanovicAlexander E. AndreevElyar E. GasanovPedja Raspopovic
    • G06F1750
    • G06F17/5077
    • Net routing is optimized in an integrated circuit device by dividing an integrated circuit design with a first group of substantially parallel lines in a first direction and with a group of substantially parallel lines in a second direction, with the second direction being substantially perpendicular to the first direction. A first routing graph is formed with vertices corresponding to locations where lines in the first direction and lines in the second direction cross, and nets are globally routed as a function of the first routing graph. The integrated circuit design is further subdivided with a second group of substantially parallel lines in the first direction, and a second routing graph is formed with vertices corresponding to locations where lines in the first and second groups of substantially parallel lines in the first direction cross lines in the group of substantially parallel lines in the second direction. For a net globally routed using the first routing graph, a first local net is formed in a first fragment of the second routing graph, and the first local net is rerouted within the first fragment by computing edge penalty values for edges in the first fragment and rerouting the first local net as a function of the edge penalty values.
    • 通过将集成电路设计与第一方向上的第一组基本上平行的线分隔开并且在第二方向上与一组基本上平行的线分开,使得第二方向基本上垂直于第一方向 方向。 第一路由图形成为与第一方向上的线和第二方向上的线交叉的位置相对应的顶点,并且网络作为第一路由图的函数被全局路由。 集成电路设计在第一方向上被进一步细分为第二组基本上平行的线,并且第二路由图形成为与第一方向交叉线上的基本上平行的第一组和第二组中的线对应的顶点 在第二方向上基本平行的线组。 对于使用第一路由图全局路由的网络,在第二路由图的第一片段中形成第一本地网,并且通过计算第一片段中的边缘的边缘惩罚值,在第一片段内重新路由第一本地网, 作为边缘惩罚值的函数重新路由第一个本地网络。
    • 6. 发明授权
    • Method and apparatus for coarse global routing
    • 粗略全局路由的方法和装置
    • US06260183B1
    • 2001-07-10
    • US09062246
    • 1998-04-17
    • Pedja RaspopovicRanko ScepanovicAlexander E. Andreev
    • Pedja RaspopovicRanko ScepanovicAlexander E. Andreev
    • G06F1750
    • G06F17/5077
    • Nets are routed on an integrated circuit device by dividing a portion of the integrated circuit device into a first group of tiles. A first routing graph is then formed as a function of the first group of tiles and nets are routed as a function of the first routing graph. A new group of tiles is formed by dividing the tiles of the first group of tiles, a new routing graph is formed as a function of the new group of tiles, and nets are rerouted as a function of the new routing graph. The steps of the preceding sentence are then repeated and each time a new group of tiles is formed, the tiles are divided in a same first dimension, resulting in tiles have progressively smaller lengths in that first dimension, while the size of the tiles in a second dimension does not change.
    • 网络通过将集成电路设备的一部分划分成第一组瓦片而布线在集成电路设备上。 然后形成第一路由图作为第一组瓦片的函数,并且网络根据第一路由图被路由。 通过划分第一组瓦片的瓦片形成新的瓦片组,作为新的瓦片组的函数形成新的路线图,并且网络被重新路由为新路线图的函数。 然后重复前一句的步骤,并且每次形成新的瓦片组时,瓦片被划分成相同的第一维度,导致瓦片在该第一维度上具有逐渐更小的长度,而在一个 第二维不变。
    • 8. 发明授权
    • Method and apparatus for minimization of process defects while routing
    • 在路由时最小化过程缺陷的方法和装置
    • US06230306B1
    • 2001-05-08
    • US09062310
    • 1998-04-17
    • Pedja RaspopovicRanko ScepanovicAlexander E. Andreev
    • Pedja RaspopovicRanko ScepanovicAlexander E. Andreev
    • G06F1750
    • G06F17/5077
    • A method for optimizing the routing of nets in an integrated circuit device, said method comprising the steps of dividing an integrated circuit design with lines in a first direction and lines in a second direction, wherein said first direction is substantially orthogonal to said second direction, forming a routing graph with vertices corresponding to locations where lines in said first direction and lines in said second direction cross and edges connect vertices, for each edge in a plurality of edges in said routing graph, computing an individual edge occupancy value, for an edge in said plurality of edges, computing a penalty value as a function of the individual edge occupancy value of a different edge, and routing a net as a function of said penalty value.
    • 一种用于优化集成电路器件中网络布线的方法,所述方法包括以下步骤:将集成电路设计与沿第一方向的线和第二方向的线分开,其中所述第一方向基本上与所述第二方向正交, 形成具有对应于所述第一方向上的线和所述第二方向上的线交叉并且边缘连接顶点的位置的顶点的路线图,对于所述路线图中的多个边缘中的每个边缘,计算边缘的边缘占用值 在所述多个边缘中,计算作为不同边缘的各个边缘占用值的函数的惩罚值,并且将网络作为所述惩罚值的函数进行路由。
    • 9. 发明授权
    • Method and apparatus for parallel routing locking mechanism
    • 并行路由锁定机制的方法和装置
    • US06269469B1
    • 2001-07-31
    • US09062418
    • 1998-04-17
    • Ivan PavisicRanko ScepanovicPedja Raspopovic
    • Ivan PavisicRanko ScepanovicPedja Raspopovic
    • H03K17693
    • G06F17/5077
    • A method for implementing net routing for an integrated circuit design with parallel processors, said method comprising the steps of creating a character array, filling said character array with a first character, dividing a plurality of nets into groups, supplying a plurality of locks and assigning each said group its own individual lock, assigning for each net in said plurality of nets a position in the character array; and placing a second character in the position of a particular net in said character array when the net is operated on by a processor and replacing said second character with the first character after said operation is completed.
    • 一种用于实现具有并行处理器的集成电路设计的网络路由的方法,所述方法包括以下步骤:创建字符阵列,用第一字符填充所述字符阵列,将多个网络划分成组,提供多个锁定和分配 每个所述组别自己的个人锁定,为所述多个网络中的每个网络分配字符阵列中的位置; 以及当所述网络由处理器操作并且在所述操作完成之后用所述第一字符替换所述第二字符时,将第二字符放置在所述字符阵列中的特定网络的位置。