Graph Neural Networks Based Analog Circuit Link Prediction

Abstract

Circuit link prediction, which identifies missing component connections from incomplete netlists, is crucial in analog circuit design automation. However, existing methods face three main challenges: 1) Insufficient use of topological patterns in circuit graphs reduces prediction accuracy; 2) Data scarcity due to the complexity of annotations hinders model generalization; 3) Limited adaptability to various netlist formats restricts model flexibility. We propose Graph Neural Networks Based Analog Circuit Link Prediction (GNN-ACLP), a graph neural networks (GNNs) based method featuring three innovations to tackle these challenges. First, we introduce the SEAL (learning from Subgraphs, Embeddings, and Attributes for Link prediction) framework and achieve port-level accuracy in circuit link prediction. Second, we propose Netlist Babel Fish, a netlist format conversion tool that leverages retrieval-augmented generation (RAG) with a large language model (LLM) to enhance the compatibility of netlist formats. Finally, we build a comprehensive dataset, SpiceNetlist, comprising 775 annotated circuits of 7 different types across 10 component classes. Experiments demonstrate accuracy improvements of 16.08% on SpiceNetlist, 11.38% on Image2Net, and 16.01% on Masala-CHAI compared to the baseline in intra-dataset evaluation, while maintaining accuracy from 92.05% to 99.07% in cross-dataset evaluation, demonstrating robust feature transfer capabilities. However, its linear computational complexity makes processing large-scale netlists challenging and requires future addressing.

Code and data will be made available on request to the corresponding author

References in corpus (9)

• Clustering and preferential attachment in growing networks
• Predicting Missing Links via Local Information
• Learning Latent Block Structure in Weighted Networks
• Classification using Hyperdimensional Computing: A Review
• ADO-LLM: Analog Design Bayesian Optimization with In-Context Learning of Large Language Models
• Classification of Edge-dependent Labels of Nodes in Hypergraphs
• Graph Attention-Based Symmetry Constraint Extraction for Analog Circuits
• SUREL+: Moving from Walks to Sets for Scalable Subgraph-based Graph Representation Learning
• Message-Passing on Hypergraphs: Detectability, Phase Transitions and Higher-Order Information