会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明授权
    • Timing recomputation
    • 定时重新计算
    • US06553551B1
    • 2003-04-22
    • US09841825
    • 2001-04-25
    • Andrej A. ZolotykhElyar E. GasanovIvan PavisicAiguo Lu
    • Andrej A. ZolotykhElyar E. GasanovIvan PavisicAiguo Lu
    • G06F1750
    • G06F17/505G06F17/5031
    • A method of computing timing delays of timing edges of a path of an integrated circuit design. According to the method, all pins within the path are identified, and all timing edges defined by the pins within the path are identified. All pins within the path that are a leading pin of one of the time edge in the path are also identified. For each given pin within the path, a tabulation is made of a number of pins that are upstream from the given pin along a contiguous series of the timing edges in the path. A computational rank is assigned to the given pin based upon the tabulated number for the given pin. The timing edges are ordered for computation based upon the computational rank of the leading pin of each timing edge in the path, to produce an ordered list of timing edges. The timing delays of the timing edges of the path are computed according to the ordered list of timing edges.
    • 一种计算集成电路设计的路径的定时边缘的定时延迟的方法。 根据该方法,识别路径内的所有引脚,并且识别由路径内的引脚限定的所有定时边缘。 路径中的所有引脚都是路径中时间边缘之一的引导引脚。 对于路径内的每个给定的引脚,列出了沿着路径中的连续的时序边缘序列从给定引脚上游的多个引脚。 基于给定引脚的列表号码,给定引脚分配计算等级。 定时边缘根据路径中每个时序边沿的引导引脚的计算等级进行排序,以产生定时边缘的有序列表。 根据定时边缘的有序列表计算路径的定时边缘的定时延迟。
    • 10. 发明申请
    • 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.
    • 通过从接收单元向时钟源的后向跟踪第一路径并且沿着第一路径标记具有预定字符的每个单元来估计接收小区和网络的启动小区之间的时钟不确定性。 从启动单元向时钟源的第二条路径被追溯到预定的标记单元。 基于从预定标记小区到接收小区的第一路径的部分来计算时钟不确定性。 如果松弛不超过余量值,则计算时钟不确定度。 在一个实施例中,通过将第一缓冲器强制为具有网络的多个缓冲器的重心而没有定时违反来最大化从根到强制缓冲器的公共路径,使得最小化 从强制缓冲区到叶片的非公共路径,从而最小化时钟不确定性。