会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 82. 发明申请
    • SYSTEM AND METHOD FOR STATISTICAL DESIGN RULE CHECKING
    • 统计设计规则检查系统与方法
    • WO2006127409A2
    • 2006-11-30
    • PCT/US2006/019305
    • 2006-05-19
    • CADENCE DESIGN SYSTEMS, INC.SCHEFFER, Louis K.
    • SCHEFFER, Louis K.
    • G06F17/50
    • G06F17/5081
    • Methods and systems for allowing an Integrated Circuit designer to specify one or more design rules, and to determine the expected probability of success of the IC design based on the design rules. Probability information is compiled for each circuit component, that specifies the probability of the circuit component working if a characteristic of the circuit component is varied. As the design rules are examined, the probability of each component working is calculated. The probabilities are combined to determine the overall probability of success for the IC design. Furthermore, the IC design may be broken into a plurality of portions, and design rules can be separately specified for each portion. This allows a designer the flexibility to use different design rules on different portions of the IC design.
    • 允许集成电路设计者指定一个或多个设计规则的方法和系统,并且基于设计规则确定IC设计成功的预期概率。 针对每个电路组件编制概率信息,其指定电路组件的特性如果变化时电路组件工作的概率。 随着设计规则的检验,每个部件工作的概率被计算出来。 将概率相结合以确定IC设计的成功概率。 此外,IC设计可以被分成多个部分,并且可以为每个部分分别指定设计规则。 这允许设计人员灵活地在IC设计的不同部分使用不同的设计规则。
    • 85. 发明申请
    • TWO-STAGE CLOCK TREE SYNTHESIS
    • 两阶段时钟合成
    • WO2004102630A2
    • 2004-11-25
    • PCT/US2004/014676
    • 2004-05-10
    • CADENCE DESIGN SYSTEMS, INC.
    • TSAO, Chung-wenTENG, Chin-Chi
    • H01L
    • G06F17/5045G06F1/10
    • A clock tree synthesis (CTS) tool determines how to position a hierarchy of buffers for fanning out a clock signal to clocked devices ("sinks") within an integrated circuit (IC). The tool first clusterizes the sinks and places a lowest level fan-out buffer near each cluster. The tool then iteratively places progressively higher level buffers by clusterizing a last-placed buffer level and then placing a next higher level buffer near the centroid of each lower level buffer cluster, until the tool has placed buffers at a mid-level for which variation in path distances between that level and a next higher buffer level exceeds a predetermined limit. The CTS tool then places a top level buffer at the centroid of the mid-level buffers, divides the layout into partitions, each containing a similar number of mid-level buffers, and then places a second-highest level buffer in each partition. The CTS iteratively places each next lower buffer level by dividing each partition into progressively smaller partitions and placing progressively lower level buffers in each smaller partition until it places buffers at a level having sufficient number of buffers to drive the mid-level buffers.
    • 时钟树合成(CTS)工具确定如何定位缓冲区的层次结构,以便将集成电路(IC)中的时钟信号扇出时钟设备(“sink”)。 该工具首先聚集接收器,并在每个集群附近放置最低级别的扇出缓冲区。 然后,该工具通过对最后放置的缓冲器级别进行聚类,然后在每个较低级缓冲区集群的质心附近放置下一个较高级别的缓冲区,直到工具将缓冲区放置在中间级别 该级别和下一个较高缓冲器级别之间的路径距离超过预定限制。 然后,CTS工具将中间缓冲区的质心放置一个顶级缓冲区,将布局划分为分区,每个分区包含相似数量的中间缓冲区,然后在每个分区中放置第二高级缓冲区。 CTS通过将每个分区划分为逐渐更小的分区并将逐级更低级缓冲区放置在每个较小的分区中,迭代地将每个下一个较低的缓冲区级别放置,直到它将缓冲区置于具有足够数量的缓冲区的级别来驱动中级缓冲区。
    • 88. 发明申请
    • METHOD, APPARATUS, AND SYSTEM FOR ROUTING
    • 方法,装置和路由系统
    • WO2004051403A2
    • 2004-06-17
    • PCT/US2003/036873
    • 2003-11-18
    • CADENCE DESIGN SYSTEMS, INC.FRANKLE, JonathanCALDWELL, AndrewJACQUES, EtienneTEIG, Steven
    • FRANKLE, JonathanCALDWELL, AndrewJACQUES, EtienneTEIG, Steven
    • G06F
    • G06F1/00G06F17/50
    • Some embodiments of the invention provide a method of identifying global routes for nets in a region of a layout with multiple layers. In the region, each net has a set of routable elements. The method partitions each layer of the region into several sub-regions. For each net, the method then identifies a route that connects the sub-regions that contain the net’s set of routable elements, where some routes have at least one non-Manhattan edge and traverse sub-regions on multiple layers. Some embodiments search for a three-dimensional global path between first and second sets of routable elements in a region of a layout that has multiple layers. These embodiments partition the region into several sub-regions. They then perform a path search to identify a path between a first set of sub-regions that contains the first-set elements and a second set of sub-regions that contain a second-set element. During the path search, these embodiments explore expansions along Manhattan and non-Manhattan routing directions between the sub-regions on a plurality of layers. Some embodiments define a routing graph that has several of nodes on several layers, where each node represents a sub-region on a layer. In the graph, there is a set of edges between the nodes on each layer. On one layer, there is at least one set of edges that are neither orthogonal nor parallel to a set of edges on another layer. These embodiments then use the routing graph to identify routes.
    • 本发明的一些实施例提供了一种识别具有多个层的布局的区域中的网络的全局路由的方法。 在该区域,每个网络具有一组可路由元素。 该方法将该区域的每个层分成几个子区域。 对于每个网络,该方法然后识别连接包含网络可路由元件集合的子区域的路由,其中​​一些路由具有至少一个非曼哈顿边缘并遍历多个层上的子区域。 一些实施例在具有多个层的布局的区域中搜索第一和第二组可路由元件之间的三维全局路径。 这些实施例将该区域划分成几个子区域。 然后,他们执行路径搜索以识别包含第一集合元素的第一组子区域和包含第二集合元素的第二组子区域之间的路径。 在路径搜索期间,这些实施例探索沿着曼哈顿的扩展和在多个层之间的子区域之间的非曼哈顿路由方向。 一些实施例定义了在几个层上具有几个节点的路由图,其中每个节点表示层上的子区域。 在图中,每层上的节点之间有一组边。 在一层上,至少有一组边缘既不正交也不平行于另一层上的一组边缘。 然后,这些实施例使用路由图来识别路由。