Graph Attention-Based Symmetry Constraint Extraction for Analog Circuits
원문 초록
In recent years, analog circuits have received extensive attention and are widely used in many emerging applications. The high demand for analog circuits necessitates shorter circuit design cycles. To achieve the desired performance and specifications, various geometrical symmetry constraints must be carefully considered during the analog layout process. However, the manual labeling of these constraints by experienced analog engineers is a laborious and time-consuming process. To handle the costly runtime issue, we propose a graph-based learning framework to automatically extract symmetric constraints in analog circuit layout. The proposed framework leverages the connection characteristics of circuits and the devices' information to learn the general rules of symmetric constraints, which effectively facilitates the extraction of device-level constraints on circuit netlists. The experimental results demonstrate that compared to state-of-the-art symmetric constraint detection approaches, our framework achieves higher accuracy and F1-score.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Heterogeneous Graph Attention Network With Multimodal Feature Selection for Cancer Multiomics Integration
Following the Clues: Experiments on Person Re-ID using Cross-Modal Intelligence
AST-Enhanced or AST-Overloaded? The Surprising Impact of Hybrid Graph Representations on Code Clone Detection
STAMImputer: Spatio-Temporal Attention MoE for Traffic Data Imputation
Learning Pyramid-structured Long-range Dependencies for 3D Human Pose Estimation
Unsupervised Graph Clustering with Deep Structural Entropy
토론
이 논문과 연결된 포럼 글이 아직 없습니다.