drift diffusion modeling n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Drift-Diffusion Modeling PowerPoint Presentation
Download Presentation
Drift-Diffusion Modeling

Loading in 2 Seconds...

play fullscreen
1 / 84

Drift-Diffusion Modeling - PowerPoint PPT Presentation


  • 1226 Views
  • Uploaded on

Drift-Diffusion Modeling. Prepared by Dragica Vasileska Professor Arizona State University. Outline of the Lecture. Classification of PDEs Why Numerical Analysis? Numerical Solution Sequence Flow-Chart of Equilibrium Poisson Equation Solver Discretization of the Continuity Equation

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Drift-Diffusion Modeling' - Jims


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
drift diffusion modeling

Drift-Diffusion Modeling

Prepared by

Dragica Vasileska

Professor

Arizona State University

outline of the lecture
Outline of the Lecture
  • Classification of PDEs
  • Why Numerical Analysis?
  • Numerical Solution Sequence
  • Flow-Chart of Equilibrium Poisson Equation Solver
  • Discretization of the Continuity Equation
  • Numerical Solution Techniques for Sparse Matrices
  • Flow-Chart of 1D Drift-Diffusion Simulator
classification of pdes1
Classification of PDEs

Different mathematical and physical

behaviors:

  • Elliptic Type
  • Parabolic Type
  • Hyperbolic Type

System of coupled equations for several

variables:

  • Time : first-derivative (second-derivative for wave equation)
  • Space: first- and second-derivatives
classification of pdes cont
Classification of PDEs (cont.)

General form of second-order PDEs ( 2 variables)

pde model problems
PDE Model Problems
  • Hyperbolic (Propagation)
  • Advection equation (First-order linear)
  • Wave equation (Second-order linear)
pde model problems cont
PDE Model Problems (cont.)
  • Parabolic (Time- or space-marching)
  • Burger’s equation (Second-order nonlinear)
  • Fourier equation (Second-order linear)

(Diffusion / dispersion)

pde model problems cont1
PDE Model Problems (cont.)
  • Elliptic (Diffusion, equilibrium problems)
  • Laplace/Poisson (second-order linear)
  • Helmholtz equation
well posed problem
Well-Posed Problem

Numerically well-posed

  • Discretization equations
  • Auxiliary conditions (discretized approximated)
  • the computational solution exists (existence)
  • the computational solution is unique (uniqueness)
  • the computational solution depends continuously on the approximate auxiliary data
  • the algorithm should be well-posed (stable) also
boundary and initial conditions
Boundary and InitialConditions

R

  • Initial conditions: starting point for propagation problems
  • Boundary conditions: specified on domain boundaries to provide the interior solution in computational domain

R

s

n

numerical methods
Numerical Methods
  • Complex geometry
  • Complex equations (nonlinear, coupled)
  • Complex initial / boundary conditions
  • No analytic solutions
  • Numerical methods needed !!
coupling of transport equations to poisson and band structure solvers
Coupling of Transport Equations to Poisson and Band-Structure Solvers

D. Vasileska and S.M. Goodnick, Computational Electronics, published by Morgan & Claypool , 2006.

drift diffusion approach
Drift-Diffusion Approach

Constitutive Equations

  • Poisson
  • Continuity Equations
  • Current Density Equations

S. Selberherr: "Analysis and Simulation of Semiconductor Devices“, Springer, 1984.

poisson laplace equation solution
Poisson/Laplace Equation Solution

Poisson/Laplace Equation

No knowledge of solving of PDEs

With knowledge for solving of PDEs

Method of images

Theoretical Approaches

Numerical Methods:

finite difference

finite elements

Poisson

Laplace

Green’s function method

Method of separation of variables

(Fourier analysis)

numerical solution details
Numerical Solution Details

Governing Equations ICS/BCS

System of Algebraic Equations

Equation (Matrix) Solver

ApproximateSolution

Discretization

φi (x,y,z,t)

p (x,y,z,t)

n (x,y,z,t)

Continuous Solutions

Finite-Difference

Finite-Volume

Finite-Element

Spectral

Boundary Element

Hybrid

Discrete Nodal Values

Tridiagonal

SOR

Gauss-Seidel

Krylov

Multigrid

D. Vasileska, EEE533 Semiconductor Device and Process Simulation Lecture Notes,

Arizona State University, Tempe, AZ.

what is next
What is next?
  • MESH
  • Finite Difference Discretization
  • Boundary Conditions
slide19

MESH TYPE

The course of action taken in three steps is dictated by the nature of the problembeing solved, the solution region, and the boundary conditions. The mostcommonlyused grid patterns for two-dimensional problems are

Common grid patterns: (a) rectangular grid, (b) skew grid, (c) triangular grid,(d) circular grid.

slide22

Finite Difference Schemes

Before finding the finite difference solutions to specific PDEs, we will look at how

one constructs finite difference approximations from a given differential equation.This essentially involves estimating derivatives numerically. Let’s assume f(x) shown below:

Estimates for the derivative of f (x) at P using forward, backward, andcentraldifferences.

slide23

Finite Difference Schemes

We can approximate derivative of f(x), slopeor the tangent at P by the slope of the arc PB, giving the forward-difference formula,

or the slope of the arc AP, yielding the backward-difference formula,

or the slope of the arc AB, resulting in the central-difference formula,

slide24

Finite Difference Schemes

We can also estimate the second derivative of f (x) at P as

or

Any approximation of a derivative in terms of values at a discrete set of points is

called finite difference approximation.

slide25

Finite Difference Schemes

The approach used above in obtaining finite difference approximations is rather

intuitive. A more general approach is using Taylor’s series. According to the wellknown

expansion,

and

Upon adding these expansions,

where O(x)4 is the error introduced by truncating the series. We say that this erroris of the order (x)4 or simply O(x)4. Therefore, O(x)4represents terms thatare not greater than (x)4. Assuming that these terms are negligible,

slide26

Finite Difference Schemes

Subtracting

from

We obtain

and neglecting terms of theorder (x)3 yields

This shows that the leading errors of the order (x)2. Similarly, the forward and backward difference formula have truncation errors of O(x).

poisson equation linearization
Poisson Equation Linearization
  • The 1D Poisson equation is of the form:
finite difference representation
Finite Difference Representation

Equilibrium:

Non-Equilibrium:

n calculated using PM coupling and p still calculated

as in equilibrium case (quasi-equilibrium approximation)

criterion for convergence
Criterion for Convergence

There are several criteria for the convergence of the iterative procedure when solving the Poisson equation, but the simplest one is that nowhere on the mesh the absolute value of the potential update is larger than 1E-5 V.

This criterion has shown to be sufficient for all device simulations that have been performed within the Computational Electronics community.

a linearized scheme
(a) Linearized Scheme
  • Within the linearized scheme, one has that
  • This scheme can lead to substantial errors in regions of high electric fields and highly doped devices.
numerical methods1
Numerical Methods

Objective: Speed, Accuracy at minimum cost

  • Numerical Accuracy(error analysis)
  • Numerical Stability(stability analysis)
  • Numerical Efficiency (minimize cost)
  • Validation (model/prototype data, field data, analytic solution, theory, asymptotic solution)
  • Reliability and Flexibility(reduce preparation and debugging time)
  • Flow Visualization(graphics and animations)
iterative methods
Iterative Methods
  • Iterative (or relaxation) methods start with a first approximation which is successively improved by the repeated application (i.e. the “iteration”) of the same algorithm, until a sufficient accuracy is obtained.
  • In this way, the original approximation is “relaxed” toward the exact solution which is numerically more stable.
  • Iterative methods are used most often for large sparse system of equations, and always when a good approximation of the solution is known.
  • Error analysis and convergence rate are two crucial aspects of the theory of iterative methods.
the coarsest grid solver
The Coarsest Grid Solver
  • As shown by the algorithm description, the final coarsest grid has just a few grid-points. A typical grid has 3 up to 5 points per axis.
  • On this grid, usually called W0, an exact solution of the basic equation Ae = r is required.
  • The number of grid points is so small on W0 that any solver can be used without changing the convergence rate in a noticeable way.
  • Typical choices are a direct solver (LU), a SOR, or even a few iterations of the error smoothing algorithm.
relaxation scheme
Relaxation Scheme
  • The relaxation scheme forms the kernel of the multigrid method.
  • Its task is to reduce the short wavelength Fourier components of the error on a given grid.
  • The efficiency of the relaxation scheme depends sensitively on details such as the grid topology and boundary conditions. Therefore, there is no single standard relaxation scheme that can be applied.
  • Two Gauss-Seidel schemes, namely point-wise relaxation and line relaxation, can be considered. The correct application of one or more relaxation methods can dramatically imp-rove the convergence. The point numbering scheme plays also a crucial role.
slide64

n1/2

n1/3

Complexity of linear solvers

Time to solve model problem (Poisson’s equation) on regular mesh

time dependent simulations
Time-Dependent Simulations
  • The time-dependent form of the drift-diffusion equations can be used both for
    • steady-state, and
    • transient calculations.
  • Steady-state analysis is accomplished by starting from an initial guess, and letting the numerical system evolve until a stationary solution is reached, within set tolerance limits.
time dependent simulations cont d
Time-Dependent Simulations (cont’d)
  • This approach is seldom used in practice, since now robust steady-state simulators are widely available.
    • It is nonetheless an appealing technique for beginners since a relatively small effort is necessary for simple applications and elementary discretization approaches.
    • If an explicit scheme is selected, no matrix solutions are necessary, but it is normally the case that stability is possible only for extremely small time-steps.
time dependent simulations cont d1
Time-Dependent Simulations (cont’d)
  • The simulation of transients requires the knowledge of a physically meaningful initial condition.
  • The same time-dependent numerical approaches used for steady-state simulation are suitable, but there must be more care for the boundary conditions, because of the presence of displacement current during transients.
displacement current
Displacement Current
  • In a true transient regime, the presence of displacement currents manifests itself as a potential variation at the contacts, superimposed to the bias, which depends on the external circuit in communication with the contacts.
displacement current cont d
Displacement Current (cont’d)
  • Neglect of the displacement current in a transient is equivalent to the application of bias voltages using ideal voltage generators, with zero internal impedance.
  • In this arrangement, one observes the shortest possible switching time attainable with the structure considered.
  • Hence, a simulation neglecting displacement current effects may be useful to assess the ultimate speed limits of a device structure.
displacement current cont d1
Displacement Current (cont’d)
  • When a realistic situation is considered, it is necessary to include a displacement term in the current equations. It is particularly simple to deal with a 1-D situation. Consider a 1-D device with length W and a cross-sectional area A. The total current flowing in the device is

(1)

  • The displacement term makes the total current constant at each position x. This property can be exploited to perform an integration along the device

(2)

  • The 1-D device, therefore, can be studied as the parallel of a current generator and of the cold capacitance which is in parallel with the (linear) load circuit.
  • At every time step, Eq. (1) has to be updated, since it depends on the charge stored by the capacitors.
some general comments
Some General Comments
  • A robust approach for transient simulation should be based on the same numerical apparatus established for purely steady-state models.
  • It is usually preferred to use fully implicit schemes, which require a matrix solution at each iteration, because the choice of the time-step is more likely to be limited by the physical time constants of the problem rather than by stability of the numerical scheme.
  • Typical calculated values for the time step are not too far from typical values of the dielectric relaxation time in practical semiconductor structures.
solution of the coupled dd equations
Solution of the Coupled DD Equations

There are two schemes that are used in solving the coupled set of equations which comprises the Drift-Diffusion model:

  • Gummel’s method
  • Newton’s method
gummel s method
Gummel’s Method
  • Gummel’s relaxation method, which solves the equations with the decoupled procedure, is used in the case of weak coupling:
  • Low current densities (leakage currents, subthreshold regime), where the concentration dependent diffusion term in the current continuity equation is dominant
  • The electric field strength is lower than the avalanche threshold, so that the generation term is independent of V
  • The mobility is nearly independent of E
  • The computational cost of the Gummel’s iteration is one matrix solution for each carrier type plus one iterative solution for the linearization of the Poisson Equation
newton s method
Newton’s Method
  • The three equations that constitute the DD model, written in residual form are:
  • Starting from an initial guess, the corrections are calculated by solving: