118
The European Physical Journal Applied Physics
Correction on Electrical Potential during
Poi on rodinger teration
1E18cm-3 doping - 14nm Tox - 0->4V gate bias
All three conditions lead the boundary integrals in (1) to
vanish, making implementation in a finite element simu-
lator straightforward.
Condition (4) is especially well suited to account for
symmetries. It can be used to save CPU time by reducing
the size of the simulation domain to only half a device (in
the case of symmetric devices such as double-gate MOS-
FETs or Permeable Base Transistors, ...) or by shortening
ohmic areas.
If needed, periodic boundary conditions might also be
introduced to simulate Bloch waves. However, with such
boundary conditions, the matrices loose their band struc-
ture. This makes implementation more complex and more
CPU time consuming.
c
ca e
1
1
1
1
1
1
E-01
E-04
E-0
E-10
E-13
E-1
0
0
40
0
80
100
Iteration Number
Fig. 1. Convergence of the Schro¨dinger-Poisson decoupling
scheme for 1D simulation of a NMOS capacitor Q-V charac-
teristic.
2.2 Finite element simulation
The finite element discretization of equations (1) to (4)
is straightforward: a basis of piecewise polynomial shape
functions wi is constructed. These functions are piecewise
linear on a triangular or tetrahedral mesh, and piecewise
bi-linear on a quadrangular or hexahedral mesh. Wave
functions are projected on this basis to get a discrete
eigensystem. However, attention must be paid to the map-
ping from eigenvectors to wave functions. In this linear al-
gebraic problem, the eigenvectors do not provide directly
element method is in fact minor in comparison with its
advantages.
In another respect, a finite difference method could be
even simpler and slightly faster (as explained in the pre-
vious paragraph). We did not choose this approach how-
ever, in order to keep the latitude of simulating arbitrary
shaped devices.
the wave function values at mesh points. If numerical inte-
R
2.4 Iterative decoupling scheme
gration uses a trapezoidal rule, the matrix of
wiwj∂Ω
terms is diagonal, but is not the identity matrix.ΩThe com-
Several methods have been proposed to solve the coupled
system of Poisson and Schro¨dinger equations iteratively.
The most straightforward method consists in re-injecting
the carrier concentrations calculated from Schro¨dinger
equation in the right hand side member of Poisson equa-
tion. However, this is known to result in instabilities
which can be overcome by using under-relaxation meth-
ods. Convergence is then rather slow. A much more effi-
cient method has been proposed in [5]. It consists in devel-
oping a Newton-like method in which the Jacobian matrix
is replaced by a first order approximation. A huge amount
of mathematical work is needed to end up with approxi-
mations that are both valid and computable.
Here, we propose a new method which is altogether
simple and fast. Once electron concentration has been
computed by summing up all the wave functions contri-
butions, a “Fermi-like” potential is extracted using the
relationship which relates carrier concentration to the
electrostatic potential when a volume Boltzman statistics
holds. This quantity (which is physically meaningless in
the present situation, and must only be seen as a variable
mapping) is injected in Poisson equation, as usually done
in classical device simulators. This make Poisson equa-
tion highly non-linear but very easy to solve with a pure
Newton-Raphson procedure. The procedure is iterated un-
til convergence is reached.
ponent number i of any eigenvector is the product of the
corresponding wave function at node number i by a factor
R
Ω wi2∂Ω. On the other hand, if the integrals are computed
exactly, the above mentioned matrix is even not diagonal,
and must be first diagonalized. This is the only CPU time
overhead in comparison with finite difference schemes.
2.3 Discussion of alternative methods
An alternative way to discretize Schr¨odinger equation has
been proposed in the literature [3,4]. There, the piecewise
polynomial shape functions wi are replaced by sine func-
tions, with space coordinates splitting, in order to decor-
relate the minimum wave function wavelength from the
choice of the mesh size. However, although attractive at
first sight, this method gives full matrices while finite el-
ement and finite difference schemes lead to sparse ma-
trices. Moreover, the only boundary which can be han-
dled is condition (2), and it seems very difficult to extend
this method to arbitrarily shaped structures. Finally, the
smallest period which can be introduced with this method
is in fact the same as with our more classical discretiza-
tion scheme. This can be illustrated in the 1D case. If L
is the structure length, the smallest wavelength which can
be simulated is 2L/N in both cases, N representing the
number of terms in the sine expansion in one case and
Convergence is extremely fast, as shown in Figures 1
N +1 representing the number of mesh points in our case. and 2. Figure 1 shows the number of iterations needed to
It means that both methods actually lead to similar ma- bring the relative correction below 10−12 during the sim-
trix sizes, so that the only potential drawback of the finite ulation of the Q-V characteristic of an NMOS capacitor