Circuit comparison by information loss matching
    2.
    发明授权
    Circuit comparison by information loss matching 失效
    电路比较信息丢失匹配

    公开(公告)号:US07222317B1

    公开(公告)日:2007-05-22

    申请号:US10822166

    申请日:2004-04-09

    IPC分类号: G06F17/50

    CPC分类号: G06F17/504 G06F17/509

    摘要: The present invention discloses a method and system for computer-aided circuit design for checking the equivalence of data flow graphs by splitting data flow graphs representing finite precision arithmetic circuits into lossless subgraphs representing infinite-precision arithmetic circuits, and edges with information loss. The set of lossless subgraphs generated are leveled, and checked for equivalence as expressions. The edges with information loss are compared by establishing the equivalence of their bit width. The present invention declares data flow graphs as equal, if the respective lossless subgraphs and the bit-width at the corresponding edges with information loss are equal.

    摘要翻译: 本发明公开了一种用于计算机辅助电路设计的方法和系统,用于通过将表示有限精密算术电路的数据流图分解成表示无限精度运算电路的无损子图和具有信息丢失的边来检查数据流图的等效性。 生成的无损子图的集合被平整,并且检查等价作为表达式。 通过确定其位宽的等价性来比较具有信息丢失的边。 如果各个无损子图和具有信息丢失的相应边缘的位宽相等,则本发明声明数据流图相同。

    Reducing datapath widths by rebalancing data flow topology
    3.
    发明授权
    Reducing datapath widths by rebalancing data flow topology 有权
    通过重新平衡数据流拓扑来减少数据路径宽度

    公开(公告)号:US06832357B2

    公开(公告)日:2004-12-14

    申请号:US10173066

    申请日:2002-06-17

    IPC分类号: G06F1750

    摘要: A Huffman algorithm is applied to revise the topology of a data flow graph. The result of the application of the algorithm is an increase in the sizes of at least some clusters (i.e., enhanced mergeability). The Huffman rebalancing of the topology may also result in the benefit of allowing further pruning of the bitwidths of data flow paths, which may further enhance mergeability. Thus, the algorithm may be applied with a maximum information content analysis.

    摘要翻译: 应用霍夫曼算法来修改数据流图的拓扑。 应用该算法的结果是至少一些簇的大小增加(即,增强的合并性)。 拓扑的霍夫曼重新平衡还可以带来进一步修剪数据流路径的位宽度的好处,这可能进一步增强可合并性。 因此,该算法可以应用于最大信息内容分析。

    Reducing datapath widths responsively to upper bound on information content
    4.
    发明授权
    Reducing datapath widths responsively to upper bound on information content 有权
    响应于信息内容的上限减小数据路径宽度

    公开(公告)号:US06772398B2

    公开(公告)日:2004-08-03

    申请号:US10173338

    申请日:2002-06-17

    IPC分类号: G06F1750

    摘要: A practical definition for determining an upper bound on information content is provided and used to reduce the widths of operators and edges of data flow graphs. A top down procedure for systematically pruning data flow graphs is described. The result is shown to enhance the mergeability of subgraphs and provide reduced data path widths. This may result in lower area, power requirements and other benefits as readily understood in the field of circuit design.

    摘要翻译: 提供了确定信息内容上界的实际定义,并用于减少数据流图的运算符和边缘的宽度。 描述了自动修剪数据流图的自上而下的过程。 结果显示为增强子图的合并性并提供减少的数据路径宽度。 这可能导致在电路设计领域中容易理解的较低的面积,功率要求和其他益处。

    System, method, and computer program product for determining equivalence of netlists utilizing abstractions and transformations
    5.
    发明授权
    System, method, and computer program product for determining equivalence of netlists utilizing abstractions and transformations 有权
    系统,方法和计算机程序产品,用于确定使用抽象和转换的网表的等价性

    公开(公告)号:US08117571B1

    公开(公告)日:2012-02-14

    申请号:US12260851

    申请日:2008-10-29

    IPC分类号: G06F17/50

    CPC分类号: G06F17/504

    摘要: A system, method and computer program product are provided for determining equivalence of netlists utilizing at least one transformation. In use, a netlist including a plurality of infinite portions and a plurality of finite portions is identified. Additionally, at least some of the finite portions are transformed, utilizing at least one predetermined transformation. Further, an equivalence of the netlist and another netlist is determined, utilizing at least a subset of the finite portions and the infinite portions. Moreover, an abstraction is performed on the netlist.

    摘要翻译: 提供了一种系统,方法和计算机程序产品,用于使用至少一个变换来确定网表的等同性。 在使用中,识别包括多个无限部分和多个有限部分的网表。 另外,使用至少一个预定变换来转换至少一些有限部分。 此外,利用有限部分和无限部分的至少一个子集来确定网表和另一网表的等价物。 此外,在网表上执行抽象。

    System, method, and computer program product for determining equivalence of netlists utilizing at least one transformation
    8.
    发明授权
    System, method, and computer program product for determining equivalence of netlists utilizing at least one transformation 有权
    用于使用至少一个变换来确定网表的等价性的系统,方法和计算机程序产品

    公开(公告)号:US08122401B1

    公开(公告)日:2012-02-21

    申请号:US12260837

    申请日:2008-10-29

    IPC分类号: G06F17/50 G06F9/455

    CPC分类号: G06F17/504

    摘要: A system, method and computer program product are provided for determining equivalence of netlists utilizing at least one transformation. In use, a netlist including a plurality of infinite portions and a plurality of finite portions is identified. Additionally, at least some of the finite portions are transformed, utilizing at least one predetermined transformation. Further, an equivalence of the netlist and another netlist is determined, utilizing at least a subset of the finite portions and the infinite portions. Moreover, the transformation identifies a word-level functionality of the at least some of the finite portions by converting bit-level functionality into word-level functionality.

    摘要翻译: 提供了一种系统,方法和计算机程序产品,用于使用至少一个变换来确定网表的等同性。 在使用中,识别包括多个无限部分和多个有限部分的网表。 另外,使用至少一个预定变换来转换至少一些有限部分。 此外,利用有限部分和无限部分的至少一个子集来确定网表和另一网表的等价物。 此外,转换通过将位级功能转换为字级功能来识别至少一些有限部分的字级功能。

    Enhancing mergeability of datapaths and reducing datapath widths responsively to required precision
    9.
    发明授权
    Enhancing mergeability of datapaths and reducing datapath widths responsively to required precision 有权
    提高数据路径的可合并性,并根据需要的精度减少数据路径宽度

    公开(公告)号:US06772399B2

    公开(公告)日:2004-08-03

    申请号:US10173477

    申请日:2002-06-17

    IPC分类号: G06F1750

    摘要: A practical definition for determining a required precision is provided and used to reduce the widths of operators and edges of data flow graphs. A bottom-up procedure for systematically pruning data flow graphs is described. The result is shown to enhance the mergeability of subgraphs and provide reduced data path widths. This may result in lower area, power requirements and other benefits as readily understood in the field of circuit design.

    摘要翻译: 提供用于确定所需精度的实际定义,并用于减少数据流图的运算符和边缘的宽度。 描述了用于系统地修剪数据流图的自下而上的过程。 结果显示为增强子图的合并性并提供减少的数据路径宽度。 这可能导致在电路设计领域中容易理解的较低的面积,功率要求和其他益处。