会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • V-SHAPED MULTILEVEL FULL-CHIP GRIDLESS ROUTING
    • V形多路全芯片无线路由器
    • US20070256045A1
    • 2007-11-01
    • US11681859
    • 2007-03-05
    • Shyh-Chang LinTai-Chen ChenYao-Wen ChangFeng-Yuan Chang
    • Shyh-Chang LinTai-Chen ChenYao-Wen ChangFeng-Yuan Chang
    • G06F17/50
    • G06F17/5077
    • A router selects routes for nets interconnecting terminals of circuit devices within an area of an IC. The router organizes the IC area into an array of global routing cells (GRCs) and generates a congestion map providing a separate congestion factor for each GRC boundary that is a probabilistic measure of an estimated percentage of a capacity of the GRC boundary that will be occupied by nets when all nets have been routed. The router then iteratively partitions the IC area into progressively smaller tiles until the tiles reach a predetermined minimum size. Between partitioning iterations, the router selects a route for each net passing between tiles when possible to do so without altering any previously routed net. The router thereafter iteratively merges the tiles into progressively larger tiles. Between merging iterations, the router selects a route for each previously unrouted net residing wholly within a single tile, altering routes of previously routed nets when necessary to accommodate the selected route. When selecting a route for any connection of a net, the router seeks to minimize a cost function of congestion factors of all GRC boundaries and then modifies the congestion map to reflect changes in routing probabilities occasioned by the route selection before choosing a route for any other connection.
    • 路由器选择IC内的电路设备的互连终端的网络路由。 路由器将IC区域组织成全局路由信元(GRC)阵列,并生成拥塞映射,为每个GRC边界提供单独的拥塞因子,这是对将被占用的GRC边界的容量的估计百分比的概率测量 当所有的网络都被路由时,通过网络。 然后路由器将IC区域迭代地分割成逐渐变小的瓦片,直到瓦片达到预定的最小尺寸。 在分区迭代之间,路由器为可能的每个网络选择一个路由,以便在不改变任何先前路由的网络的情况下进行。 之后路由器迭代地将瓦片合并成逐渐变大的瓦片。 在合并迭代之间,路由器选择一个完全位于单个瓦片内的每个先前未被路由的网络的路由,在必要时更改先前路由网络的路由以适应所选择的路由。 当选择网络的任何连接的路由时,路由器寻求将所有GRC边界的拥塞因素的成本函数最小化,然后修改拥塞映射以反映路由选择引起的路由概率的变化,然后选择任何其他路由 连接。
    • 2. 发明授权
    • V-shaped multilevel full-chip gridless routing
    • V形多层全芯片无格栅路由
    • US07707536B2
    • 2010-04-27
    • US11681859
    • 2007-03-05
    • Shyh-Chang LinTai-Chen ChenYao-Wen ChangFeng-Yuan Chang
    • Shyh-Chang LinTai-Chen ChenYao-Wen ChangFeng-Yuan Chang
    • G06F17/50
    • G06F17/5077
    • A router organizes an IC area into an array of global routing cells (GRCs) and generates a congestion map providing a separate congestion factor for each GRC boundary. The router then iteratively partitions the IC area into progressively smaller tiles while selecting a route for each net passing between tiles when possible without altering any previously routed net. The router thereafter iteratively merges the tiles into progressively larger tiles while selecting a route for each previously unrouted net residing wholly within a single tile, altering routes of previously routed nets when necessary to accommodate the selected route. When selecting each route for any connection of a net, the router seeks to minimize a cost function of congestion factors of all GRC boundaries.
    • 路由器将IC区域组织成全局路由信元(GRC)阵列,并产生拥塞映射,为每个GRC边界提供单独的拥塞因子。 然后路由器然后迭代地将IC区域分割成逐渐变小的瓦片,同时在可能的情况下为每个网络之间传递每个网络的路由而不改变任何先前路由的网络。 然后,路由器将块逐次合并为逐渐变大的瓦片,同时为完全在单个瓦片内的每个先前未被路由的网络选择路由,在必要时改变先前路由网络的路由以适应所选择的路由。 当选择网络的任何连接的每个路由时,路由器寻求最小化所有GRC边界的拥塞因素的成本函数。