使用解析延迟函数进行数字电路的符号时序分析
Symbolic Timing Analysis of Digital Circuits Using Analytic Delay Functions
AI总结:
提出基于解析延迟公式的数字电路符号时序分析方法,无需仿真即可计算转换时间并支持灵敏度分析,并在c17基准电路上验证。
摘要:
我们提出了一种新颖的数字集成电路符号时序分析方法,该方法基于Ferdowsi等人(NAHS 2025)最近开发的用于2输入NOR、NAND和Muller-C门的解析延迟公式。给定电路所有输入和内部信号转换的固定顺序,我们的框架为所有内部信号转换时间计算闭式解析延迟表达式,这些表达式依赖于(i)相关输入信号的符号转换时间和(ii)相关门的模型参数。所得公式通过实例化符号输入转换时间和门参数,无需任何仿真即可实现逐转换时序分析。然而,更重要的是,它们还使得能够对某些时序特性对输入信号和门参数的依赖性进行解析研究。例如,对符号延迟表达式关于门参数或输入转换时间求导,可以实现灵敏度分析。作为概念验证,我们使用计算机代数系统SageMath实现了我们的方法,并将其应用于c17松弛基准电路的NOR门版本。
英文摘要:
We propose a novel approach to symbolic timing analysis for digital integrated circuits based on recently developed analytic delay formulas for 2-input NOR, NAND, and Muller-C gates by Ferdowsi et al. (NAHS 2025). Given a fixed order of the transitions of all input and internal signals of a circuit, our framework computes closed-form analytic delay expressions for all the internal signal transition times that depend on (i) the symbolic transition times of the relevant input signals and (ii) the model parameters of the relevant gates. The resulting formulas facilitate per-transition timing analysis without any simulation, by instantiating the symbolic input transition times and the gate parameters. More importantly, however, they also enable an \emph{analytic} study of the dependencies of certain timing properties on input signals and gate parameters. For instance, differentiating a symbolic delay expression with respect to a gate parameter or input transition time enables sensitivity analysis. As a proof of concept, we implement our approach using the computer algebra system SageMath and apply it to the NOR-gate version of the c17 slack benchmark circuit.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。