1. Theory

  • Definition: Device TCAD turns the drift-diffusion equations into algebraic equations on a mesh, most commonly by the box (Voronoi finite-volume) method with Scharfetter-Gummel fluxes, and solves the resulting non-linear system by Gummel or Newton iteration (Farrell; Chen and Bagci; Jerome and Kerkhoven).
  • The flux problem: Carrier densities vary exponentially with potential, so linear interpolation between nodes gives spurious currents unless the mesh is extremely fine; the Scharfetter-Gummel flux integrates the current equation exactly along each edge (Farrell; computed).
  • Non-linear solution: Gummel’s method solves Poisson and the two continuity equations in turn; Newton’s method solves them simultaneously with the full Jacobian (Chen and Bagci; Jerome and Kerkhoven).
  • Accuracy: Errors fall with mesh size at a rate set by the scheme, about second order for SG currents in practice (Farrell; Chen and Bagci).

2. Working Principle

  • Control volumes: Each node owns a Voronoi cell, and fluxes cross its faces, so charge and current are conserved exactly at the discrete level (Farrell; background knowledge for exact conservation).
  • Exponential fitting: Assuming constant current and field along an edge gives an exponential density profile and the Bernoulli-weighted flux (Farrell).
  • Decoupling: Gummel freezes the quasi-Fermi potentials while solving Poisson, then updates carriers with the new field, which converges well when coupling between the equations is weak (Chen and Bagci; background knowledge for the coupling condition).
  • Full coupling: Newton linearizes all three equations together, converging quadratically near the solution, with damping to stay robust from poor initial guesses (Jerome and Kerkhoven; background knowledge for quadratic convergence).

3. Applications

  • Commercial and open TCAD: Box-method SG discretization in DEVSIM and similar tools (Drift-Diffusion Device Equations page; Farrell).
  • Heterostructures and degenerate devices: Generalized SG schemes for Fermi-Dirac statistics in lasers, LEDs and highly doped contacts (Farrell).
  • Large 3-D problems: Iterative linear solvers with preconditioners for millions of unknowns (Chen and Bagci; Jerome and Kerkhoven).
  • Alternative discretizations: Discontinuous Galerkin methods reaching the same accuracy on coarser meshes (Chen and Bagci).

Finite-Volume Discretization

NameFormulaRelated FormulaeVariables/Constants
Box (Voronoi finite-volume) discretization





Central-difference flux and its failure



Scharfetter-Gummel Fluxes

NameFormulaRelated FormulaeVariables/Constants
Scharfetter-Gummel flux


Scharfetter-Gummel generalizations for Fermi-Dirac statistics



Non-Linear Solvers and Convergence

NameFormulaRelated FormulaeVariables/Constants
Gummel (decoupled) iteration

Newton (coupled) iteration




Mesh convergence and problem size


Important Questions

Ques: Why can’t simple central differences be used for the current?

Because carrier density changes exponentially between nodes. A central-difference flux treats the density as linear along an edge and averages it in the drift term. At equilibrium with a potential step of 5 thermal voltages across one edge, the density ratio is , and the central flux comes out at -226 in units of , 1.5 times the diffusion term, instead of zero (computed): a large spurious current. The scheme is only stable when the potential step per edge stays below about , 52 mV at room temperature (background knowledge), which would need impractically fine meshes across junctions with built-in potentials near 0.9 . The Scharfetter-Gummel flux gives exactly zero for the same case (computed), which is why it became the standard. Reference: P. Farrell (with T. Koprucki, J. Fuhrmann, N. Rotundo and H. Doan), ‘Scharfetter-Gummel schemes for non-Boltzmann statistics’, ECMI 2016 talk, Weierstrass Institute Berlin (slides; signs hard to read in the extract) (fetch-tool summary).

Ques: What is the Scharfetter-Gummel flux and why is it exact?

It is the exact solution of the one-dimensional current equation along an edge with constant current and field. Farrell writes the flux as with the Bernoulli function , derived by assuming constant current, solving the resulting ODE for with the end values and . For small potential steps, and 1.005 (computed), so the flux reduces to central differencing; for large steps, and (computed), so the flux takes its density almost entirely from the upwind node. It therefore blends diffusion-dominated and drift-dominated transport automatically and is consistent with thermodynamic equilibrium, one of the properties Farrell lists. Reference: P. Farrell (with T. Koprucki, J. Fuhrmann, N. Rotundo and H. Doan), ‘Scharfetter-Gummel schemes for non-Boltzmann statistics’, ECMI 2016 talk, Weierstrass Institute Berlin (slides; signs hard to read in the extract) (fetch-tool summary).

Ques: Is the sign convention of the Scharfetter-Gummel flux in the slides correct?

It is correct if means . The extracted slide writes but warns that its signs are hard to read. At equilibrium, Boltzmann statistics require , and with the identity , equivalently (background knowledge), the flux vanishes exactly when the argument multiplying is (computed: residual below at a 5 step). With the slide’s form satisfies this, while the opposite reading would produce a large equilibrium current. Codes differ in whether they define as or the reverse, so the equilibrium test is the reliable check (my reading). A useful companion test is a uniform resistor, whose simulated current must match Ohm’s law at any mesh spacing. Reference: P. Farrell (with T. Koprucki, J. Fuhrmann, N. Rotundo and H. Doan), ‘Scharfetter-Gummel schemes for non-Boltzmann statistics’, ECMI 2016 talk, Weierstrass Institute Berlin (slides; signs hard to read in the extract) (fetch-tool summary).

Ques: How is the Scharfetter-Gummel scheme extended to Fermi-Dirac statistics?

In three main ways, compared by Farrell. The generalized SG scheme of Koprucki and Gartner uses and solves for the flux with a fixed-point equation to machine precision; it is exact for Blakemore statistics. Diffusion averaging replaces g by an edge average built from logarithms of the inverse statistics function and is consistent with equilibrium only for that particular average. Fuhrmann’s inverse-activity scheme uses and is consistent for any average. All three reduce to classical SG in the non-degenerate limit of large negative . On a pin benchmark with doping up to , all converged at about ; the generalized SG gave the best current and diffusion enhancement the best field. Degenerate regions such as contacts, lasers and LEDs need these schemes. Reference: P. Farrell (with T. Koprucki, J. Fuhrmann, N. Rotundo and H. Doan), ‘Scharfetter-Gummel schemes for non-Boltzmann statistics’, ECMI 2016 talk, Weierstrass Institute Berlin (slides; signs hard to read in the extract) (fetch-tool summary).

Ques: When is Gummel iteration preferred over Newton’s method?

When memory or a poor initial guess is the limitation, and coupling is weak. Chen and Bagci state that Gummel needs less memory and computation per iteration and is less sensitive to the initial guess than Newton, but converges more slowly, typically in fewer than 50 iterations to a tolerance of for their devices. Jerome and Kerkhoven describe it as the oldest approach, a Gauss-Seidel successive substitution, whose convergence has been analysed in Slotboom variables. Gummel’s linear convergence slows when the equations are strongly coupled, as at high injection or high current, where Newton is preferred (background knowledge). A linear contraction factor of 0.5 needs 50 iterations to reach (computed). Simulators often start with Gummel iterations and switch to Newton once close to the solution (background knowledge). Reference: L. Chen and H. Bagci, ‘Steady-state Simulation of Semiconductor Devices using Discontinuous Galerkin Methods’, arXiv:1910.05977 (fetch-tool summary); J. W. Jerome and T. Kerkhoven, ‘A Finite Element Approximation Theory for the Drift Diffusion Semiconductor Model’ (received 1989, accepted 1990; preprint, journal not stated) (fetch-tool summary).

Ques: How fast does Newton’s method converge, and why is it damped?

Quadratically near the solution, so it is damped far from it. Newton solves for all potentials and densities together, and near the solution the error roughly squares each step: from to , and in three steps (computed). Far from the solution the exponential carrier terms make full steps overshoot, so a damping factor shortens the update (background knowledge). Jerome and Kerkhoven describe such a damped Newton outer iteration with the Jacobian formed by linearizing the PDE system and linear systems solved directly or iteratively with Jacobian-based preconditioners. Each Newton step costs more than a Gummel step because the coupled Jacobian is three times larger in each dimension, as Chen and Bagci note in comparing memory needs. Reference: J. W. Jerome and T. Kerkhoven, ‘A Finite Element Approximation Theory for the Drift Diffusion Semiconductor Model’ (received 1989, accepted 1990; preprint, journal not stated) (fetch-tool summary); L. Chen and H. Bagci, ‘Steady-state Simulation of Semiconductor Devices using Discontinuous Galerkin Methods’, arXiv:1910.05977 (fetch-tool summary).

Ques: How fine must a TCAD mesh be?

Fine enough that the extracted currents stop changing, which depends on the scheme. Chen and Bagci report that for a MOSFET, SG finite volumes reach relative I-V error at a 1 mesh, with 545342 elements and about 1.5 million unknowns, 2.75 per element (computed), while Galerkin least-squares finite elements need 0.3 and discontinuous Galerkin only 3 . Farrell observes roughly current convergence for SG schemes, so halving the mesh cuts the error about four times (computed), and Jerome and Kerkhoven prove error bounds with up to 1 for linear elements. In practice the mesh must resolve the Debye length near junctions, a few nanometres at high doping (Drift-Diffusion Device Equations page), and is refined where doping, potential or current change fastest (background knowledge). Reference: L. Chen and H. Bagci, ‘Steady-state Simulation of Semiconductor Devices using Discontinuous Galerkin Methods’, arXiv:1910.05977 (fetch-tool summary); P. Farrell (with T. Koprucki, J. Fuhrmann, N. Rotundo and H. Doan), ‘Scharfetter-Gummel schemes for non-Boltzmann statistics’, ECMI 2016 talk, Weierstrass Institute Berlin (slides; signs hard to read in the extract) (fetch-tool summary); J. W. Jerome and T. Kerkhoven, ‘A Finite Element Approximation Theory for the Drift Diffusion Semiconductor Model’ (received 1989, accepted 1990; preprint, journal not stated) (fetch-tool summary); Drift-Diffusion Device Equations page of this vault.

References

  1. P. Farrell, T. Koprucki, J. Fuhrmann, N. Rotundo and H. Doan, “Scharfetter-Gummel schemes for non-Boltzmann statistics,” ECMI 2016 talk, Weierstrass Institute for Applied Analysis and Stochastics, Berlin, 2016. Available: https://www.wias-berlin.de/people/peschka/files/ecmi2016_farrell.pdf
  2. L. Chen and H. Bagci, “Steady-state Simulation of Semiconductor Devices using Discontinuous Galerkin Methods,” arXiv:1910.05977. Available: https://arxiv.org/abs/1910.05977
  3. J. W. Jerome and T. Kerkhoven, “A Finite Element Approximation Theory for the Drift Diffusion Semiconductor Model,” preprint (received 1989, accepted 1990). Available: https://sites.math.northwestern.edu/~jwj/preprints/Kerkhoven/Kerkhoven.pdf

Related pages in this vault: Drift-Diffusion Device Equations, Thermal and Electro-Thermal Simulation, Band-Gap Narrowing and Quantum Corrections, Hydrodynamic and Energy-Balance Transport, Generation-Recombination Models, Basic Semiconductor Equations.