用图神经网络提升模拟电路连接预测准确率,解决数据少、格式不兼容问题。
Graph Neural Networks Based Analog Circuit Link Prediction
- 基于SEAL框架挖掘电路图拓扑模式,提升预测精度。
- 构建SpiceNetlist数据集,包含775个标注电路,覆盖10类元件。
- 提出Netlist Babel Fish工具,用大模型实现网表格式自动转换。
电路连接预测旨在从不完整的网表中识别缺失的元件连接,对模拟电路设计自动化至关重要。现有方法面临三大挑战:1)电路图拓扑模式利用不足导致预测准确率低;2)标注复杂导致数据稀缺,影响模型泛化能力;3)对不同网表格式适应性差,限制灵活性。本文提出GNN-ACLP方法,通过三项创新应对:首先引入SEAL框架,在电路连接预测中实现端口级准确率;其次提出Netlist Babel Fish工具,利用大语言模型结合检索增强生成(RAG),实现网表格式自动转换;最后构建SpiceNetlist数据集,包含775个标注电路,涵盖7种电路类型和10类元件。实验表明,在SpiceNetlist、Image2Net和Masala-CHAI上相比基线分别提升16.08%、11.38%和16.01%的准确率;跨数据集评估中准确率保持在92.05%至99.07%之间,体现强特征迁移能力。但其线性计算复杂度使大规模网表处理仍具挑战,需后续优化。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。