Accelerating Comprehensive Specification Optimization of Analog Circuits Using Transient Assertions and Graph Neural Networks

As the design specifications for circuits become increasingly stringent, the demand for automation and intelligence in the sizing of analog integrated circuits (ICs) continues to grow. Algorithms are required to complete circuit optimization tasks under more comprehensive specifications. In this paper, we propose a transferable pole-zero-based transient assertion (PZTA) system. It minimizes the number of high-time-cost transient (Tran) simulations by asserting the stability of the circuit. Furthermore, we utilize a relational graph convolutional network (RGCN) as a function approximator within a reinforcement learning (RL) framework to extract more topological information from the circuits. Experimental results based on the open-source testing suite AnalogGym demonstrate that compared to RGC-NRL before and after embedding the PZTA system, the number of Tran simulations was reduced by 75.68%. Additionally, the assertion accuracy of the model achieved 99.57%.

Authors

Institutions

Publication Details

Published
2025-05-25
DOI
https://doi.org/10.1109/iscas56072.2025.11043434
Citations
1
Primary Topic
VLSI and Analog Circuit Testing
Type
article
Field-Weighted Citation Impact
2.27

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accelerating Comprehensive Specification Optimization of Analog Circuits Using Transient Assertions and Graph Neural Networks

Yanhan Zeng, Zhenxin Chen, Peng Lin, Jintao Li et al.
1 citations
VLSI and Analog Circuit Testing
2.27
article

Accelerating Comprehensive Specification Optimization of Analog Circuits Using Transient Assertions and Graph Neural Networks

Yanhan Zeng, Zhenxin Chen, Peng Lin, Jintao Li, Yu Wang, Yongfu Li
article en
1 citations

Abstract

As the design specifications for circuits become increasingly stringent, the demand for automation and intelligence in the sizing of analog integrated circuits (ICs) continues to grow. Algorithms are required to complete circuit optimization tasks under more comprehensive specifications. In this paper, we propose a transferable pole-zero-based transient assertion (PZTA) system. It minimizes the number of high-time-cost transient (Tran) simulations by asserting the stability of the circuit. Furthermore, we utilize a relational graph convolutional network (RGCN) as a function approximator within a reinforcement learning (RL) framework to extract more topological information from the circuits. Experimental results based on the open-source testing suite AnalogGym demonstrate that compared to RGC-NRL before and after embedding the PZTA system, the number of Tran simulations was reduced by 75.68%. Additionally, the assertion accuracy of the model achieved 99.57%.

University of Electronic Science and Technology of China (CN), Shanghai Jiao Tong University (CN), Guangzhou University (CN)
Natural Science Foundation of Guangdong Province
Openalex Percentile: Top 14%
VLSI and Analog Circuit Testing
2.27
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.