会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
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.
    • 公开了一种用原始逻辑接收原始电路的计算机执行方法,接受修改的电路,并且合成差分电路。 差分电路表示实现原始电路的修改电路逻辑的变化。 合成可以将原始逻辑中的输出侧边界定位成使得原始逻辑在原始电路的输出侧边界和初级输出元件之间没有逻辑改变。 所公开的合成还可以以原始逻辑在原始电路的输入侧边界和主要输入元件之间没有逻辑改变的方式将原始逻辑中的输入侧边界定位。 还公开了一种计算机程序产品。 计算机程序产品包含具有体现在其中的计算机可读程序代码的计算机可用介质。 计算机可读程序代码在计算机上执行时,使得计算机执行在原始逻辑中寻找输入和输出侧边界的方法,并且在这些边界之间合成表示逻辑变化的差分电路。
    • 3. 发明授权
    • Logic modification synthesis
    • 逻辑修改综合
    • US08365114B2
    • 2013-01-29
    • US12862838
    • 2010-08-25
    • Eli ArbelDavid GeigerVictor KravetsSmita KrishnaswamyRuchir PuriHaoxing Ren
    • Eli ArbelDavid GeigerVictor KravetsSmita KrishnaswamyRuchir PuriHaoxing Ren
    • G06F9/455G06F17/50
    • G06F17/505
    • Two circuits, an original and a modified, are being recognized, with the original circuit having a first logic and the modified circuit having a second logic. The second logic contains at least one desired logic change relative to the first logic. An equivalence line is detected in the original circuit such that the first and second logic are equivalent from the circuit inputs to the equivalence line. At least one point of change is located amongst the logic gates that are neighboring the equivalence line. The points of change are accepted as verified if an observability condition is fulfilled. The observability condition is checked within a Boolean Satisfiability (SAT) formulation. Substitute logic for the verified points of change is derived using SAT and Boolean equation solving techniques, in such manner that the first logic becomes equivalent to the second logic.
    • 正在识别两个电路,一个原始和一个修改的电路,原始电路具有第一逻辑,并且该修改的电路具有第二逻辑。 第二逻辑包含相对于第一逻辑的至少一个期望的逻辑变化。 在原始电路中检测到等效线,使得第一和第二逻辑等效于从电路输入到等价线。 至少一个变化点位于与等价线相邻的逻辑门之间。 如果可观察性条件得到满足,则可以接受更改点。 可观察性条件在布尔满足度(SAT)公式中进行检查。 通过使用SAT和布尔方程求解技术,使得第一逻辑变为等同于第二逻辑的方式,导出用于验证的变化点的替代逻辑。
    • 6. 发明申请
    • LOGIC MODIFICATION SYNTHESIS
    • 逻辑修改合成
    • US20120054698A1
    • 2012-03-01
    • US12862838
    • 2010-08-25
    • Eli ArbelDavid GeigerVictor KravetsSmita KrishnaswamyRuchir PuriHaoxing Ren
    • Eli ArbelDavid GeigerVictor KravetsSmita KrishnaswamyRuchir PuriHaoxing Ren
    • G06F17/50
    • G06F17/505
    • A computer-executed method is disclosed which recognizes two circuits, an original and a modified circuit, with the original circuit having a first logic and the modified circuit having a second logic. The second logic is obtained by converting a modified specification into a preliminary gate-level form. The second logic contains at least one desired logic change relative to the first logic in order to realize the modified specification. The method includes detecting an equivalence line in the original circuit, such that the first and second logic are equivalent from the circuit inputs to the equivalence line, and finding at least one point of change amongst the logic gates that are neighboring the equivalence line. Next, accepting the points of change as verified point of change if an observability condition is fulfilled, which means that for every input vector for which an output of the original and modified circuits differ, at least one logic value of the points of change propagate to that output of the original circuit. This observability condition is checked within a Boolean Satisfiability (SAT) formulation. The method also includes deriving a substitute logic for the verified points of change, using SAT techniques, and Boolean equation solving techniques which solve for a change function at each point of change, in such manner that the first logic in the original circuit becomes equivalent to the second logic, and thereby implements the changed specification.
    • 公开了一种计算机执行方法,其识别具有第一逻辑的原始电路的两个电路,原始电路和修改的电路,并且修改的电路具有第二逻辑。 通过将修改的规范转换成初级门级形式来获得第二逻辑。 第二逻辑包含相对于第一逻辑的至少一个期望的逻辑变化,以便实现修改的规范。 该方法包括检测原始电路中的等效线,使得第一和第二逻辑等效于从等效线路的电路输入,并找到与等价线相邻的逻辑门之间的至少一个变化点。 接下来,如果满足可观察性条件,则将变化点接受为经验证的变化点,这意味着对于原始和修正电路的输出不同的每个输入向量,改变点的至少一个逻辑值传播到 原始电路的输出。 在布尔满足度(SAT)公式中检查此可观察性条件。 该方法还包括使用SAT技术,以及在每个变化点解决变化函数的布尔方程求解技术,以使得原始电路中的第一逻辑等同于 第二个逻辑,从而实现改变的规范。
    • 7. 发明授权
    • Relative ordering circuit synthesis
    • 相对排序电路综合
    • US08756541B2
    • 2014-06-17
    • US13431368
    • 2012-03-27
    • Minsik ChoRuchir PuriHaoxing RenXiaoping TangHua XiangMatthew Mantell Ziegler
    • Minsik ChoRuchir PuriHaoxing RenXiaoping TangHua XiangMatthew Mantell Ziegler
    • G06F17/50
    • G06F17/5072G06F2217/06
    • Systems and methods for relative ordering circuit synthesis are provided herein. One aspect provides for generating at least one circuit design via at least one processor accessible by a computing device; wherein generating at least one circuit design comprises: generating at least one relative order structure based on at least one circuit design layout, the at least one relative order structure comprising at least one placement constraint associated with at least one circuit element; placing the at least one circuit element associated with the at least one placement constraint within a circuit design according to the at least one placement constraint; and placing circuit elements not associated with the at least one placement constraint within the circuit design. Other embodiments and aspects are also described herein.
    • 本文提供了相对排序电路合成的系统和方法。 一个方面提供了通过计算设备可访问的至少一个处理器生成至少一个电路设计; 其中产生至少一个电路设计包括:基于至少一个电路设计布局生成至少一个相对顺序结构,所述至少一个相对顺序结构包括与至少一个电路元件相关联的至少一个放置约束; 根据所述至少一个放置约束将与所述至少一个放置约束相关联的所述至少一个电路元件放置在电路设计内; 以及将不与所述至少一个放置约束相关联的电路元件放置在所述电路设计内。 本文还描述了其它实施例和方面。
    • 10. 发明授权
    • Network flow based module bottom surface metal pin assignment
    • 网络流量模块底面金属引脚分配
    • US08261226B1
    • 2012-09-04
    • US13187196
    • 2011-07-20
    • Wiren Dale BeckerRuchir PuriHaoxing RenHua XiangTingdong Zhou
    • Wiren Dale BeckerRuchir PuriHaoxing RenHua XiangTingdong Zhou
    • G06F17/50
    • G06F17/5077G06F2217/08
    • A scaled network flow graph is constructed, including a plurality of nodes and a plurality of edges. The plurality of nodes correspond to: (i) a pseudo device pin node for each pair of corresponding paired device pins; (ii) a pseudo bottom surface metal node for each pair of bottom surface metal pins on each of multiple routing layers; (iii) a source node connected to each of the pseudo device pin nodes; (iv) a sub-sink node for each pair of the paired bottom surface metal pins (each of the sub-sink nodes is connected to corresponding ones of the pseudo bottom surface metal nodes for each of the pairs of bottom surface metal pins on each of the multiple routing layers); and (v) a sink node connected to the sub-sink nodes. A capacity and a cost are assigned to each of the edges of the scaled network flow graph. A min-cost-max-flow technique is applied to the scaled network flow graph with the assigned capacities and costs to obtain an optimal flow solution. The paired bottom surface metal pins are assigned to the corresponding paired device pins, and routing connections there-between are assigned, in accordance with the optimal flow solution. A technique for use in the absence of pairing constraints is also provided, as is a pin-pairing technique.
    • 构建了缩放的网络流程图,包括多个节点和多个边缘。 多个节点对应于:(i)每对对应的配对设备引脚的伪器件引脚节点; (ii)在多个路由层中的每一个上的每对底表面金属销的伪底面金属节点; (iii)连接到每个伪器件引脚节点的源节点; (iv)每对成对的底表面金属销(每个子汇点中的每一个连接到每个底面表面金属节点中的每个底表面金属节点的子汇点) 的多个路由层); 和(v)连接到子汇点节点的汇聚节点。 容量和成本被分配给缩放的网络流程图的每个边缘。 最小成本最大流技术应用于具有分配容量和成本的缩放网络流图,以获得最佳流解决方案。 配对的底面金属针脚被分配给相应的配对器件引脚,并且根据最佳流量解决方案分配其间的路由连接。 还提供了在没有配对约束的情况下使用的技术,引脚配对技术也是如此。