In this work, the initial sizes of the MOS transistors for the three OTAs are encoded in
Table 2,
Table 3 and
Table 4. It can be seen that the channel length (
L) is established by a multiple of the technology, while the widths (
W) are the design variables for different sets of transistors and for each OTA topology. Specifically, the channel length is a multiple of LAMBDA when working with 180 nm CMOS technology, being
m
m. The sizing methodology for the OTA topologies is described as follows.
4.1. Sizing Methodology
Advancements in semiconductor fabrication technology have made non-ideal effects increasingly prominent, rendering traditional design methodologies (such as the square-law model) inaccurate and leading to significant discrepancies between theoretical predictions and SPICE simulation results. To address this issue, the
methodology has been adopted from one decade ago [
22]. This sizing technique employs lookup tables (LUTs), generated through DC analysis using BSIM models, to establish relationships among key parameters such as transition frequency (
), intrinsic gain (
), current density (
), and transconductance efficiency (
). The LUTs are generated once, and are computationally efficient, and reusable across the design process [
23].
During the CMOS design of the OTAs, one must select target values for
, drain current (
), and channel length (
L). Afterwards, each transistor width (
) in each OTA design is calculated through the following equation:
where
retrieves the current density (
) associated with a given
and
L. This process achieves a desired circuit performance that aligns closely with SPICE simulations, enabling precise and predictable control over transistor electrical parameters [
24].
The MATLAB R2024a code proposed in [
25] automates the generation of LUTs and extracts
W values for the selected
L and biasing conditions of each MOS transistor, based on a predefined SPICE netlist. One issue is how to ensure that
relationships are multiples of
. This was solved by performing an integer encoding process along with the generation of the SPICE netlists [
26]. Basically, this requires defining a global parameter
(LAMBDA) in the SPICE netlist, so that
Ws are expressed as multiples of
, as shown in Listing 1. Thus, each transistor’s width (
) is calculated as
, where
is a dimensionless integer and X denotes each design variable in the OTA topologies.
| Listing 1. Example of using λ as parameter scaling in a SPICE netlist. |
| .PARAM LAMBDA = 0.09u |
| M_P D G S B PMOS L=1u W={Var1∗LAMBDA} |
| M_P D G S B NMOS L=1u W={Var2∗LAMBDA} |
The sizing values for the MOS transistors that are obtained via the
method are summarized in
Table 5, for each OTA topology, and include the transistor widths (
) from
Table 2,
Table 3 and
Table 4. Some electrical characteristics are also summarized in
Table 6, such as open-loop gain (
), bandwidth (
), transconductance, margin phase, and voltage offset.
4.2. NSGA-II Algorithm
The sizing results given in
Table 5 are useful if the design does not require a linear transconductance gain of the OTA. In fact, in the majority of cases, the automated
characterization does not ensure constant transconductance across a linear region, as the one shown in
Figure 10. To address this limitation, the proposed work shows the optimization of OTAs to achieve a linear transconductance by combining the
method and NSGA-II algorithm. This sizing approach handles discrete integer variables (
) during design-space exploration and optimizes multiple objectives simultaneously under defined constraints [
27]. The sizing process also involves generating SPICE netlists that manipulate integer values that multiply LAMBDA, to produce individuals mapped to the OTA’s physical sizing parameters.
NSGA-II has proven its usefulness for solving complex multi-objective optimization problems in analog integrated circuit design [
28]. This evolutionary algorithm excels at balancing the trade-offs between conflicting performance parameters during CMOS OTA transistor sizing.
The proposed automated sizing methodology encodes the OTA circuits in a SPICE-compatible netlist. A DC analysis evaluates the transconductance gain by sweeping the input voltage (from −0.2 V to 0.2 V) and measuring the corresponding output current, plotted on the
I–
V plane.
Figure 10 contrasts the ideal
I–
V curve with that of a physical CMOS OTA, revealing deviations induced by nonlinearities.
The goal is to maximize transconductance linearity within the [−0.2 V … 0.2 V] range, quantified via the root-mean-squared error (RMSE) that is evaluated by Equation (
10). This metric computes the RMS deviation among
n sampled points from the ideal and actual current curves, ensuring predictable performance for critical applications such as memristor emulator design.
In the proposed work, NSGA-II is executed by generating an initial population of 20 individuals. These individuals are seeded with baseline values obtained through the
methodology, as given in
Table 5 to provide reasonable starting points and constrain the search space. Each individual represents a complete set of transistor dimensions for a specific OTA topology, encoded as integer variables
in the range [40 … 8000]. These integers correspond to multiples of the technology parameter
, directly determining the physical
ratios of the transistors. Therefore, the objective function is devoted to maximizing a linear transconductance, its associated DC gain, and the inverse value of the power consumed, as given in Equation (
11), which includes some constraints.
The algorithm is executed over 50 generations, with each iteration following the standard NSGA-II workflow (Algorithm 1) to optimize the three objectives defined in Equation (
11). The evaluation phase performs SPICE simulations to accurately assess each candidate OTA’s performance metrics, including open-loop voltage gain (
), bandwidth (
), low power and a special focus on transconductance linearity. This simulation-based approach provides significantly more accurate performance evaluation compared to initial analytical approximations, enabling reliable optimization of the OTA topologies.
| Algorithm 1 NSGA-II algorithm |
- 1:
Define: Number of generations , Population size , Size of bits for the individuals, Search spaces of the MOSFET parameters (channel W and L) - 2:
Create a SPICE netlist of the OTA being optimized - 3:
Initialize the population P based on the first iteration of the design variables using method - 4:
Update the design variables values in the SPICE netlist *.lib - 5:
Assign rank (level) based on Pareto dominance - sort - 6:
Generate child population - 7:
Binary tournament selection - 8:
Recombination and mutation - 9:
for to do - 10:
for each Parent and Child in Population do - 11:
Assign Rank (level) based on Pareto - sort - 12:
Generate sets of non-dominated vectors along PF - 13:
Loop (inside) by adding solutions to the next generation starting from the first front until N individuals found determine crowding distance between points on each front - 14:
end for - 15:
Select points (elitist) on the lower front (with lower rank) and outside a crowding distance - 16:
Create next generation0 - 17:
Binary tournament selection - 18:
Recombination and mutation - 19:
end for - 20:
- 21:
return Population from last generation = 0
|
The optimization process employs simulated binary crossover (SBX), a recombination operator designed for real-valued representations that emulates the behavior of single-point crossover in binary-coded genetic algorithms [
29]. In SBX, two parent solutions are combined to produce two offspring whose genes are distributed around the parents’ values according to a probability density function controlled by the distribution index
. A higher
value results in offspring closer to their parents (exploitation), whereas a lower
promotes greater diversity (exploration). In this study, the crossover probability
indicates that recombination occurs in 90% of mating events, and the chosen
provides a balance between exploring new regions of the design space and preserving promising traits from the parents.
Complementing this, polynomial mutation introduces small stochastic perturbations in the offspring’s design variables, ensuring sufficient diversity within the population [
29]. This operator modifies each variable with a mutation probability of
, according to a polynomial probability distribution governed by the distribution index
. Higher
values produce smaller, fine-grained mutations (favoring local search), while lower values allow larger variations (favoring global exploration). By applying controlled perturbations, polynomial mutation helps prevent premature convergence and enhances the algorithm’s ability to escape local optima, thereby improving the robustness of the optimization process.
A critical implementation aspect involves handling design constraints, particularly DC offset, phase margin, transistor saturation conditions, and minimum gain/bandwidth requirements to ensure compliance with target specifications from
Table 1. These constraints are incorporated through a penalty mechanism that progressively guides the population toward feasible solutions while maintaining diversity.
The algorithm converges to a Pareto front (PF) of non-dominated solutions representing optimal trade-offs between competing objectives. For the CMOS OTA design, this translates to a configuration set ranging from high-gain/low-speed versions to moderate-gain/wide-bandwidth designs, including intermediate options that balance both parameters while maintaining linear transconductance response.
Figure 11 outlines the proposed systematic methodology integrating these computational techniques.
Final sizing results for the optimization of the three OTA topologies provide the transconductance shown in
Figure 12,
Figure 13 and
Figure 14, displaying all 20 candidate solutions for each OTA topology.
Table 7 summarizes the optimal configurations, with the best linearity performance (indicated by thick lines in the figures) selected from the Pareto-optimal set.
Table 8 summarizes the parameters extracted for the OTAs and compares them with those reported for the topology in [
13], under equivalent operating conditions. These values were obtained from
Figure 15 and
Figure 16, which correspond to the DC and AC analyses, respectively.