首页> 外国专利> Method for timing analysis during automatic scheduling of operations in the high-level synthesis of digital systems

Method for timing analysis during automatic scheduling of operations in the high-level synthesis of digital systems

机译:数字系统高级综合中的操作自动调度中的时序分析方法

摘要

A design-timing-determination process for an electronic design automation system approximates the timing of a whole design quickly and on-the-fly. Such allows a scheduling system to construct operation schedules that are ultimately realizable. A timing analysis is applied each time an individual operation is scheduled, and may be called many times to get a single operation scheduled. A graph representing combinational logic is partitioned into a collection of logic trees with nodes that represent gates and terminals, and arcs that represent connections. A compacted model of each logic tree is constructed by replacing them with equivalent trees having no interior nodes. The timing of the original circuit is analyzed along each path from the leaves to the roots. A propagation delay for each path is determined, and such is annotated onto each corresponding arc of the simplified tree. Any dependency of the propagation delay in the original circuit on the slew rate of their input signals is annotated onto the corresponding leaf of the simplified tree. Capacitive loads can also be copied from the logic-tree leaves and annotated on the simplified-tree leaves. Any load/delay response curves of the output gate at the apex of the logic tree and is copied to the root of the simplified tree. The entire delay calculation is collapsed into a simple edge-weighted longest-path traversal, and is much simpler than trying to compute the slew rates and delays for each cell in a circuit.
机译:电子设计自动化系统的设计时机确定过程可以快速,实时地估算整个设计的时机。这样允许调度系统构造最终可实现的操作调度。每次安排单个操作时都会应用时序分析,并且可能需要多次调用时序分析才能安排单个操作。代表组合逻辑的图形被划分成逻辑树的集合,逻辑树的集合具有代表门和端子的节点以及代表连接的弧形。通过用没有内部节点的等效树替换它们,可以构造每个逻辑树的压缩模型。沿着从叶子到根的各个路径分析原始电路的时序。确定每个路径的传播延迟,并将其注释到简化树的每个对应弧上。原始电路中传播延迟对其输入信号的转换速率的任何依赖性都标注在简化树的相应叶子上。电容负载也可以从逻辑树叶子复制并在简化树叶子上标注。逻辑树顶点处输出门的任何负载/延迟响应曲线,并将其复制到简化树的根。整个延迟计算被分解为一个简单的边缘加权最长路径遍历,比尝试计算电路中每个单元的转换速率和延迟要简单得多。

著录项

  • 公开/公告号US6516453B1

    专利类型

  • 公开/公告日2003-02-04

    原文格式PDF

  • 申请/专利权人 GET2CHIP;

    申请/专利号US20000574572

  • 发明设计人 DAVID KNAPP;

    申请日2000-05-17

  • 分类号H06F175/00;

  • 国家 US

  • 入库时间 2022-08-22 00:04:10

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号