公开(公告)号：US07111260B2

公开(公告)日：2006-09-19

申请号：US10665092

申请日：2003-09-18

申请人： Chandramouli Visweswariah

发明人： Chandramouli Visweswariah

IPC分类号： G06F17/50

CPC分类号： G06F17/5031

摘要： The present invention is a system and method for efficiently and incrementally updating the statistical timing of a digital circuit after a change has been made in the circuit. One or more changes in the circuit is/are followed by timing queries that are answered efficiently, constituting a mode of timing that is most useful in the inner loop of an automatic computer-aided design (CAD) synthesis or optimization tool. In the statistical re-timing, the delay of each gate or wire is assumed to consist of a nominal portion, a correlated random portion that is parameterized by each of the sources of variation and an independent random portion. Correlations are taken into account. Both early mode and late mode timing are included; both combinational and sequential circuits are handled; static CMOS as well as dynamic logic families are accommodated.

公开(公告)号：US07086023B2

公开(公告)日：2006-08-01

申请号：US10666470

申请日：2003-09-19

申请人： Chandramouli Visweswariah

发明人： Chandramouli Visweswariah

IPC分类号： G06F17/50

CPC分类号： G06F17/5031

摘要： The present invention is a system and method for determining criticality probability of each node, edge and path of the timing graph of a digital circuit in the presence of delay variations. The delay of each gate or wire is assumed to consist of a nominal portion, a correlated random portion that is parameterized by each of the sources of variation and an independent random portion. Correlations are taken into account. Both early mode and late mode timing are included; both combinational and sequential circuits are handled; static CMOS as well as dynamic logic families are accommodated. The criticality determination complexity is linear in the size of the graph and the number of sources of variation. The invention includes a method for efficiently enumerating the critical path(s) that is/are most likely to be critical.

摘要翻译： 本发明是一种用于在存在延迟变化的情况下确定数字电路的时序图的每个节点，边缘和路径的临界概率的系统和方法。 假设每个门或线的延迟由标称部分，由每个变化源参数化的相关随机部分和独立的随机部分组成。 考虑相关性。 包括早期模式和晚期模式时序; 处理组合和顺序电路; 静态CMOS以及动态逻辑系列。 关键性决定复杂度在图形的大小和变异的来源数量上是线性的。 本发明包括一种用于有效地列举最可能是至关重要的关键路径的方法。

公开(公告)号：US07010763B2

公开(公告)日：2006-03-07

申请号：US10436213

申请日：2003-05-12

申请人： David J. Hathaway ,  Lawrence Kenneth Lange ,  Chandramouli Visweswariah ,  Patrick M. Williams

发明人： David J. Hathaway ,  Lawrence Kenneth Lange ,  Chandramouli Visweswariah ,  Patrick M. Williams

IPC分类号： G06F17/50

CPC分类号： G06F17/505

摘要： Disclosed is a method for achieving timing closure in the design of a digital integrated circuit or system by selecting portions of the circuit or system to be optimized and portions of the circuit or system in which the effects of such optimization are to be analyzed during the optimization process. Optimized portions will include gates whose design parameters are to be changed, a first analyzed portion includes gates whose delays and edge slews are to be recomputed, and a second analyzed portion includes gates whose ATs and RATs are to be recomputed during optimization. Constraints are imposed at selected boundaries between these portions to prevent unwanted propagation of timing information and to ensure the validity of timing values used during optimization. Through this selection, the size of the problem posed to the underlying optimization method will be reduced, allowing larger circuits or systems to be optimized and allowing optimization to be performed more quickly.

摘要翻译： 公开了一种在数字集成电路或系统的设计中实现定时闭合的方法，通过选择要优化的电路或系统的部分以及在优化期间分析这种优化的影响的电路或系统的部分 处理。 优化部分将包括其设计参数将被改变的门，第一分析部分包括要重新计算其延迟和边缘电压的门，并且第二分析部分包括在优化期间重新计算其AT和RAT的门。 在这些部分之间的选定边界施加约束，以防止定时信息的不期望的传播，并确保优化期间使用的定时值的有效性。 通过这种选择，将降低对基础优化方法造成的问题的大小，从而允许更大的电路或系统被优化，并允许更快地执行优化。

公开(公告)号：US08510696B2

公开(公告)日：2013-08-13

申请号：US13422637

申请日：2012-03-16

申请人： Chandramouli Visweswariah ,  Jinjun Xiong ,  Vladimir P. Zolotov

发明人： Chandramouli Visweswariah ,  Jinjun Xiong ,  Vladimir P. Zolotov

IPC分类号： G06F17/50

CPC分类号： G06F17/50

摘要： Solutions for ordering of statistical correlated quantities are disclosed. In one aspect, a method includes timing a plurality of paths in an integrated circuit to determine a set of timing quantities associated with each of the plurality of paths; determining a most critical timing quantity in the set of timing quantities; forming a tiered timing quantity arrangement for ordering a plurality of timing quantities in the set of timing quantities; removing the most critical timing quantity from the set of timing quantities and placing the most critical timing quantity in an uppermost available tier of the tiered timing quantity arrangement; and repeating the determining, forming and removing for the set of timing quantities excluding the removed most critical timing quantity.

摘要翻译： 公布统计相关数量排序的解决方案。 在一个方面，一种方法包括对集成电路中的多个路径进行定时以确定与多个路径中的每一条相关联的一组定时量; 确定所述一组定时数量中最关键的定时数量; 形成用于在所述一组定时量中排序多个定时量的分层定时量排列; 从所述定时量集合中去除最关键的定时数量，并将最关键的定时数量置于分层定时数量排列的最上层可用层; 并且重复确定，形成和去除不包括去除的最关键定时量的一组定时量。

公开(公告)号：US07743355B2

公开(公告)日：2010-06-22

申请号：US11942034

申请日：2007-11-19

申请人： Jun Zhou ,  David J. Hathaway ,  Chandramouli Visweswariah ,  Patrick M. Williams

发明人： Jun Zhou ,  David J. Hathaway ,  Chandramouli Visweswariah ,  Patrick M. Williams

IPC分类号： G06F17/50

CPC分类号： G06F17/5031 ,  G06F17/505 ,  G06F2217/84

摘要： Disclosed is a method for enhanced efficiency and effectiveness in achieving closure of large, complex, high-performance digital integrated circuits. Circuit macros are re-optimized and re-tuned in the timing closure loop by means of a reformulated objective function that allows the optimizer to improve the slack of all signals rather than just the most critical one(s). The incentive to improve the timing of a sub-critical signal is a diminishing function of the criticality of the signal. Thus all signals are improved during the optimization, with the highest incentive to improve on the most critical signals, leading to faster and more effective overall timing closure.

摘要翻译： 公开了一种用于提高大型，复杂，高性能数字集成电路闭合的效率和有效性的方法。 电路宏通过重新配置的目标函数在时序闭合循环中重新优化和重新调整，允许优化器改善所有信号的松弛，而不仅仅是最关键的。 改善次临界信号时序的动机是信号临界性的递减函数。 因此，在优化期间，所有信号都得到改进，最高激励措施可以改善最关键的信号，从而实现更快更有效的整体时序收敛。

公开(公告)号：US20090094565A1

公开(公告)日：2009-04-09

申请号：US11869306

申请日：2007-10-09

申请人： David E. Lackey ,  Chandramouli Visweswariah ,  Paul S. Zuchowski

发明人： David E. Lackey ,  Chandramouli Visweswariah ,  Paul S. Zuchowski

IPC分类号： G06F17/50

CPC分类号： G06F17/5031 ,  G01R31/318307 ,  G01R31/318364

摘要： A method, system, and integrated circuit including selectively added timing margin. The method, for integrating statistical timing and automatic test pattern generation (ATPG) to selectively add timing margin in an integrated circuit, includes identifying, while a chip is in design, paths that are unable to be robustly tested “at speed” during manufacturing test, running statistical timing to calculate a margin to be applied to the paths, updating design specifications for margin to be applied to the paths, and optimizing chip logic based on updated design specifications.

摘要翻译： 一种方法，系统和集成电路，包括选择性地添加定时裕度。 用于集成统计时序和自动测试模式生成（ATPG）以在集成电路中选择性地添加时序裕度的方法包括在芯片设计时识别在制造测试期间“以速度”无法被鲁棒测试的路径 ，运行统计计时，计算要应用于路径的余量，更新要应用于路径的余量的设计规范，以及基于更新的设计规范优化芯片逻辑。

公开(公告)号：US20080307379A1

公开(公告)日：2008-12-11

申请号：US12196754

申请日：2008-08-22

申请人： Chandramouli Visweswariah

发明人： Chandramouli Visweswariah

IPC分类号： G06F17/50

CPC分类号： G06F17/5031

摘要： The present invention is a system and method for efficiently and incrementally updating the statistical timing of a digital circuit after a change has been made in the circuit. One or more changes in the circuit is/are followed by timing queries that are answered efficiently, constituting a mode of timing that is most useful in the inner loop of an automatic computer-aided design (CAD) synthesis or optimization tool. In the statistical re-timing, the delay of each gate or wire is assumed to consist of a nominal portion, a correlated random portion that is parameterized by each of the sources of variation and an independent random portion. Correlations are taken into account. Both early mode and late mode timing are included; both combinational and sequential circuits are handled; static CMOS as well as dynamic logic families are accommodated.

摘要翻译： 本发明是一种用于在电路中进行改变之后有效地并递增地更新数字电路的统计定时的系统和方法。 在电路中的一个或多个变化之后是有效回答的定时查询，构成在自动计算机辅助设计（CAD）综合或优化工具的内循环中最有用的定时模式。 在统计重新定时中，每个门或线的延迟被假设为由标称部分，由每个变化源参数化的相关随机部分和独立的随机部分组成。 考虑相关性。 包括早期模式和晚期模式时序; 处理组合和顺序电路; 静态CMOS以及动态逻辑系列。

公开(公告)号：US20080172642A1

公开(公告)日：2008-07-17

申请号：US11622979

申请日：2007-01-12

申请人： Soroush Abbaspour ,  Gregory M. Schaeffer ,  Chandramouli Visweswariah

发明人： Soroush Abbaspour ,  Gregory M. Schaeffer ,  Chandramouli Visweswariah

IPC分类号： G06F17/50

CPC分类号： G06F17/5031 ,  G06F2217/84

摘要： In one embodiment, the invention is a method and apparatus for static timing analysis in the presence of a coupling event and process variation. One embodiment of a method for computing a statistical change in delay and slew due to a coupling event between two adjacent nets in an integrated circuit design includes conducting a statistical timing analysis of the integrated circuit design, computing a statistical overlap window between the adjacent nets, where the statistical timing window represents a period of time during which signals on the adjacent nets can switch contemporaneously and computing the statistical change of delay due to the coupling event, in accordance with the statistical overlap window.

摘要翻译： 在一个实施例中，本发明是在存在耦合事件和过程变化的情况下用于静态时序分析的方法和装置。 用于计算由于集成电路设计中的两个相邻网络之间的耦合事件而导致的延迟和转换的统计变化的方法的一个实施例包括进行集成电路设计的统计时序分析，计算相邻网络之间的统计重叠窗口， 其中统计定时窗口表示相邻网络上的信号可以同时切换的时间段，并且根据统计重叠窗口计算由于耦合事件引起的延迟的统计变化。

公开(公告)号：US20080140983A1

公开(公告)日：2008-06-12

申请号：US12020879

申请日：2008-01-28

申请人： Kerim Kalafala ,  Vasant Rao ,  Chandramouli Visweswariah

发明人： Kerim Kalafala ,  Vasant Rao ,  Chandramouli Visweswariah

IPC分类号： G06F12/02

CPC分类号： G06F17/5031 ,  G06K9/6226 ,  G06K9/6247

摘要： A computer system for partitioning the columns of a matrix A. The computer system includes a processor and a memory unit coupled to the processor. Program code in the memory unit, when executed by the processor, implements the method. Matrix A is provided in a memory device and has n columns and m rows; wherein n is an integer of at least 3; and wherein m is an integer of at least 1. The n columns is partitioned into a closed group of p clusters, p being a positive integer of at least 2 and less than n. The partitioning includes an affinity-based merging of clusters of pairs of clusters of the matrix A based on an affinity between the clusters in each pair of clusters being merged. Each cluster consists of one or more columns of matrix A. The p clusters are stored in a computer-readable storage device.

摘要翻译： 一种用于分割矩阵A的列的计算机系统。计算机系统包括处理器和耦合到处理器的存储器单元。 当处理器执行时，存储器单元中的程序代码实现该方法。 矩阵A在存储器件中提供并具有n列和m行; 其中n为至少3的整数; 并且其中m是至少为1的整数。n列被划分成闭合的p个簇，p是至少为2且小于n的正整数。 基于被合并的每对簇中的簇之间的亲和度，分割包括矩阵A的聚类对的聚类的基于亲和度的合并。 每个簇由矩阵A的一个或多个列组成.P个簇存储在计算机可读存储设备中。

公开(公告)号：US20070276896A1

公开(公告)日：2007-11-29

申请号：US11836842

申请日：2007-08-10

申请人： Kerim Kalafala ,  Vasant Rao ,  Chandramouli Visweswariah

发明人： Kerim Kalafala ,  Vasant Rao ,  Chandramouli Visweswariah

IPC分类号： G06F7/32 ,  G06F17/50

CPC分类号： G06F17/5031 ,  G06K9/6226 ,  G06K9/6247

摘要： A method for partitioning the columns of a matrix A. The method includes providing the matrix A in a memory device of a computer system. The matrix A has n columns and m rows, wherein n is an integer of at least 3, and wherein m is an integer of at least 1. The method further includes executing an algorithm by a processor of the computer system. Executing the algorithm includes partitioning the n columns of the matrix A into a closed group of p clusters, wherein p is a positive integer of at least 2 and less than n, wherein the partitioning includes an affinity-based merging of clusters of the matrix A, and wherein each cluster is a collection of one or more columns of A.

摘要翻译： 用于分割矩阵A的列的方法。该方法包括将矩阵A提供到计算机系统的存储器设备中。 矩阵A具有n列和m行，其中n是至少为3的整数，并且其中m是至少为1的整数。该方法还包括由计算机系统的处理器执行算法。 执行算法包括将矩阵A的n列划分成闭合的p个群集，其中p是至少为2且小于n的正整数，其中分区包括基于关系的矩阵A的簇的合并 ，并且其中每个聚类是A的一列或多列的集合。