用可微神经网络让信号完整性设计实时完成,省时万倍。
Amortized Neural Optimization for Pre-Layout Signal Integrity Design Space Exploration using Differentiable Surrogates

- 用可微代理模型提取梯度,训练全局优化策略,不再迭代搜索。
- 相比传统方法损失10%性能,但提速3到4个数量级。
- 适合高速芯片设计、EDA工具开发人员快速探索设计方案。
高速信号完整性(SI)分析的预布局设计空间探索(DSE)常受限于仿真与迭代优化算法的计算开销。尽管机器学习代理模型加速了仿真,但设计优化仍依赖迭代黑箱搜索,多场景遍历效率低下。本文提出免迭代的神经优化(ANO),利用全可微神经网络代理模型,从代理中提取解析梯度以训练全局优化策略。优化过程在离线阶段学习完成,推理时仅需单次前向传播即可映射通道上下文到近优设计参数。在三个复杂场景中验证:DDR5决策反馈均衡(DFE)、9维SerDes收发端联合均衡,以及DDR3 DQS差分对布线以优化眼图指标并满足对内偏移约束。相比实例级黑箱算法,性能下降约10%,但实现3~4个数量级提速。针对大规模32万实例的多角点SerDes优化,将原本需数日的迭代计算压缩至毫秒级批量前向传播。该框架将高成本的SI优化转变为实时交互式预布局DSE。
原文摘要 · Abstract (English)
Pre-layout design space exploration (DSE) for high-speed signal integrity (SI) analysis is often limited by the computational cost of simulations and iterative optimization algorithms within modern electronic design automation (EDA) workflows. While machine learning surrogate models accelerate the simulation step, optimizing designs still requires utilizing iterative black-box search methods. This iterative nature scales poorly, making multi-corner sweeps computationally expensive. As a solution, this paper proposes amortized neural optimization (ANO) for pre-layout SI design. ANO entirely eliminates iterative black-box inference by utilizing fully differentiable neural network surrogate models. ANO extracts analytical gradients from the surrogate to train a global optimization policy. Instead of solving the optimization problem repeatedly at inference, the optimization process is learned offline and therefore amortized. Once the ANO policy is trained, it maps different channel contexts directly to near-optimal design parameters in a single deterministic forward pass. The efficiency and accuracy of the ANO framework are demonstrated based on three complex SI design scenarios, including DDR5 decision feedback equalization (DFE), 9-dimensional SerDes Tx/Rx co-equalization, and DDR3 DQS differential pair routing to optimize eye diagram metrics under intra-pair skew constraints. By trading roughly 10% in optimality compared to instance-specific black-box algorithms, it realizes speedups of three to four orders of magnitude. For a large-scale 320,000-instance multi-corner SerDes sweep optimization, ANO collapses what would have taken days of computation using iterative search algorithms into a single batched forward pass that completes in milliseconds. This transforms computationally expensive SI optimization into real-time and interactive pre-layout DSE.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。