aiqbench analysis
VeriHGN addresses the latency and cost of VLSI layout verification by unifying netlist connectivity and spatial grid data into a single heterogeneous graph representation. This approach enables more accurate early-stage congestion prediction, reducing the need for iterative detailed routing in Electronic Design Automation workflows. The method demonstrates superior correlation metrics on industrial benchmarks, offering a practical improvement for scaling complex chip designs.
VeriHGN: Heterogeneous Graph-Based Congestion Prediction for Chip Layout Verification
arXiv:2603.11075v3 Announce Type: replace-cross Abstract: 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.
Abstract: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.
Hardware Architecture (cs.AR); Artificial Intelligence (cs.AI)
arXiv:2603.11075 [cs.AR]
(or arXiv:2603.11075v3 [cs.AR] for this version)
Full text under the publisher's open licence · 166 words
Related coverage
HGRP: Heterogeneous Graph Neural Network for Routability Prediction
arXiv · Oct 15, 2026
ParasGB: A Graph Benchmark Suite for Parasitic Estimation on AMS Circuits
arXiv · Jul 28, 2026

News
Quantum Computing Report · Jul 25, 2026

Kilometer-scale Earth modeling has supercomputers SCREAM under limits
Quantum Zeitgeist · Sep 3, 2026