Proceedings of the 39th International Conference on Computer-Aided Design 2020
DOI: 10.1145/3400302.3415685
|View full text |Cite
|
Sign up to set email alerts
|

A general approach for identifying hierarchical symmetry constraints for analog circuit layout

Abstract: Analog layout synthesis requires some elements in the circuit netlist to be matched and placed symmetrically. However, the set of symmetries is very circuit-specific and a versatile algorithm, applicable to a broad variety of circuits, has been elusive. This paper presents a general methodology for the automated generation of symmetry constraints, and applies these constraints to guide automated layout synthesis. While prior approaches were restricted to identifying simple symmetries, the proposed method opera… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2
2

Relationship

2
6

Authors

Journals

citations
Cited by 24 publications
(4 citation statements)
references
References 22 publications
(20 reference statements)
0
4
0
Order By: Relevance
“…Wu et al [87] further extend the graph representation by embedding pin connection information into edge weights and generate constraints based on subgraph isomorphism with a template circuit library. Eick et al [88] directly generate constraints by pattern matching and group constraints hierarchically based on structural signal flow graphs.…”
Section: Automatic Constraint Generationmentioning
confidence: 99%
“…Wu et al [87] further extend the graph representation by embedding pin connection information into edge weights and generate constraints based on subgraph isomorphism with a template circuit library. Eick et al [88] directly generate constraints by pattern matching and group constraints hierarchically based on structural signal flow graphs.…”
Section: Automatic Constraint Generationmentioning
confidence: 99%
“…These constraints are extracted naturally as part of auto-annotation. In contrast with prior methods that are based on simulation-intensive sensitivity analysis [16] or graph traversal based exact matching to templates [4], the approach in ALIGN method [9] combines graph traversal methods with machine learning based methods and is computationally efficient, capable of finding hierarchically nested symmetry constraints even under approximate matches. Electrical constraints: ALIGN generates a layout based on a fixed netlist, and performance shifts are driven by changes in parasitics from netlist-level estimates to post-layout values.…”
Section: Constraint Generationmentioning
confidence: 99%
“…Liu et al [ 12 ] initially proposed a fast symmetric constraint detection method based on graph matching; however, this method has limited robustness and is only applicable to specific circuit structures. This work was further extended in work [ 13 ] using graph neural networks, which enable rapid retrieval of subgraphs with similar structures, thereby enhancing the algorithm’s generality. Subsequently, Kunal et al introduced a graph convolutional neural network called GANA (graph convolutional network-based automated netlist annotation for analog circuits) [ 14 ] for identifying subcircuits.…”
Section: Introductionmentioning
confidence: 99%