会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method of buffer insertion to achieve pin specific delays
    • 缓冲区插入方式来实现引脚特定的延迟
    • US07243324B2
    • 2007-07-10
    • US11041489
    • 2005-01-24
    • Aiguo LuIvan PavisicNikola Radovanovic
    • Aiguo LuIvan PavisicNikola Radovanovic
    • G06F17/50G06F9/45
    • G06F17/505G06F2217/62
    • A method of buffer insertion for a tree network in an integrated circuit design includes steps of: (a) receiving as input an integrated circuit design including a tree network; (b) selecting a buffer type available to the integrated circuit design from a cell library that results in a minimum total delay for a predetermined wire length; (c) identifying each candidate leaf node in the tree network that has a required pin-specific target delay; (d) inserting a buffer between each internal node that is traversed by a path from a candidate leaf node to a root node of the tree network and each leaf node that is not a candidate leaf node; (e) creating a buffer sub-tree in the tree network from an upstream internal node for each internal node that is traversed by a path from a candidate leaf node to a root node of the tree network; re-parenting each internal node that is traversed by a path from a candidate leaf node to a root node of the tree network to a new buffer in the buffer sub-tree; and (g) generating as output a revised integrated circuit design that includes the buffer sub-tree.
    • 一种用于集成电路设计中的树形网络的缓冲器插入方法包括以下步骤:(a)接收作为输入的包括树形网络的集成电路设计; (b)从单元库选择可用于集成电路设计的缓冲器类型,其导致预定导线长度的最小总延迟; (c)识别树网络中具有所需针特定目标延迟的候选叶节点; (d)在由候选叶节点到树网络的根节点的路径穿过的每个内部节点之间插入缓冲器,并且不是候选叶节点的每个叶节点; (e)从由候选叶节点到树网络的根节点的路径遍历的每个内部节点的上游内部节点在树形网络中创建缓冲器子树; 将通过从候选叶节点到树树网络的根节点的路径遍历的每个内部节点重新编入缓冲器子树中的新缓冲器; 和(g)产生包括缓冲器子树的经修订的集成电路设计的输出。
    • 2. 发明申请
    • Optimizing IC clock structures by minimizing clock uncertainty
    • 通过最小化时钟不确定性优化IC时钟结构
    • US20050010884A1
    • 2005-01-13
    • US10616623
    • 2003-07-10
    • Aiguo LuIvan PavisicNikola Radovanovic
    • Aiguo LuIvan PavisicNikola Radovanovic
    • G01R31/30G06F1/10G06F9/45
    • G06F1/10G01R31/3016
    • Clock uncertainty between a receiving cell and a launching cell of a net is estimated by back-tracing a first path from the receiving cell toward the clock source and marking each cell having a predetermined character along the first path. A second path from the launching cell toward the clock source is back-traced to a predetermined marked cell. Clock uncertainty is calculated based on the portion of the first path from the predetermined marked cell to the receiving cell. Clock uncertainty is calculated if a slack does not exceed a margin value. In one embodiment, a clock net in the form of a tree is optimized by forcing a first buffer to the center of gravity of a plurality of buffers having nets without timing violations to maximize a common path from the root to the forced buffer and minimize the non-common paths from the forced buffer to the leaves, thereby minimizing clock uncertainty.
    • 通过从接收单元向时钟源的后向跟踪第一路径并且沿着第一路径标记具有预定字符的每个单元来估计接收小区和网络的启动小区之间的时钟不确定性。 从启动单元向时钟源的第二条路径被追溯到预定的标记单元。 基于从预定标记小区到接收小区的第一路径的部分来计算时钟不确定性。 如果松弛不超过余量值,则计算时钟不确定度。 在一个实施例中,通过将第一缓冲器强制为具有网络的多个缓冲器的重心而没有定时违反来最大化从根到强制缓冲器的公共路径,使得最小化 从强制缓冲区到叶片的非公共路径,从而最小化时钟不确定性。
    • 5. 发明申请
    • Method of buffer insertion to achieve pin specific delays
    • 缓冲区插入方式来实现引脚特定的延迟
    • US20060190901A1
    • 2006-08-24
    • US11041489
    • 2005-01-24
    • Aiguo LuIvan PavisicNikola Radovanovic
    • Aiguo LuIvan PavisicNikola Radovanovic
    • G06F17/50
    • G06F17/505G06F2217/62
    • A method of buffer insertion for a tree network in an integrated circuit design includes steps of: (a) receiving as input an integrated circuit design including a tree network; (b) selecting a buffer type available to the integrated circuit design from a cell library that results in a minimum total delay for a predetermined wire length; (c) identifying each candidate leaf node in the tree network that has a required pin-specific target delay; (d) inserting a buffer between each internal node that is traversed by a path from a candidate leaf node to a root node of the tree network and each leaf node that is not a candidate leaf node; (e) creating a buffer sub-tree in the tree network from an upstream internal node for each internal node that is traversed by a path from a candidate leaf node to a root node of the tree network; re-parenting each internal node that is traversed by a path from a candidate leaf node to a root node of the tree network to a new buffer in the buffer sub-tree; and (g) generating as output a revised integrated circuit design that includes the buffer sub-tree.
    • 一种用于集成电路设计中的树形网络的缓冲器插入方法包括以下步骤:(a)接收作为输入的包括树形网络的集成电路设计; (b)从单元库选择可用于集成电路设计的缓冲器类型,其导致预定导线长度的最小总延迟; (c)识别树网络中具有所需针特定目标延迟的候选叶节点; (d)在由候选叶节点到树网络的根节点的路径穿过的每个内部节点之间插入缓冲器,并且不是候选叶节点的每个叶节点; (e)从由候选叶节点到树网络的根节点的路径遍历的每个内部节点的上游内部节点在树形网络中创建缓冲器子树; 将通过从候选叶节点到树树网络的根节点的路径遍历的每个内部节点重新编入缓冲器子树中的新缓冲器; 和(g)产生包括缓冲器子树的经修订的集成电路设计的输出。
    • 6. 发明授权
    • Optimizing IC clock structures by minimizing clock uncertainty
    • 通过最小化时钟不确定性优化IC时钟结构
    • US07096442B2
    • 2006-08-22
    • US10616623
    • 2003-07-10
    • Aiguo LuIvan PavisicNikola Radovanovic
    • Aiguo LuIvan PavisicNikola Radovanovic
    • G06F17/50G06F19/00
    • G06F1/10G01R31/3016
    • Clock uncertainty between a receiving cell and a launching cell of a net is estimated by back-tracing a first path from the receiving cell toward the clock source and marking each cell having a predetermined characteristic along the first path. A second path from the launching cell toward the clock source is back-traced to a common one of the marked cells having the predetermined characteristic. Clock uncertainty is calculated based on the portion of the first path from the common marked cell having the predetermined characteristic to the receiving cell. Clock uncertainty is calculated if a slack does not exceed a margin value. In one embodiment, a clock net in the form of a tree is optimized by forcing a first buffer to the center of gravity of a plurality of buffers having nets without timing violations to maximize a common path from the root to the forced buffer and minimize the non-common paths from the forced buffer to the leaves, thereby minimizing clock uncertainty.
    • 通过从接收小区向时钟源的后向跟踪第一路径并且沿着第一路径标记具有预定特性的每个小区来估计接收小区和网络的启动小区之间的时钟不确定性。 从发射单元朝向时钟源的第二路径被追溯到具有预定特性的标记单元中的共同的一个。 基于从具有预定特征的公共标记小区到接收小区的第一路径的部分来计算时钟不确定性。 如果松弛不超过余量值,则计算时钟不确定度。 在一个实施例中,通过将第一缓冲器强制为具有网络的多个缓冲器的重心而没有定时违反来最大化从根到强制缓冲器的公共路径,使得最小化 从强制缓冲区到叶片的非公共路径,从而最小化时钟不确定性。
    • 8. 发明授权
    • Parallelization of resynthesis
    • 再合成平行化
    • US06470487B1
    • 2002-10-22
    • US09842350
    • 2001-04-25
    • Andrej A. ZolotykhElyar E. GasanovIvan PavisicAiguo Lu
    • Andrej A. ZolotykhElyar E. GasanovIvan PavisicAiguo Lu
    • G06F1750
    • G06F17/5045
    • A method for resynthesizing a design of an integrated circuit using a parallel processing mode. A single processing mode is entered by activating a main thread and locking a semaphore associated with the main thread. The design of the integrated circuit is resynthesized using the main thread. Tasks to be accomplished in the parallel processing mode are identified. The semaphore associated with the main thread is unlocked, and the operation of the single processing mode is ceased. Ordinal threads are activated by unlocking a semaphore associated with each ordinal thread. The tasks are processed in parallel by assigning the tasks to the ordinal threads and the main thread. Upon completion of one of the assigned tasks by one of the ordinal threads, it is determined whether an additional task remains to be assigned. In the case where the additional task remains, the additional task is assigned to the completed one of the ordinal threads. In the case where the additional task does not remain, the completed one of the ordinal threads is inactivated. Upon inactivation of all of the ordinal threads, a return is made to the single processing mode, with the ordinal threads remaining inactive unless and until the main thread identifies more tasks to be accomplished in the parallel processing mode.
    • 一种使用并行处理模式重新合成集成电路的设计的方法。 通过激活主线程并锁定与主线程相关联的信号量来输入单个处理模式。 集成电路的设计使用主线重新合成。 识别以并行处理模式完成的任务。 与主线程相关联的信号量被解锁,并且停止单处理模式的操作。 通过解锁与每个顺序线程相关联的信号量激活有序线程。 通过将任务分配给顺序线程和主线程,并行处理任务。 在通过其中一个顺序线程完成一个分配的任务之后,确定是否还有一个额外的任务被分配。 在附加任务保留的情况下,附加任务被分配给完成的一个序​​数线程。 在附加任务不存在的情况下,完成的一个顺序线程将被禁用。 在所有顺序线程失效后,返回到单个处理模式,顺序线程保持不活动,除非主线程在并行处理模式下识别要完成的更多任务。