We present CapBench, a fully reproducible, multi-PDK dataset for capacitance extraction. The dataset is derived from open-source designs, including single-core CPUs, systems-on-chip, and media accelerators. All designs are fully placed and routed using 14 independent OpenROAD flow runs spanning three technology nodes: ASAP7, NanGate45, and Sky130HD. From these layouts, we extract 61,855 3D windows across three size tiers to enable transfer learning and scalability studies. High-fidelity capacitance labels are generated using RWCap, a state-of-the-art random-walk solver, and validated against the industry-standard Raphael, achieving a mean absolute error of 0.64% for total capacitance. Each window is pre-processed into density maps, graph representations, and point clouds. We evaluate 10 machine learning architectures that illustrate dataset usage and serve as baselines, including convolutional neural networks (CNNs), point cloud transformers, and graph neural networks (GNNs). CNNs demonstrate the lowest errors (1.75%), while GNNs are up to 41.4x faster but exhibit larger errors (10.2%), illustrating a clear accuracy-speed trade-off. Code and dataset are available at https://github.com/THU-numbda/CapBench.
Figures & tables
Figure 1. Formats of CapBench windows: 3D blocks, density maps, graphs, and point clouds. A four-panel teaser showing the same layout window as a 3D conductor view, per-layer density maps, a conductor graph, and a point cloud.
Dataset
PDK
EDA Stage
Outputs
CircuitNet
Proprietary
Complete
Task-Specific Labels
ChiPBench
NanGate45
Complete
Complete Data
OpenABC-D
—
Synthesis
AIG
ForgeEDA
Sky130HD
Placement
AIG, Placed Netlist
EDA-schema
Sky130HD
Complete
Graph, Capacitance
Sky130HD,
Complete Data,
Table 1. Comparison of EDA Datasets for ML
Figure 2. CapBench dataset generation flow and toolchain. Pipeline diagram from RTL sources through OpenROAD implementation, KLayout window extraction, and capacitance labeling with RWCap and Raphael validation.
PDK
Size
L ( μ m)
# Windows
From
To
ASAP7
Small
0.75
2,947
M1
M7
Medium
2.5
1,846
M1
M9
Large
5.0
1,559
M1
M9
Nangate45
Small
2.0
8,109
metal1
metal4
Medium
5.0
8,106
metal1
metal7
Large
10.0
2,028
metal1
metal7
Table 2. Window size and count.
Figure 3. Window placement on a 2 × 2 grid. A 2 by 2 tiling pattern where one large window, four medium windows, and four small windows fill the available area without overlap.
PDK
Size
Average window
# Nets
# Blocks
Runtime (s)
ASAP7
Small
35.5
181.4
12.35
Medium
194.3
1,873.8
98.11
Large
480.9
6,163.6
211.10
Nangate45
Small
15.0
49.8
7.10
Medium
48.9
277.3
27.48
Table 3. RWCap runtime per window.
PDK
Samples
Raphael
RWCap
(h/sample)
Speedup
Err tot (%)
Err coup (%)
ASAP7
468
3.56 h
1,038 ×
0.53%
1.80%
Nangate45
1,404
0.37 h
189 ×
0.64%
1.85%
Sky130HD
423
10.12 h
1,426 ×
0.41%
1.71%
Table 4. RWCap accuracy analysis.
Figure 4. RWCap and OpenRCX errors with Raphael as the reference. (a) RWCap, (b) OpenRCX. Two histograms comparing relative total-capacitance error against Raphael. RWCap errors are tightly concentrated near zero, while OpenRCX errors are broader with visible outliers beyond 20 percent.
Figure 5. GNN total capacitance prediction flow for a window with two conductors. A workflow diagram showing conductor decomposition into cuboids, graph construction, message passing, attention-based pooling, and total-capacitance prediction for each net.
PDK
lm ( μ m)
de ( μ m)
dvir ( μ m)
ASAP7
0.5
0.25
1.0
Nangate45
3.0
1.5
6.0
Sky130HD
8.0
4.0
16.0
Table 5. Graph construction.
Model
Arch
Params
Speed 1
Sky130HD
Nangate45
sample/s
Tot. Err (%)
Tot. Err (%)
CNN
ResNet-34
21.3 M
4602
1.99
4.93
CNN
ResNet-50
23.5 M
2520
1.75
3.86
CNN
ResNet-101
42.5 M
1654
1.86
4.01
PCT
4 Layers
1.85 M
4334
7.98
9.12
PCT
6 Layers
2.25 M
3014
6.78
7.48
Table 6. Performance comparison of ML architectures on small windows. MAPE is computed for total capacitance.
As capacitance extraction accuracy of rule-based pattern matching becomes difficult to sustain at advanced nodes, a growing trend emerges to develop deep-learning-based 2D capacitance models. However, existing MLP- and CNN-based methods constrain their input to fixed metal-layer combinations in a specific process node, limiting their usability in practice. Recognizing the inherent similarity between capacitance matrix and the prevailing attention mechanism, we propose AttentionCap, a customized Transformer for capacitance matrix learning, with a Gram representation framework, a physics-aligned symmetric-attention output layer, and a novel normalized Laplacian loss. We also introduce a process-node embedding to enable multi-node learning. Trained on synthetic data, AttentionCap attains 0.67%/3.99% self/coupling-capacitance error on unseen real designs under a multi-layer and multi-node setting, surpassing the CNN-Cap baseline with 4.6×/5.7× lower self/coupling error and 192× faster inference speed. A pretrained AttentionCap accurately transfers to an unseen node with only 5K samples and 4K finetuning steps. With sufficient accuracy on unseen real designs and strong transferability to new process nodes, AttentionCap offers highly practical value for modern EDA workflows. Code and data are available at https://github.com/THU-numbda/AttentionCap.
Jiechen Huang, Hector R. Rodriguez, Dingcheng Yang +3
Dept. Computer Science & Tech., BNRist, Tsinghua Univ., Beijing, China · School of IC, BNRist, Tsinghua Univ., Beijing, China · School of IC, Peking Univ., Beijing, China
We present Flash-CNNCap, a CNN-based capacitance extractor that reformulates full-matrix capacitance prediction as image-to-image regression over spatial contribution maps. Prior scalar CNN-based extractors require O(n2) forward passes to recover all pairwise capacitances in a window with n conductors. Flash-CNNCap replaces the scalar target with dense contribution maps: a total-capacitance model and a master-conditioned coupling model each predict a spatial map that is reduced to conductor-level values through mask aggregation, cutting full-matrix reconstruction to O(n) passes. The resulting totals and symmetrized pairwise couplings define the corresponding Maxwell-style capacitance matrix under the standard off-diagonal sign convention. The maps are learned from conductor-level labels without per-pixel supervision. An ablation study over 13 model configurations selects a U-Net that matches ResNet baselines on total capacitance (1.5-3.1% MARE) and achieves the strongest coupling accuracy (3.0-4.6% MARE) across all evaluated CapBench subsets, with a 17.5× full-matrix speedup on windows containing 134 conductors on average. A deployed pipeline reads Design Exchange Format (DEF) geometry and writes Standard Parasitic Exchange Format (SPEF) output, processing 1,024 windows in 51.23 seconds with a 4.4× speedup over OpenRCX on the same benchmark. Code and trained models are available at https://github.com/THU-numbda/flash-cnncap.
Hector R. Rodriguez, Jiechen Huang, Wenjian Yu
Dept. Computer Science & Tech., BNRist, State Key Laboratory of Cryptography and Digital Economy Security, Tsinghua Univ., Beijing, China
Chip placement plays an important role in physical design. While generative models like diffusion models offer promising learning-based solutions, current methods have the following limitations: they use random synthetic data for pre-training, require long sampling times, and often result in overlaps due to their dependence on gradient-based solvers during the sampling process. To overcome these issues, we propose FlowPlace, which features mask-guided synthetic data generation, flow-based efficient training with flexible prior injection, and hard constraint sampling for overlap-free layouts. Experiments on OpenROAD and ICCAD 2015 benchmarks show FlowPlace achieves better PPA metrics, 10-50× faster sampling efficiency, and zero overlaps.
Peng Xie, Ke Xue, Yunqi Shi +6
1State Key Laboratory of Novel Software Technology, Nanjing University, China · School of Artificial Intelligence, Nanjing University, China · 3Huawei Noah’s Ark Lab, China