VeriHGN: 基于异构图的芯片布局验证中的拥堵预测
VeriHGN: Heterogeneous Graph-Based Congestion Prediction for Chip Layout Verification
AI总结:
本文提出VeriHGN框架,通过增强的异构图统一电路组件和空间网格,实现更准确的逻辑意图与物理实现的交互建模,提高了拥堵预测的准确性和相关性。
摘要:
随着非常大规模集成电路(VLSI)设计在规模和复杂性上持续增长,布局验证已成为现代电子设计自动化(EDA)工作流程中的核心挑战。在实践中,拥堵只能在详细布线后才能被准确识别,这使得传统验证既耗时又昂贵。因此,学习方法被探索以实现早期阶段的拥堵预测并减少布线迭代。然而,尽管先前的方法结合了网表连接性和布局特征,但它们通常以松散耦合的方式建模这两个方面,并主要产生数值拥堵估计。我们提出VeriHGN,一个基于增强异构图的验证框架,将电路组件和空间网格统一到单一关系表示中,从而实现更准确的逻辑意图与物理实现的交互建模。在工业基准测试中,包括ISPD2015、CircuitNet-N14和CircuitNet-N28,实验表明,VeriHGN在预测准确性和相关性度量方面均优于现有最先进方法。
英文摘要:
As Very Large Scale Integration (VLSI) designs continue to scale in size and complexity, layout verification has become a central challenge in modern Electronic Design Automation (EDA) workflows. In practice, congestion can only be accurately identified after detailed routing, making traditional verification both time-consuming and costly. Learning-based approaches have therefore been explored to enable early-stage congestion prediction and reduce routing iterations. However, although prior methods incorporate both netlist connectivity and layout features, they often model the two in a loosely coupled manner and primarily produce numerical congestion estimates. We propose VeriHGN, a verification framework built on an enhanced heterogeneous graph that unifies circuit components and spatial grids into a single relational representation, enabling more faithful modeling of the interaction between logical intent and physical realization. Experiments on industrial benchmarks, including ISPD2015, CircuitNet-N14, and CircuitNet-N28, demonstrate that VeriHGN achieves the best or near-best performance over state-of-the-art methods in prediction accuracy and correlation metrics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。