ATOM an Automatic Topology Synthesis Framework for Operational Amplifiers
ATOM an Automatic Topology Synthesis Framework for Operational Amplifiers
This is the author's version which has not been fully edit
content may change prior to final publication. Citation information: DOI 10.1109/TCAD.2024.3463534
Authorized licensed use limited to: UNIVERSITY OF SOUTHAMPTON. Downloaded on December 24,2024 at 12:51:44 UTC from IEEE Xplore. Restrictions apply.
© 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.See https://www.ieee.org/publications/rights/index.html for more information.
This article has been accepted for publication in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. This is the author's version which has not been fully edit
content may change prior to final publication. Citation information: DOI 10.1109/TCAD.2024.3463534
B. Variational Autoencoder for Directed Acyclic Graphs opamp’s frequency response, and this behavioral-level simpli-
The directed acyclic graph (DAG) variational autoencoder fication captures the primary behavior of the opamps. Com-
(DVAE) [13] is a powerful generative model comprising pared with transistor-level topology optimization approach,
two neural networks: an encoder network parameterized by behavior-level topology optimization offers the advantages of
ϕ that transforms a DAG g into a low-dimensional latent reduced computational complexity and faster exploration of
representation z and a decoder network parameterized by θ design alternatives while maintaining the necessary precision.
that reconstructs g from z. The encoder and decoder are Though transient specifications cannot be measured directly at
denoted as qϕ (z|g) and pθ (g|z), respectively. They are trained the behavioral level, they can be addressed during behavior-
together by maximizing the evidence lower bound L: level topology optimization by estimating their values using
component parameters and the currents of amplification stages.
L(ϕ, θ) = Ez∼qϕ (z|g) log [pθ (g|z)] − KL [qϕ (z|g)||p (z)] , (2) In this brief, we use three-stage opamps as an example
to demonstrate the topology synthesis capability of ATOM.
where Ez means the expectation computed with respect to This choice is due to the high gain requirements in various
z, and KL[·||·] refers to the Kullback-Leibler divergence that applications, as well as the high design complexity and large
measures the similarity between two probability distributions. topology design space of three-stage opamps. Following [14],
The prior p (z) is typically a Gaussian distribution. we categorize three-stage opamps into two types: opamps with
Miller-compensated inner amplifiers (Type I) and opamps with
III. P ROPOSED A PPROACH uncompensated inner amplifiers (Type II). For both types,
we propose a functional module decomposition approach that
This section presents ATOM, a fully automatic opamp decomposes opamps into functional modules. As shown in
topology synthesis framework. The framework of ATOM is Fig. 1(a), both types of topologies comprise ten modules:
depicted in Fig. 1. We first construct a behavior-level topology three main amplification stages AMP1-AMP3, two feedback
design space for opamps. Next, we design a DAG representa- modules FB1-FB2, three feedforward modules FF1-FF3, and
tion for opamp topologies and employ DVAE to convert the two loads LD1-LD2. The parasitic components, R and C, are
DAGs into continuous topological representations. Finally, we omitted in Fig. 1(a) for brevity. This functional module decom-
develop freeze-thaw BO to efficiently explore the continuous position disentangles the compensation structure of opamps
topology space and identify high-quality opamp topologies. and simplifies the functionality of each module.
To determine the types of different modules, we refer to a
FB1 FB1 comprehensive analysis of module structures in opamp topolo-
FB2 FB2
gies presented in [14]. This ensures the interpretability of the
AMP1 AMP2 AMP3 AMP1 AMP2 AMP3
topologies within our design space. The polarity of AMP1-
- + - + - +
input
LD1 LD2
output input
LD1 LD2
output AMP3 is determined by the requirements of each opamp type.
Main Amplifiers The allowed types for other modules are summarized as
Feedback FF1 FF1
ground ground
Feedforward FF3 FF3
• FB1, FB2: Miller capacitor, Nulling resistor, Active ca-
FF2 FF2
Load pacitive feedback with positive/negative polarity of gm ,
Type I Type II
and No connection. 5 types.
(a) Opamp Topology Design Space • FF1-FF3: With/without feed-forward stage. 2 types.
Input DAG Dataset G
Reconstruction Likelihood
Reconstructed DAG Dataset G’ • LD1, LD2: With/without serial RC. 2 types.
input input The unique functionalities of different modules enable any
DVAE DVAE
Encoder
Latent
Decoder combination of these modules, within the allowed types, to
AMP1 FF1 Space Z AMP1 FF1
constitute a valid three-stage opamp topology. Comprising
FF2
LD1
AMP2 q (z | g ) p ( g | z ) FF2
LD1
AMP2 1600 topologies, our design space not only offers a good
FF3 LD2
FB1
FF3 LD2
FB1
coverage of the manually designed topologies in the review
ground
AMP3 FB2
ground
AMP3 FB2
article [14], but also contains novel topologies with good per-
output output
formance. Expanding the design space may introduce unvali-
(b) Continuous Topological Representation Learning dated, uninterpretable modules, thereby increasing the sparsity
of high-quality solutions and complicating the identification of
znew from Latent
Freeze-thaw Predict Freeze-thaw these solutions within the design space.
Space Z Predicted Quality of
z1, …, zN from
Gaussian
z1, …, zN, and znew
Selection To ensure the stability and proper functionality of opamps,
Process Model Scheme the opamp gain is required to monotonically decrease with
Candidate Basket
Update Update Select frequency, and the distribution of poles and zeros is carefully
Simulated Evaluate Decode
monitored. No right-half-plane poles are allowed, and the
Topology t* Representation z*
Quality of t*
quality factor Q is restricted to be between 0.6 and 0.8.
(c) Freeze-thaw Bayesian Optimization
Authorized licensed use limited to: UNIVERSITY OF SOUTHAMPTON. Downloaded on December 24,2024 at 12:51:44 UTC from IEEE Xplore. Restrictions apply.
© 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.See https://www.ieee.org/publications/rights/index.html for more information.
This article has been accepted for publication in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. This is the author's version which has not been fully edit
content may change prior to final publication. Citation information: DOI 10.1109/TCAD.2024.3463534
as graph edges. We introduce an additional inductive bias into simulations to different topologies based on their predicted
our circuit graphs by setting the direction of all edges based quality, thereby enhancing efficiency.
on the signal flow, thereby simulating how opamps process The quality of a topology is defined as its optimal FOM
signals and converting the circuit graph into a DAG. The DAG while satisfying the performance constraints. We evaluate the
shown in Fig. 1(b) illustrates the Type I topology in Fig. 1(a). quality of topologies using a BO-based sizing approach [15],
Our circuit graphs accurately represent topologies in our which employs the weighted Expected Improvement (wEI)
design space, including parallel connections of functional acquisition function to handle constraints.
modules connecting the same pair of circuit nets, such as FF3 Freeze-thaw BO comprises two essential components: a
and FB1. In contrast, the graph representation in [12] cannot freeze-thaw Gaussian Process (GP) surrogate model, which
accommodate such parallel connections. Therefore, our graph predicts the quality of topologies, and a freeze-thaw selection
representation better captures the similarity of topologies and scheme, which determines the topology that requires more
allows for more accurate performance modeling. accurate evaluation through an additional round of sizing.
In the current approach, one-hot encoding is utilized as the The freeze-thaw GP model integrates GP models from two
node feature to represent module types. However, alternative levels [16]. At the upper level, one GP model characterizes
embeddings that effectively capture the semantic meanings of the quality of various topologies based on their topology
node types can be readily employed. Unlike the representation representations. At the lower level, a separate GP model
in [12], which employs a single number to indicate the module is constructed for each topology to model its quality about
type, our representation is more expressive and offers greater the number of allocated simulations. Let {zi }M i=1 denote the
extensibility. Moreover, a circuit graph can be transformed into topological representations of M topologies {ti }M i=1 , and
an opamp topology by reversing this conversion. yi = [yi1 , yi2 , · · · , yiNi ]⊤ denote the evaluation history of the
Optimizing topologies on circuit graphs is inefficient due to quality of ti , where Ni is the number of sizing rounds and
their discrete nature. To address this issue, we propose to learn yij , j = 1, · · · , Ni is the quality recorded in j rounds of sizing.
continuous topological representations leveraging DVAE [13]. The GP at the lower level for ti is yi ∼ N (fi 1i , KNi ), where
This approach allows us to utilize continuous optimization fi is the predicted quality of ti , 1i is a vector of 1’s with length
algorithms for topology optimization. The flow of continuous Ni , and KNi is a covariance matrix defined by a kernel for
topological representation learning is illustrated in Fig. 1(b). curves [16]. The GP at the upper level is f ∼ N (m, KM ),
DVAE employs a message passing process that follows where f = [f1 , f2 , · · · , fM ]⊤ , m is a constant vector with
the signal propagation direction in opamps. The same DVAE length M , and KM [i, j] = kmat [zi , zj ] where kmat is the
encoder as [13] is utilized. In our DVAE decoder, a multi-layer Matérn-5/2 kernel. By combining the above GPs, freeze-thaw
perceptron (MLP) topology classifier is employed to determine GP models the evaluation history of all visited topologies as
the type of opamp to be reconstructed. Subsequently, the Z
main amplification stages in the DAG are reconstructed based M M M M
P {yi }i=1 |{zi }i=1 = P {yi }i=1 |f ·P f | {zi }i=1 df
on the determined opamp type. The remaining module types M
are then inferred using another MLP classifier, based on the
ZY (3)
M
reconstructed graph hidden state that is continuously updated = P (yi |fi )·P f | {zi }i=1 df
by a gated recurrent unit (GRU). i=1
The dimensions of the node hidden state and the topological The freeze-thaw GP model predicts both the mean and vari-
representation space are set to 500 and 10, respectively. Our ance of the quality of topological representations based on the
DVAE encoder and decoder are jointly trained using the loss simulation results of visited topologies. It is an online surro-
function defined in Eq. (2). A random 90%-10% training- gate model that is continuously updated during optimization
testing split is applied to all topologies in our design space. through maximum likelihood estimation, ensuring its accuracy.
The DVAE model is trained for 500 epochs on an Nvidia To mitigate the computational burden associated with topol-
2080Ti GPU. The training process completes in approximately ogy evaluation through sizing, only one topology is allowed
20 minutes. The trained DVAE achieves a 100% reconstruction to undergo an additional round of sizing in each iteration of
accuracy for all the topologies within our design space, indi- topology optimization. This topology is selected by a freeze-
cating that the learned topological representations effectively thaw selection scheme. A candidate basket is constructed to
capture the information pertaining to the opamp topologies. store the current best topological representations. During the
Our methodology can generalize to a broader design space, initial stages of topology optimization, when the basket is not
including more complex three-stage opamps and opamps with yet full, indicating an insufficient collection of high-quality
varying numbers of stages. To make our approach applicable topologies, a new representation znew found by optimizing the
across categories, the topology design space must be crafted to wEI acquisition function αwEI is selected for performance
ensure diversity while maintaining a high proportion of valid evaluation. Once the basket is filled, the benefits of conducting
topologies for different stages. The architecture of the DVAE an initial topology evaluation for znew versus a more accurate
model should be modified to increase its model capacity to evaluation for the best existing representations stored in the
achieve high reconstruction accuracy for each category. The candidate basket should be compared to select the represen-
revised DVAE model should be trained with a dataset of tation for evaluation. The benefits are measured using the en-
topologies covering various stages. tropy search (ES) acquisition function αES [17], which reflects
the expected information gain after evaluating representation
z. The representation with the highest ES value is selected for
C. Freeze-thaw Bayesian Optimization evaluation. The freeze-thaw selection scheme employs a two-
We propose a topology optimization method based on round comparison for selecting the representation, striking a
freeze-thaw BO to efficiently explore the continuous topology better balance between exploration and exploitation.
space. Freeze-thaw BO maximizes the utilization of simula- Then the trained DVAE decoder is utilized to reconstruct an
tions by integrating iterative topology evaluation processes into opamp topology from the selected representation. The type of
the topology optimization workflow. It dynamically allocates the reconstructed topology is decided by the topology classifier
Authorized licensed use limited to: UNIVERSITY OF SOUTHAMPTON. Downloaded on December 24,2024 at 12:51:44 UTC from IEEE Xplore. Restrictions apply.
© 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.See https://www.ieee.org/publications/rights/index.html for more information.
This article has been accepted for publication in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. This is the author's version which has not been fully edit
content may change prior to final publication. Citation information: DOI 10.1109/TCAD.2024.3463534
FOM
We conduct our experiments with two 2.9GHz CPUs and Fig. 2: Behavior-level opamp optimization curves plotted using
512 GB memory. The Hspice circuit simulator is utilized. the average results from the successful runs. The number
Our baselines include opamp topology optimization meth- of simulations for each method to achieve the same FOM
ods FE-GA [10] and VGAE-BO [12]. The maximum simula- (marked with the dashed lines) is given in Table II.
tion budget for each method is set to 2400. The bi-level BO
encompasses 60 upper-level iterations, each with a budget of C. Circuit Analysis
40. For ATOM, we specify a basket size of 3, 160 topology
optimization rounds, and 10 sizing iterations per round. The topologies found by ATOM include both those similar
We examine four important opamp performance metrics: to classic ones in [14] and novel topologies. The performances
Gain, unit gain frequency (UGF), phase margin (PM) and of the two best opamps found by ATOM, as illustrated in
Power. Gain, UGF, and PM are measured using behavior-level Fig 3, and the best opamps identified by baseline methods,
simulations. Power is estimated following [12]. We evaluate are presented in Table III. The opamps found by ATOM
all methods under two distinct sets of specifications (specs), achieve high UGF with low power consumption, resulting in
each utilizing a fixed load capacitor, as detailed in Table I. the highest FOM. For ATOM, the best topology for Spec1
The optimization goal is and Spec2 undergoes 14 and 9 sizing rounds, respectively.
The baselines miss the better solutions found by ATOM
UGF[MHz]×CL [pF]
maximize FOM = Power[mW] . (4) due to limited topology coverage and the sparsity of their
topology design space, inferior topological representations,
Authorized licensed use limited to: UNIVERSITY OF SOUTHAMPTON. Downloaded on December 24,2024 at 12:51:44 UTC from IEEE Xplore. Restrictions apply.
© 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.See https://www.ieee.org/publications/rights/index.html for more information.
This article has been accepted for publication in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. This is the author's version which has not been fully edit
content may change prior to final publication. Citation information: DOI 10.1109/TCAD.2024.3463534
Authorized licensed use limited to: UNIVERSITY OF SOUTHAMPTON. Downloaded on December 24,2024 at 12:51:44 UTC from IEEE Xplore. Restrictions apply.
© 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.See https://www.ieee.org/publications/rights/index.html for more information.