会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Logic difference synthesis
    • 逻辑差分合成
    • US08122400B2
    • 2012-02-21
    • US12497499
    • 2009-07-02
    • Jeremy T. HopkinsJohn M. IsaksonJoachim KeinertSmita KrishnaswamyNilesh A. ModiRuchir PuriHaoxing RenDavid L. Rude
    • Jeremy T. HopkinsJohn M. IsaksonJoachim KeinertSmita KrishnaswamyNilesh A. ModiRuchir PuriHaoxing RenDavid L. Rude
    • G06F17/50
    • G06F17/505
    • A computer executed method is disclosed which accepts an original circuit with an original logic, accepts a modified circuit, and synthesizes a difference circuit. The difference circuit represents changes that implement the modified circuit's logic for the original circuit. The synthesis may locate an output-side boundary in the original logic in such a manner that the original logic is free of logic changes in between the output-side boundary and the primary output elements of the original circuit. The disclosed synthesis may also locate an input-side boundary in the original logic in such a manner that the original logic is free of logic changes in between the input-side boundary and the primary input elements of the original circuit. A computer program products are also disclosed. The computer program product contains a computer useable medium having a computer readable program code embodied therein. The computer readable program code when executed on a computer causes the computer to carry out the methods of finding input and output side boundaries in an original logic, and synthesizing in between those boundaries a difference circuit representing logic changes.
    • 公开了一种用原始逻辑接收原始电路的计算机执行方法,接受修改的电路,并且合成差分电路。 差分电路表示实现原始电路的修改电路逻辑的变化。 合成可以将原始逻辑中的输出侧边界定位成使得原始逻辑在原始电路的输出侧边界和主要输出元件之间没有逻辑改变。 所公开的合成还可以将原始逻辑中的输入侧边界定位成使得原始逻辑在原始电路的输入侧边界和主要输入元件之间没有逻辑改变。 还公开了一种计算机程序产品。 计算机程序产品包含具有体现在其中的计算机可读程序代码的计算机可用介质。 计算机可读程序代码在计算机上执行时,使得计算机执行在原始逻辑中寻找输入和输出侧边界的方法,并且在这些边界之间合成表示逻辑的差异电路的变化。
    • 2. 发明申请
    • LOGIC DIFFERENCE SYNTHESIS
    • 逻辑差异综合
    • US20110004857A1
    • 2011-01-06
    • US12497499
    • 2009-07-02
    • Jeremy T. HopkinsJohn M. IsaksonJoachim KeinertSmita KrishnaswamyNilesh A. ModiRuchir PuriHaoxing RenDavid L. Rude
    • Jeremy T. HopkinsJohn M. IsaksonJoachim KeinertSmita KrishnaswamyNilesh A. ModiRuchir PuriHaoxing RenDavid L. Rude
    • G06F17/50
    • G06F17/505
    • A computer executed method is disclosed which accepts an original circuit with an original logic, accepts a modified circuit, and synthesizes a difference circuit. The difference circuit represents changes that implement the modified circuit's logic for the original circuit. The synthesis may locate an output-side boundary in the original logic in such a manner that the original logic is free of logic changes inbetween the output-side boundary and the primary output elements of the original circuit. The disclosed synthesis may also locate an input-side boundary in the original logic in such a manner that the original logic is free of logic changes inbetween the input-side boundary and the primary input elements of the original circuit. A computer program products are also disclosed. The computer program product contains a computer useable medium having a computer readable program code embodied therein. The computer readable program code when executed on a computer causes the computer to carry out the methods of finding input and output side boundaries in an original logic, and synthesizing inbetween those boundaries a difference circuit representing logic changes.
    • 公开了一种用原始逻辑接收原始电路的计算机执行方法,接受修改的电路,并且合成差分电路。 差分电路表示实现原始电路的修改电路逻辑的变化。 合成可以将原始逻辑中的输出侧边界定位成使得原始逻辑在原始电路的输出侧边界和初级输出元件之间没有逻辑改变。 所公开的合成还可以以原始逻辑在原始电路的输入侧边界和主要输入元件之间没有逻辑改变的方式将原始逻辑中的输入侧边界定位。 还公开了一种计算机程序产品。 计算机程序产品包含具有体现在其中的计算机可读程序代码的计算机可用介质。 计算机可读程序代码在计算机上执行时,使得计算机执行在原始逻辑中寻找输入和输出侧边界的方法,并且在这些边界之间合成表示逻辑变化的差分电路。
    • 4. 发明授权
    • Minterm tracing and reporting
    • Minterm跟踪和报告
    • US07979819B2
    • 2011-07-12
    • US12358793
    • 2009-01-23
    • Jeremy T. HopkinsThomas E. Rosser
    • Jeremy T. HopkinsThomas E. Rosser
    • G06F17/50
    • G06F17/505
    • Disclosed are a method, a system and a computer program product for determining and reporting minterms to aid in implementing an engineering change order (ECO). A Minterm Tracing and Reporting (MTR) utility, which executes on a computer system, receives two or more timing points of an optimized netlist, where one or more of the two or more timing points are received from one or more of a user, a memory medium, and/or a network. For example, a timing point is a primary input, a primary output, or a latch point. After receiving the two or more timing points of the optimized netlist, the MTR utility determines two or more minterms of the optimized netlist. In determining the minterms, from one timing point to a next timing point: a polarity at the timing point may be determined, and a forward trace from the timing point to the next timing point is performed to determine the two or more minterms of the optimized netlist. In the forward trace from the timing point to the next timing point, the MTR utility determines two or more logical cones and one or more intersections of the logical cones. The MTR utility reports (e.g., communicates) each of the determined minterms, the determined polarities, and the one or more intersections of logical cones to one or more of a computer-executable application, a network, a memory medium, and/or a display.
    • 公开了一种方法,系统和计算机程序产品,用于确定和报告子项以帮助实施工程变更单(ECO)。 在计算机系统上执行的Minterm跟踪和报告(MTR)实用程序接收优化网表的两个或更多个定时点,其中两个或多个定时点中的一个或多个从用户的一个或多个接收, 存储介质和/或网络。 例如,定时点是主输入,主输出或锁存点。 在接收到优化网表的两个或多个时间点之后,MTR实用程序确定优化网表的两个或更多个minterms。 在从一个定时点到下一个定时点的确定中,可以确定定时点处的极性,并且执行从定时点到下一定时点的前向跟踪,以确定优化的时间点的两个或更多个小区 网表。 在从定时点到下一定时点的前向跟踪中,MTR实用程序确定逻辑锥的两个或更多个逻辑锥和一个或多个交集。 MTR实用程序将计算机可执行应用程序,网络,存储介质和/或其中的一个或多个报告(例如,通信)所确定的最小值,所确定的极性以及逻辑锥的一个或多个交叉点 显示。
    • 5. 发明授权
    • Cone-aware spare cell placement using hypergraph connectivity analysis
    • 使用超图连接性分析的锥形识别备用单元布局
    • US08234612B2
    • 2012-07-31
    • US12862949
    • 2010-08-25
    • Benjiman L. GoodmanNathaniel D. HieterJeremy T. HopkinsSamuel I. Ward
    • Benjiman L. GoodmanNathaniel D. HieterJeremy T. HopkinsSamuel I. Ward
    • G06F17/50
    • G06F17/5072G06F2217/02G06F2217/72
    • Spare cells are placed in an IC design by assigning different spare utilization rates to logic cones, applying the rates to corresponding spare cell regions surrounding cells in the cones, identifying any overlap of regions from different logic cones, and inserting a spare cell at the overlapping region having the highest spare utilization rate. The best location for the spare cell is computed using a hypergraph wherein the cells are edges and the regions are nodes. Any node that is dominated by another node is removed and its edge is extended to the dominating node. The spare cell is inserted in the region having the most edges (the edges can be weighted). The process is repeated iteratively, updating the hypergraph by removing nodes connected to spare cell location, and inserting the next spare cell at a region corresponding to the node which then has the greatest number of connected edges.
    • 通过向逻辑锥分配不同的备用利用率来将备用单元放置在IC设计中,将速率应用于圆锥体中的小区周围的相应备用单元区域,识别来自不同逻辑锥的区域的任何重叠,以及在重叠处插入备用单元 具有最高备用利用率的区域。 使用超图来计算备用单元的最佳位置,其中单元是边缘,并且区域是节点。 由另一个节点主导的任何节点被去除,其边缘被扩展到主导节点。 备用单元插入具有最多边缘的区域(边缘可以加权)。 该过程重复地重复,通过去除连接到备用单元位置的节点来更新超图,并且将下一个备用单元插入到与具有最大连接边数的节点相对应的区域。
    • 6. 发明授权
    • Decoupling capacitor insertion using hypergraph connectivity analysis
    • 使用超图连接分析去耦电容插入
    • US08479136B2
    • 2013-07-02
    • US13099767
    • 2011-05-03
    • Jeremy T. HopkinsDavid A. PapaSamuel I. Ward
    • Jeremy T. HopkinsDavid A. PapaSamuel I. Ward
    • G06F17/50
    • G06F17/5063G06F17/5072G06F2217/78
    • Decoupling capacitors (dcaps) are placed in an IC design by assigning different dcap utilization rates to logic cones, applying the rates to corresponding dcap regions surrounding cells in the cones, identifying any overlap of regions from different logic cones, and inserting a dcap at the overlapping region having the highest dcap utilization rate. The best location for the dcap is computed using a hypergraph wherein the cells are edges and the regions are nodes. Any node that is dominated by another node is removed and its edge is extended to the dominating node. The dcap is inserted in the region having the most edges (the edges can be weighted). The process is repeated iteratively, updating the hypergraph by removing nodes connected to dcap location, and inserting the next dcap at a region corresponding to the node which then has the greatest number of connected edges.
    • 将去耦电容(dcaps)放置在IC设计中,通过将不同的dcap利用率分配给逻辑锥,将速率应用于锥体中的细胞周围的相应dcap区域,识别来自不同逻辑锥的区域的任何重叠,以及将dcap插入到 重叠区域具有最高的dcap利用率。 使用超图来计算dcap的最佳位置,其中单元格是边缘,并且区域是节点。 由另一个节点主导的任何节点被去除,其边缘被扩展到主导节点。 将dcap插入具有最多边缘的区域(边缘可以加权)。 该过程重复地重复,通过去除连接到dcap位置的节点来更新超图,并将下一个dcap插入到与具有最大连接边数的节点对应的区域。
    • 7. 发明申请
    • STABILITY-DEPENDENT SPARE CELL INSERTION
    • 稳定性依赖的备用电池插入
    • US20120066654A1
    • 2012-03-15
    • US12879516
    • 2010-09-10
    • Jeremy T. HopkinsJulie A. RosserSamuel I. Ward
    • Jeremy T. HopkinsJulie A. RosserSamuel I. Ward
    • G06F17/50
    • G06F17/505G06F17/5072G06F2217/02G06F2217/72
    • Spare cells are placed in an IC design using stability values associated with logic cones of the design. A desired spare cell utilization rate is assigned to a cone based on its stability value, and an actual spare cell utilization rate for the cone bounding box is calculated. If the actual utilization rate is less than the desired utilization rate, additional spare cells are inserted as needed to attain the desired utilization rate. The stability value is provided by a logic or circuit designer, or derived from historical information regarding the logic cone in a previous design iteration. Spare cells are placed for each logic cone in the design until a global spare cell utilization target is exceeded. The spare cell placement method can be an integrated part of a placement directed synthesis which is followed by early mode padding and design routing.
    • 使用与设计的逻辑锥相关联的稳定性值将备用电池放置在IC设计中。 基于其稳定性值将期望的备用小区利用率分配给锥,并且计算锥形边界框的实际备用小区利用率。 如果实际使用率小于期望的利用率,则根据需要插入额外的备用单元以获得期望的利用率。 稳定性值由逻辑或电路设计者提供,或从先前设计迭代中关于逻辑锥的历史信息导出。 在设计中为每个逻辑锥放置备用单元,直到超过全局备用单元利用目标。 备用单元放置方法可以是放置定向合成的集成部分,其后是早期模式填充和设计路由。
    • 9. 发明申请
    • DECOUPLING CAPACITOR INSERTION USING HYPERGRAPH CONNECTIVITY ANALYSIS
    • 使用HYPERGRAPH连接分析解耦电容器插入
    • US20120284676A1
    • 2012-11-08
    • US13099767
    • 2011-05-03
    • Jeremy T. HopkinsSamuel I. WardDavid A. Papa
    • Jeremy T. HopkinsSamuel I. WardDavid A. Papa
    • G06F17/50
    • G06F17/5063G06F17/5072G06F2217/78
    • Decoupling capacitors (dcaps) are placed in an IC design by assigning different dcap utilization rates to logic cones, applying the rates to corresponding dcap regions surrounding cells in the cones, identifying any overlap of regions from different logic cones, and inserting a dcap at the overlapping region having the highest dcap utilization rate. The best location for the dcap is computed using a hypergraph wherein the cells are edges and the regions are nodes. Any node that is dominated by another node is removed and its edge is extended to the dominating node. The dcap is inserted in the region having the most edges (the edges can be weighted). The process is repeated iteratively, updating the hypergraph by removing nodes connected to dcap location, and inserting the next dcap at a region corresponding to the node which then has the greatest number of connected edges.
    • 将去耦电容(dcaps)放置在IC设计中,通过将不同的dcap利用率分配给逻辑锥,将速率应用于锥体中的细胞周围的相应dcap区域,识别来自不同逻辑锥的区域的任何重叠,以及将dcap插入到 重叠区域具有最高的dcap利用率。 使用超图来计算dcap的最佳位置,其中单元格是边缘,并且区域是节点。 由另一个节点主导的任何节点被去除,其边缘被扩展到主导节点。 将dcap插入具有最多边缘的区域(边缘可以加权)。 该过程重复地重复,通过去除连接到dcap位置的节点来更新超图,并将下一个dcap插入到与具有最大连接边数的节点对应的区域。
    • 10. 发明授权
    • Stability-dependent spare cell insertion
    • 稳定性依赖的备用电池插入
    • US08266566B2
    • 2012-09-11
    • US12879516
    • 2010-09-10
    • Jeremy T. HopkinsJulie A. RosserSamuel I. Ward
    • Jeremy T. HopkinsJulie A. RosserSamuel I. Ward
    • G06F9/455G06F17/50G06F15/04
    • G06F17/505G06F17/5072G06F2217/02G06F2217/72
    • Spare cells are placed in an IC design using stability values associated with logic cones of the design. A desired spare cell utilization rate is assigned to a cone based on its stability value, and an actual spare cell utilization rate for the cone bounding box is calculated. If the actual utilization rate is less than the desired utilization rate, additional spare cells are inserted as needed to attain the desired utilization rate. The stability value is provided by a logic or circuit designer, or derived from historical information regarding the logic cone in a previous design iteration. Spare cells are placed for each logic cone in the design until a global spare cell utilization target is exceeded. The spare cell placement method can be an integrated part of a placement directed synthesis which is followed by early mode padding and design routing.
    • 使用与设计的逻辑锥相关联的稳定性值将备用电池放置在IC设计中。 基于其稳定性值将期望的备用小区利用率分配给锥,并且计算锥形边界框的实际备用小区利用率。 如果实际使用率小于期望的利用率,则根据需要插入额外的备用单元以获得期望的利用率。 稳定性值由逻辑或电路设计者提供,或从先前设计迭代中关于逻辑锥的历史信息导出。 在设计中为每个逻辑锥放置备用单元,直到超过全局备用单元利用目标。 备用单元放置方法可以是放置定向合成的集成部分,其后是早期模式填充和设计路由。