L EARNING TO S OLVE N ONLINEAR P ARTIAL D IFFERENTIAL E QUATION S YSTEMS T O A CCELERATE MOSFET S IMULATION
Anonymous authors
Paper under double-blind review
A BSTRACT
Semiconductor device simulation uses numerical analysis, where a set of coupled nonlinear partial differential equations is solved with the iterative NewtonRaphson method.
Since an appropriate initial guess to start the Newton-Raphson method is not available, a solution of practical importance with desired boundary conditions cannot be trivially achieved.
Instead, several solutions with intermediate boundary conditions should be calculated to address the nonlinearity and introducing intermediate boundary conditions signiﬁcantly increases the computation time.
In order to accelerate the semiconductor device simulation, we propose to use a neural network to learn an approximate solution for desired boundary conditions.
With an initial solution sufﬁciently close to the ﬁnal one by a trained neural network, computational cost to calculate several unnecessary solutions is signiﬁcantly reduced.
Speciﬁcally, a convolutional neural networks for MOSFET (Metal-Oxide-Semiconductor Field-Effect Transistor), the most widely used semiconductor device, are trained in a supervised manner to compute the initial solution.
Particularly, we propose to consider device grids with varying size and spacing and derive a compact expression of the solution based upon the electrostatic potential.
We empirically show that the proposed method accelerates the simulation by more than 12 times.
Results from the network architecture and the local linear regression are compared and extension to a complex two-dimensional domain is sketched.
I NTRODUCTION
Nonlinear partial differential equations (PDEs) appear frequently in many science and engineering problems including transport equations for certain quantities like heat, mass, momentum, and energy (Fischetti & Vandenberghe, 2016).
The Maxwell equations for the electromagnetic ﬁelds (Jackson, 1999), which govern one of the fundamental forces in the physical world, is one of the examples.
By calculating the solution of those equations, the status of system-under-consideration can be characterized.
In the machine learning society, solving a set of coupled partial differential equations has become an important emerging application ﬁeld.
(de Avila Belbute-Peres et al., 2020;
Sanchez-Gonzalez et al., 2020)
Among many nonlinear partial differential equations, we consider the semiconductor device simulation (Grasser et al., 2003).
The simulation is a pivotal application to foster next-generation semiconductor device technology at scale.
Since the technology development heavily relies on the device simulation results, if the simulation time reduces, the turnaround time also signiﬁcantly reduce.
In order to reduce the simulation time, acceleration techniques based upon the multi-core computing have been successfully applied (Rupp et al., 2011; Sho & Odanaka, 2017).
However, the number of cores cannot be exponentially increased and the cost also increases drastically as the number of cores involved increases.
Moreover, as engineers submit many simulation jobs for a group of semiconductor devices, computing resources available to each simulation job is limited.
As an alternative, we propose to improve the efﬁciency of the simulation per se .
In the semiconductor device simulation, a solution of a system of partial differential equations is numerically calculated with a certain boundary condition.
Those differential equations are coupled together and the overall system is highly nonlinear.
The Newton-Raphson method (Stoer & Bulirsch, 2002) is known to be one of the most robust methods to solve a set of coupled nonlinear equations.
When the method converges to the solution, the error decreases rapidly as the Newton iterations proceed.
To achieve a rapid convergence, it is crucial that initial guess for the solution needs to be close enough to the real solution; otherwise, the method converges very slowly or may even diverge.
Although we are interested in obtaining a solution at a speciﬁc boundary condition which is determined by an applied voltage, even obtaining an approximated solution to initiate the NewtonRaphson method successfully is challenging.
In literature, in order to prepare an initial guess for the target boundary condition, several intermediate boundary conditions are introduced and solutions with those boundary conditions are computed sequentially (Synopsys, 2014).
It, however, increases the overall computation time signiﬁcantly.
If the initial solution that is sufﬁciently close to the ﬁnal one is provided by any means, we can save huge computational cost of calculating several unnecessary solutions.
Instead, we propose to learn an approximate initial solution of a set of coupled PDE for a target boundary condition by an artiﬁcial neural network.
Speciﬁcally, when a set of labeled images is available, a neural network can be trained to generate a similar image for a given label.
The trained model generates a numerical solution for a target boundary condition.
We show that the proposed initial solution by our method can speed up the device simulation signiﬁcantly by providing a better initial guess.
We summarize our contributions as follows:
• We derive a compact solution for PDE systems based on the electrostatic potential.
As a result, the network size is reduced by a factor of three.
Since the electrostatic potential is well bounded, the normalization issue can be avoided.
• For addressing various semiconductor devices, we propose a device template that can address various device structures with a set of hyper-parameters.
Since the electrical characteristics of semiconductor devices are largely determined by the physical sizes of internal components, handling grids with varying size and spacing is particularly important.
• We propose a convolutional neural networks which generate the electrostatic potential from the device parameters.
It can be used to accelerate the device simulation.
• Compared with the conventional method, the simulation time is signiﬁcantly reduced (at least 12 times) with the proposed method while the numerical stability is not hampered.
• Our approach can be extended to the complex two-dimensional domains.
Preliminary results are shown.
R ELATED W ORK 2. N EURAL NETWORKS FOR SOLVING DIFFERENTIAL EQUATIONS
Recently, there have been many attempts to build a neural network to solve a differential equation (Han et al., 2018; Long et al., 2018; Piscopo et al., 2019; Raissi et al., 2019;
Winovich et al., 2019; Zhu et al., 2019; Obiols-Sales et al., 2020; Lu et al., 2020; Xiao et al., 2020).
Among them, the Poisson equation is particularly of importance in the semiconductor device simulation.
The
Poisson equation plays a fundamental role in the semiconductor device simulation, by connecting the electrostatic potential and other physical quantities.
In Magill et al.
(2018), the Laplace equation (the Poisson equation with a vanishing source term) is considered for a nanoﬂuidic device.
A fully-connected neural network is trained to minimize the loss function, which combines the residue vector and the boundary condition.
The authors assume a speciﬁc two-dimensional structure and the mixed boundary condition is applied.
Another attempt to solve the Poisson equation is suggested in ¨Ozbay et al.
The Poisson equation with the Dirichlet boundary condition is considered.
It is decomposed into two equations.
One is the Poisson equation with the homogeneous Neumann boundary condition.
The other one is the Laplace equation with the Dirichlet boundary condition.
A convolutional neural network architecture is adopted and the entire source term and the grid spacing are used as the input parameters.
The network is trained with randomly generated source terms and a predicted solution shows a good agreement with the numerical solution.
In order to consider a
(a) 0.
D r a i n c u rre n t ( m A )
Drain voltage (V) 0.6V 0.7V 0.8V 0.9V 1.0V 1.1V (b) 0.
Position ( x-axis, mm )
P o s i t i o n ( y - ax i s , m m ) -5.10x
-1 -2.87x
-1 -6.40x
-2 1.59x10 -
3.82x106.05x10 -
8.28x10 -1 1.05x10 0 1.27x10
1.50x101.72x10 0 Electrostatic potential(V)
(c) complex two-dimensional geometry, a rectangular domain covering the original geometry is introduced in Winovich et al.
and a convolutional network is used.
A neural network is used to solve the Poisson equation in a L-shape domain in Lu et al.
Quite recently, it has been independently proposed to accelerate the computational ﬂuid dynamics simulations by predicting an appropriate initial guess from a convolutional neural network (ObiolsSales et al., 2020).
The basic idea is quite similar with this work and such a coincidence strongly demonstrates that the proposed approach is not restricted to a relatively narrow application domain.
2. N EURAL NETWORKS IN SEMICONDUCTOR DEVICE SIMULATION
Researchers are much interested with application of machine learning technique to the semiconductor device simulation (Carrillo-Nu ˜ nez et al., 2019; Bankapalli & Wong, 2019; Han & Hong, 2019;
Souma & Ogawa, 2020).
However, the actual research activities are quite diverse.
In many cases, the neural networks are merely used as an efﬁcient descriptor of the input-output relation without considering the internal physical quantities (Carrillo-Nu ˜ nez
et al., 2019; Bankapalli & Wong, 2019).
On the other hand, in their quantum transport simulation, Souma & Ogawa (2020) try to predict the electron density proﬁle from the electrostatic potential.
Although application of neural networks on the semiconductor device simulation is in its infancy, it has a huge potential.
P RELIMINARY : S EMICONDUCTOR DEVICE SIMULATION
We brieﬂy introduce the semiconductor device simulation as a preliminary.
As shown in Figure 1a, a multi-dimensional device structure has multiple terminals (yellow bars in the ﬁgure) whose voltages are controllable.
Since the planar MOSFET has the translational symmetry along the direction perpendicular to the plane in Figure 1a, the three-dimensional device structure can be treated as a two-dimensional one.
The terminal currents (in Ampere) under the determined terminal voltages (in
Volt) are the output of the simulator, as shown in Figure 1b.
As the motion of electrons yields the current, the terminal current itself can be only calculated from the internal physical quantities.
(See
Figure 1c.)
Since the electrons are charged particles, the electric ﬁeld due to the net charge density is also affected by the electronic motion.
Therefore, we need to consider both effects of electronic motion and electric ﬁeld by solving two equations, to calculate the terminal currents.
The ﬁrst one is the continuity equation for electrons:
[Equation]
where the electron current density vector, J n , is given by
[Equation]
where the elementary charge ( q ), the electron mobility ( µ n ), and the electron diffusion constant ( D n ) are scalar parameters and the electron density ( n ) is a position-dependent unknown variable.
Note that the current density ( J n ) also depends on the electric ﬁeld vector ( E ).
Similar relations hold for holes with minor modiﬁcation.
The second equation is the Gauss law, also called as the Poisson equation:
[Equation]
where p is the hole density, (cid:15) is the permittivity (Jackson, 1999) and N + dop is the positively charged impurity density.
Under the electrostatic approximation, the electric ﬁeld vector can be expressed in terms of the electrostatic potential ( φ ) as
[Equation]
With the electrostatic potential, the above set of equations has two unknown variables; n and φ .
Note that nonlinearity is originated from (2).
The ﬁrst term in the right-hand-side of (2) is proportional to n E , which is nonlinear with respect to unknown variables of n and φ .
Therefore, when φ is ﬁxed, the continuity equation becomes linear.
For numerical analysis, we need to discretize the equations.
In general, the i -th component of the residual vector can be written as
[Equation]
where N is the number of grid points, f i ( · ) is a nonlinear function, and s i is a constant.
s i becomes nonzero only at the boundary nodes and depends on the voltages applied to the device terminals.
Since the system is nonlinar, the solution at each boundary condition must be computed.
Detailed discussion can be found in Appendix A.
The set of discretized equations in (5) is highly nonlinear and the iterative Newton-Raphson method is used to solve the system.
Typically, a user wants to know the drain current at V G
= V D
=
V DD , where V DD is the maximum allowed voltage.
However, an appropriate initial guess to start the
Newton-Raphson method at that condition is not directly available.
Only the solution at V G = V D
=
V can be easily calculated.
Starting from the solution with all zero terminal voltages, many intermediate steps toward the target terminal voltages are introduced.
Based upon the converged solution at the previous condition as an initial guess, the next step is solved sequentially.
Detailed discussion can be found in Appendix B. Therefore, computing several intermediate boundary values is the main source of increase of computation.
Let us denote the number of boundary values simulated during the solution procedure as N step .
To evaluate the acceleration quantitatively, we deﬁne the reduction factor of the simulation time, α , and it is well approximated as
[Equation]
where τ conv is the simulation time with the conventional method while τ nn is the one with the proposed method.
Moreover, N newton is the average number of the Newton iterations per a bias condition and N directnewton is the number of the Newton iterations at the target bias condition.
Since
N step is typically larger than 10, we expect that the reduction factor can be larger than 10.
A PPROACH
It is now clear that an approximate solution for a given boundary condition is a key to accelerate the device simulation.
Instead of inventing yet another method to calculate the approximate solution efﬁciently, we propose a data driven approach by using a neural network to learn the numerical solution for desired boundary conditions.
4. C OMPACT FORM OF A SOLUTION
In (5), the residual vector has 3 N components, because we consider three internal quantities, φ , n , and p , as solution variables.
Typically, the number of grid points, N , ranges from thousands to tens of thousands.
Therefore, it is desirable to introduce a compact form of a solution.
Among various physical quantities in the semiconductor device, the electrostatic potential, φ , is a key quantity.
As discussed earlier, the nonlinearity arises from n E = − n ∇ φ in (2).
Under a ﬁxed electrostatic potential proﬁle, the electron and hole continuity equations become linear.
The continuity equation decoupled from (3) is easy to solve.
In other words, the electron and hole densities, n and p , can be readily obtained as long as a reasonably good potential proﬁle is provided.
Thus, we propose to use a neural network to generate electrostatic potential proﬁles.
By the compact form of the solution, the number of output components reduces by a factor of three.
Moreover, the electrostatic potential is well bounded in a small voltage range and varies smoothly over the device structure; no normalization of the input data is required.
4. D EVICE T EMPLATE
[Figure]
By changing the hyper-parameters, one can readily simulate various types of
MOSFETs.
The initial device design usually exhibits a sub-optimal performance as the device parameters are not optimal at the early stage of the technology development.
During the technology development cycle, numerous structures are simulated for engineers to achieve better performance.
Those devices are different in terms of the physical sizes of internal components and the doping densities.
To enable our method to address various device types, we propose a device template of MOSFETs.
By determining each hyper-parameter of the template, we simulate various types of MOSFETs.
We illustrate a device template that we use in Figure 2.
Device parameters, such as the gate length ( L G ), the oxide thickness ( t ox ), and the doping concentrations ( N sd for the source/drain regions and N sub for the substrate region) are varied within predeﬁned ranges.
For that purpose, the x -directional grid spacing under the gate terminal is adjusted and the proposed method can be applied to a set of various device structures whose grids have different spacing.
Since the electrical characteristics of semiconductor devices are largely determined by the physical sizes of internal components, handling grids with varying size and spacing is particularly important.
4. N ETWORK A RCHITECTURES
We propose a convolutional neural network to generate the two-dimensional potential proﬁle for a given boundary condition.
We design the architecture by adopting the generator part of the DCGAN (Radford et al., 2015) and illustrate it in Figure 3.
It takes the device parameters such as L G , t ox ,
N sd , and N sub and the applied terminal voltages such as V G and V D as input.
The output layer generates a 64-by-64 matrix as input for the simulation.
4.3. O BJECTIVE F UNCTION
To learn such network, we use and minimize a simple mean squared error objective function as
[Equation]
where ˜ φ i is the electrostatic potential at the i -th node, predicted by the neural network.
Afterepochs, the mean square error of the electrostatic potential is sufﬁciently reduced.
E XPERIMENTS 5. E XPERIMENTAL S ETUP
We conduct a set of experiments of MOSFET simulation (Taur & Ning, 1998).
Device structures are shown in Figures 1a and 2.
A two-dimensional grid with a size of 64-by-64 is used for all devices.
Since the number of grid points is ﬁxed, when the physical length of the MOSFET is changed, the grid spacing is also changed.
For example, with a large L G value, the distance between two neighboring points near the gate terminal becomes large.
Since N is 64 × 64 = 4,096, the solution vector has 3 N = 12,288 unknown variables.
We apply voltages to the gate terminal ( V G ) and the drain terminal ( V D ) to draw a current through the drain terminal ( I D ).
The room temperature is assumed to be 300 K throughout the experiments.
We train our network in supervised fashion with the backpropagation algorithm on Pytorch 1.4.0 library.
For the Adam optimizer, hyper-parameters such as the learning rate of 10 − 4 , the L2 regularization coefﬁcient of 10 − 7 , and the batch size of 16, are used.
5.1. D ATASET
We use a simulator by Han & Hong (2019) as it is free from the license and the source code is publicly available.
Detailed description on the simulator can be found in Appendix C. Each data point is speciﬁed with parameters of L G , t ox , N sd , N sub , V G , and V D and their ranges are summarized in
Appendix D. We curate the dataset with 10,112 instances that are randomly selected.
We split the dataset by training, validation and test set by 70 % of the selected devices are the training set and the others in the validation (20 % ) and test (10 % ) sets.
We will publicly release our splits for the future research in this avenue.
The training and validation errors can be found in Appendix D.
5.1. C OMPARISON WITH THE C ONVENTIONAL M ETHOD
As our primary goal is to accelerate the semiconductor device simulation with help of the initial solution obtained by the neural network, we evaluate the speed up of the device simulation algorithm compared to the conventional method.
Speciﬁcally, we report the number of the Newton iterations for the converged solution at the target bias condition ( V G = V D = 1.1 V).
When the maximum potential update is smaller than 10 − 10 V, the convergence criterion holds.
By the conventional method, starting from the equilibrium condition of V G = V D = 0.0 V, we ﬁrst increase the drain voltage up to 1.1 V. After that, the gate voltage is raised up to 1.1 V, which is called bias ramping .
During the bias ramping, a uniform voltage step is applied and the solution at the previous boundary condition is used as the initial guess.
When the voltage step is small enough, every simulation is successfully ﬁnished to get a ﬁnal solution.
However, with a large voltage step, some simulation runs may fail.
In other words, the simulation is numerically unstable with a large voltage step.
We also report the ratio of the failed runs to the total simulation runs to check the numerical stability.
In contrast, by our method, when the neural network provides the approximate solution, we start the simulation directly at the target bias condition.
We compare the number of the Newton iterations for the converged solution with the one by the conventional bias ramping method with a uniform voltage step.
5. R ESULTS FROM THE CNN
In this subsection, the results from the CNN are presented.
After the training phase is ﬁnished, the trained neural network can be used to generate an approximate potential in the inference phase.
Figure 4a shows the electrostatic potential proﬁle generated by the trained neural network.
The parameters of the MOSFET are L G = 96 nm, t ox = 3.5 nm, N sd = 4.8 × 10 20 cm − 3 and N sub = 1.8 × 10 18 cm − 3 .
The bias condition is V G = V D = 0.
V. The potential difference between the predicted potential proﬁle and the numerical solution, shown in Figure 4b, reveals that the maximum difference is around 0.
V. The device in Figure 4a has a longer gate, L G = 164 nm.
Other parameters are also changed to t ox = 3.1 nm, N sd = 2.1 × 10 20 cm − 3 and N sub = 2.0 × 10 18 cm − 3 .
Regardless
L G , the neural network can predict the electrostatic potential at a given bias condition ( V G = 0.05 V and V D = 0.66 V) accurately.
[Figure] [Figure]
[Figure]
We demonstrate that the trained neural network generates the electrostatic potential proﬁle close to the numerical solution in Figures 4 and 5.
For 1,012 samples in the test set, average and variance of the maximum absolute potential error is 92 mV and 0.0016 V 2 , respectively.
The convergence behavior of the Newton-Raphson method is shown as a red curve in Figure 6a.
With only ﬁve
Newton iterations, the maximum potential update becomes smaller than 10 − 10 V. Note that as the initial update is quite small, about 0.1 V, the fast convergence is achieved.
On the other hand, the conventional method with a uniform voltage step of 0.275 V (green curves) takes 40 iterations to reach the same result of our method.
For each voltage condition, it takes only ﬁve iterations.
However, after an intermediate boundary condition is solved, the next boundary condition should be solved again.
Therefore, the green curves have peak values at every ﬁve iteration.
Here, we achieve signiﬁcant computation reduction factor of 8.
5.2. N UMERICAL S TABILITY
In order to demonstrate the numerical stability of our method, the voltages beyond the training range are tested in Figures 6b and 6c.
In Figure 6b, the drain voltage larger than 1.1 V is directly solved.
For each drain voltage, 100 devices are generated and tested.
Even for a high drain voltage of 2.2 V, the failure rate is just 4 % .
We perform a similar test for the gate voltage larger than 1.1 V in Figure 6c.
Although the failure rate increases sharply above 1.9 V, it remains quite small up to 1.8 V. These
T e s t c a s e ( 1 )
Iteration (1)
Number of total cases :
Failure count :(
a) 0.367V
C a s e ( 1 )
Iteration (1) 14.7% failure 1.7% failure
No failure 10.4% failure (b) 91.
[Figure] [Figure]
NeuralNetwork
[Figure] [Figure]
[Figure] [Figure]
M e a n i t er a t
i o n ( 1 )
Ramping process 0.0 2.0x104.0x10 1 6.0x
[Figure]
8.0x10 1 1.
[Figure]
1.2x10 2 1.4x101.6x
F a il u re c o un t () (c) examples clearly demonstrate that the trained neural network can provide a sufﬁciently good initial potential proﬁle.
5.2. A PPLICATIONS TO M ANY D EVICES
We now investigate the applicability of our method to many devices.
We evaluate our method on 1,000 different devices that are randomly generated.
The simulation starts at V G
= V D = 1.
V.
We show the distribution of the Newton iterations in Figure 7a.
Among 1,000 test instances, only two samples fail to converge.
For most cases (more than 99.7 % ), four or ﬁve iterations are required for the converged solution.
On the other hand, when the conventional method is applied, the number of the Newton iteration increases signiﬁcantly as shown in Figure 7b.
In the conventional method, the voltage step is an important parameter to control the numerical stability and the speed.
When we adopt a small voltage step of 0.1 V, there occurs no failure case.
In this case, about 90 Newton iterations are needed to have the converged solution and the simulation is almost 20 times slower than the proposed approach.
We may try to increase the voltage step for numerical efﬁciency.
When the voltage step is 0.22 V, the number of the Newton iterations is reduced almost a factor of 2.
However, the failure rate is larger than 10 % , which is certainly not tolerable.
Even with a very large voltage step of 0.367 V, the number is 21, which is much larger than that of the proposed approach.
These observations are summarized in Figure 7c and Table 1.
For the conventional method, there exists a trade-off between the numerical stability (related with the failure rate) and the simulation speed (related with the number of iterations).
Our proposed approach exhibits both superior numerical stability and short simulation time.
When the failure rate is limited up to 1%, the reduction factor of the simulation time is larger than 12.
The speedup is obtained with a cost of building the training dataset.
If the number of inference runs is not large enough, the speedup by adopting the neural network will not yield any performance merit.
However, it is noted that the semiconductor device simulator is typically developed by a developer group (a company or a research group) and distributed to several users.
The simulation time experienced by the user is the most important metric to justify the additional cost of the developer group.
Moreover, the total number of inference runs by the entire user group can easily exceed the number of data points in the training set.
Similar cases may be found in other research ﬁelds, where the developer and user groups of the numerical simulators are well separated.
5. C OMPARISON
As an alternative to the proposed neural network, we implement the local linear regression (Garimella) to predict an initial guess.
For each prediction, we use the subset that has the closest dataset from input x 0 with a ratio of β to the whole dataset.
The weight function is the tri-cube weight function,
[Equation]
where d is the normalized Euclidean distance.
With cross-validation, we ﬁnd that the fraction coefﬁcient, β is 0.2.
We perform the same convergence test for many devices by using the local linear regression.
As a result, the expected number of iterations is 6 .
5 and the failure rate is 2 .
More
[Table]
results can be
Appendix E. Clearly, the neural network outperforms the local linear regression in terms of the numerical stability.
Moreover, in order to apply the regression, we need the densely-sampled dataset at each inference run.
Since there exist several users, it is not practical to deliver the densely-sampled dataset to each user.
The is a more efﬁcient way approximate the
-sampled
5. E XTENSION TO A C OMPLEX T WO -D IMENSIONAL D OMAIN
[Figure]
Up to now, we have used a device template to describe various MOSFETs.
In this subsection, a preliminary result about extension of our approach to a complex two-dimensional domain is presented.
In Figure 8a, an unstructured mesh for a MOSFET is shown.
A network shown in Figure 8b learns the electrostatic potential in supervised fashion.
In this example, the output of the internal CNN in
Figure 8b is mapped into the original unstructured mesh.
More information about the structure and the training/validation error can be found in Appendix F.
The electrostatic potential is generated by the trained neural network, as shown in Figure 8c.
Since the maximum potential error is lower than 76 mV, it can be used as an approximate solution.
C ONCLUSION
We train a convolutional neural network to generate the electrostatic potential required for the semiconductor device simulation.
By using the generated electrostatic potential as an initial guess, the target bias conditions can be simulated directly without a time-consuming ramping procedure.
Our proposed approach can address a set of various device structures whose grids have different spacing.
Moreover, we suggest a compact expression for the solution based upon the electrostatic potential to reduce the computational complexity.
In the empirical validations with two-dimensional MOSFETs, the simulation time has been signiﬁcantly reduced (more than 12 times) with the proposed method while the numerical stability is not hampered.
As deep neural networks perform well when a sufﬁcient amount of data points are used in training, it is expected that the proposed approach would be accelerate the development cycle of semiconductors since massive simulation results are routinely generated during the technology optimization and are ready to be used for training such networks.
A D ISCRETIZATION OF THE SEMICONDUCTOR EQUATIONS
Typically, the ﬁnite volume method (or the box method)
(Laux & Grossman, 1985) is applied to convert the differential operator into the algebraic form.
Then, the equation is converted into a collection of algebraic equations, which are evaluated at many sampling points (called vertex nodes).
Since the original set is nonlinear with respect to n , p , and φ , the converted algebraic equations are also nonlinear.
The Newton-Raphson method is applied to the resultant set of equations.
In this section, the discretization of the semiconductor equations, (1) and (3), is sketched.
It is observed that both equations have a common form of
[Equation]
[Equation]
where F is the ﬂux term and s is the source term.
In order to get a discretized form of the above equation at a certain grid point, we integrate the equation over a ﬁnite volume (or a box) surrounding the point.
For example, in a grid shown in Figure 9, the discretized equation for the center point can be obtained by the integration over the red pentagon.
With help of the divergence theorem (Jackson, 1999), we have
[Equation]
Every node except for the terminal nodes contributes the residual vector following (10).
We must also consider the boundary conditions at the terminal nodes.
For the electron density ( n ) and the hole density ( p ), we have
[Equation]
[Equation]
(12) where n eq and p eq are the carrier densities at the equilibrium condition.
These densities do not depend on the applied terminal voltages.
However, the boundary condition for the electrostatic potential ( φ ) reads
[Equation]
(13) where φ eq is the equilibrium potential and V terminal is the applied terminal voltage.
When the applied terminal voltage changes, s i ’s in (5) at the terminal nodes change accordingly.
B B IAS RAMPING
The set of discretized equations in (5) is highly nonlinear and the iterative Newton-Raphson method is used to solve the system.
Although a nonlinear relaxation scheme to avoid the full NewtonRaphson method (Meinerzhagen et al., 1991) has been proposed, the full Newton-Raphson method is still preferred due to its robustness.
Let us consider a typical case, where a user wants to know the drain current at V G
= V D = V DD .
V DD is the maximum voltage which can be applied to the MOSFET.
For example, V DD is 1.1 V in our example.
The drain current at this bias condition is called as the ON current and the ON current represents the current-driving performance of the MOSFET.
Since the ON current is of interest, it would be most desirable to calculate the ON current immediately.
However, an appropriate initial guess to start the Newton-Raphson method at V G = V D
= V DD is not available.
When V G = V D
=
V, the device is in its equilibrium condition.
In this special case, an effective way to generate the initial guess is well known (Jungemann & Meinerzhagen, 2003).
It is based upon the charge neutrality condition, where p − n + N + dop = 0 is imposed locally.
Unfortunately, this method cannot be applied to non-zero terminal voltages.
No established method for directly solving the equation at high terminal voltages exists.
In order to overcome such a difﬁculty, the bias ramping technique is typically adopted.
Starting from the equilibrium operating condition with all zero terminal voltages, many intermediate steps toward the target terminal voltages are introduced.
Based upon the converged solution at the previous condition as an initial guess, the next step is solved with the Newton-Raphson method.
In this conventional solution method, the overall simulation time, τ conv , can be written as
[Equation]
[Equation]
where N step is the number of the entire bias conditions, τ iconv is the simulation time for the i -th bias condition, N inewton is the number of the Newton iterations for the i -th bias condition, τ single is the time spent for a single Newton iteration, and N newton is the average number of the Newton iterations.
The bias ramping heavily increases the simulation time, because it introduces a large
N step .
In this work, we propose to solve the equation set at the target terminal voltages directly without the bias ramping.
The overall simulation time with the proposed method based upon the neural network, τ nn , can be written as
[Equation]
where N directnewton is the number of the Newton iterations at the target bias condition.
Two numbers,
N newton and N directnewton , may be comparable.
It is noted that N step in (14) does not appear any more in the above equation.
The reduction factor of the simulation time, which is deﬁned as τ conv /τ nn , can be approximated with N step , as shown in (6).
C D EVICE SIMULATOR
In this work, the device simulator in Han & Hong (2019) has been used to obtain the simulation results.
As it is free from the license issue, several simulation runs can be performed simultaneously.
The Poisson equation, (3), the electron continuity equation, (1), and the hole continuity equation are coupled and solved self-consistently.
A rectangular grid with varying spacing is adopted.
Therefore, every ﬁnite volume for a grid point has four faces.
The device template is implemented to accept the device parameters (such as L G , t ox , N sd , and N sub ) as input parameters.
When the NetwonRaphson method is used, we must solve the following matrix equation:
[Equation]
[Equation]
where J is the Jacobian matrix, u is the update vector, and r is the residual vector.
It is noted that the
Jacobian matrix is very sparse in the semiconductor device simulation.
In order to solve the above equation, a sparse matrix solver, the UMFPACK library (Davis, 2004), is used.
D M ORE INFORMATION ON DATASET
More information on the dataset is provided.
Each data point is speciﬁed with parameters of L G , t ox , N sd , N sub , V G , and V D and their ranges are summarized in Table 2.
[Figure]
[Table]
We curate the dataset with 10,112 instances that are randomly selected.
as shown in Figure 10a.
The training and validation errors are measured as a function of the learning epoch as shown in Figure 10b.
[Figure]
E L OCAL LINEAR REGRESSION
We compare the distribution of the Newton iterations in Figure 11.
Two methods (the CNN and the local linear regression) are compared.
The failure rate of the local linear regression ( 2 . 1% ) is much higher than that of the CNN ( 0 . 2% ).
When the failure rate is limited up to 1% , the regression does not meet the criterion.
Moreover, the expected number of iterations ( 6 . 5 ) is also higher than that of the CNN ( 5 . 4 ).
[Figure]
gression) are compared.
F M ORE INFORMATION ON A MOSFET WITH AN UNSTRUCTURED MESH
In Figure 8a, a magniﬁed view of the mesh structure near the channel region is shown.
The entire mesh structure is shown in Figure 12.
In total, 3,505 mesh points are assigned.
The rounded regions at top describe the insulating layers, which separate different terminals.
The training and validation errors are measured as a function of the learning epoch as shown in
Figure 13.
After 100 epochs, the mean square error of the electrostatic potential is sufﬁciently reduced.