会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Efficient iterative, gridless, cost-based fine router for computer controlled integrated circuit design
    • 高效的迭代,无栅格,基于成本的精细路由器,用于计算机控制的集成电路设计
    • US06324675B1
    • 2001-11-27
    • US09215467
    • 1998-12-18
    • Robi DuttaRavi RaoAshok Vittal
    • Robi DuttaRavi RaoAshok Vittal
    • G04F1760
    • G06F17/5077
    • An efficient iterative, gridless, cost-based router for a computer controlled integrated circuit design. The fine routing process is used during the wire routing phase of an integrated circuit design and fabrication process. During the wire routing process, wires are routed between pins of nets. The routing process of the present invention is gridless and utilizes lanes that are defined based on the boundaries of objects. The cost-based router computes a cost for each wire path, and the cost is based on: (1) the manhattan wire distance: (2) the layers in which the wire runs; and (3) any overlap the wire has with soft obstacles (e.g., other wires, etc.); and (4) an estimated cost to the target. Cost computation is reduced by considering only obstacles within the layer in which a lane is run. The number of paths determined for a wire route is reduced by pruning possible paths based on the placement of obstacles within the integrated circuit. Further pruning is performed by picking the lowest cost child lane in cases when several lanes select the same lane. Paths are also pruned by stopping along any path whose work-in-progress cost estimation exceeds the final cost of a path already discovered. In multi-pin nets, the routing process selects that path (of equal cost paths) between a source pin and a target pin that also runs closer to another unconnected pin of the multi-pin net. When a source-target wire route is performed for a multi-pin net, the unconnected pin is treated as the target and the source is considered as the source-target wire route.
    • 一种用于计算机控制集成电路设计的高效迭代,无栅格,基于成本的路由器。 在集成电路设计和制造过程的线路布线阶段期间使用精细布线过程。 在电线布线过程中,电线在网的引脚之间布线。 本发明的路由过程是无栅格的并且利用基于对象边界定义的车道。 基于成本的路由器计算每个线路的成本,成本基于:(1)曼哈顿线距:(2)线路运行的层; 和(3)电线与软障碍物(例如其他电线等)的任何重叠; 和(4)目标的估计成本。 通过仅考虑运行车道的层内的障碍物来降低成本计算。 通过基于集成电路内的障碍物的布置修剪可能的路径来减少为有线路由确定的路径数量。 在多条车道选择同一车道的情况下,通过选择最低成本的儿童车道进行进一步修剪。 通过停止在工作进行中的成本估算超过已经发现的路径的最终成本的任何路径也修剪路径。 在多引脚网络中,路由过程选择源引脚和目标引脚之间的路径(相同的成本路径),该引脚也越靠近多引脚网的另一个未连接的引脚。 当针对多针网络执行源目标线路时,将未连接的引脚视为目标,并将源视为源 - 目标线路。
    • 9. 发明申请
    • Capturing contacts via people near me
    • 通过我附近的人捕获联系
    • US20070008987A1
    • 2007-01-11
    • US11175951
    • 2005-07-06
    • Todd ManionSandeep SinghalRavi Rao
    • Todd ManionSandeep SinghalRavi Rao
    • H04J3/02
    • G06Q10/10H04L63/061H04L63/0823H04L67/104H04L67/24H04L67/36H04W12/06H04W84/18
    • Users on a peer-to-peer network, particularly a local subnet or ad hoc wireless network, may publish first contact information to a graph or data store on the network. The first contact information may include a certificate with a public-key and a user identification, such as a peer name. Other users may discover the first contact information and use the first contact information to request additional information from the user. Data in the first contact information may also be “promoted” by adding the information to a trusted contacts database, allowing the user additional privileges. The user publishing the first contact information may be given the opportunity to approve or deny the request for additional information.
    • 对等网络,特别是本地子网或自组织无线网络上的用户可以将第一联系人信息发布到网络上的图形或数据存储。 第一联系人信息可以包括具有公开密钥的证书和诸如对等体名称的用户标识。 其他用户可以发现第一联系人信息并使用第一联系人信息来请求来自用户的附加信息。 通过将信息添加到可信联系人数据库中,允许用户附加特权,也可以“提升”第一联系人信息中的数据。 可以给出发布第一联系人信息的用户批准或拒绝对附加信息的请求的机会。