Modified octree mesh generation for Manhattan type structures with narrow layers applied to semiconductor devices

One of the most important steps in the process of semiconductor device simulation, or any other numerical simulation based on finite elements, finite differences or similar standard techniques, is the discretization of the domain of the problem. A mesh must be generated, and its properties determine the stability of the numerical solver, computational time and quality of the solution. In this paper an octree-based mesh generator is presented. The classical model for octree generation have been modified to optimize the programme for special regions of interest in the semiconductor device problem, Manhattan structures with very narrow layers. Using this technique, several meshing patterns have been tested and compared. Numerical results of the generation of general meshes are presented to demonstrate the efficiency of the algorithms from two points of view: mesh quality and computational effort. It has been successfully applied to the modelling and simulation of different transistors, High Electron Mobilty Transistors (HEMTs) and Metal Oxide Semiconductor Field Effect Transistors (MOSFETs). Copyright © 2006 John Wiley & Sons, Ltd.

[1]  Mark S. Shephard,et al.  Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[2]  J. Bonet,et al.  An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems , 1991 .

[3]  Wolfgang Fichtner,et al.  Mixed element trees: a generalization of modified octrees for the generation of meshes for the simulation of complex 3-D semiconductor device structures , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Nancy Hitschfeld,et al.  Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms , 2003 .

[5]  K. Haghighi,et al.  An efficient data structure for the advancing‐front triangular mesh generation technique , 1995 .

[6]  M. Rivara,et al.  Automatic construction of non‐obtuse boundary and/or interface Delaunay triangulations for control volume methods , 2002 .

[7]  Siegfried Selberherr,et al.  A method for generating structurally aligned grids for semiconductor device simulation , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Scott A. Mitchell,et al.  Quality Mesh Generation in Higher Dimensions , 2000, SIAM J. Comput..

[9]  Ren-Chuen Chen,et al.  A quantum corrected energy-transport model for nanoscale semiconductor devices , 2005 .

[10]  Roger Crawfis,et al.  Efficient subdivision of finite-element datasets into consistent tetrahedra , 1997 .

[11]  S. Lo.  A NEW MESH GENERATION SCHEME FOR ARBITRARY PLANAR DOMAINS , 1985 .

[12]  O. C. Zienkiewicz,et al.  Adaptive remeshing for compressible flow computations , 1987 .

[13]  Tomás F. Pena,et al.  Parallel finite element method to solve the 3D Poisson equation and its application to abrupt heterojunction bipolar transistors , 2000 .

[14]  J. Z. Zhu,et al.  The finite element method , 1977 .

[15]  Olaf Schenk,et al.  The effects of unsymmetric matrix permutations and scalings in semiconductor device and circuit simulation , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  Antonio J. Garcia-Loureiro,et al.  Efficient three‐dimensional parallel simulations of PHEMTs , 2005 .

[17]  William J. Schroeder,et al.  Compatible triangulations of spatial decompositions , 2004, IEEE Visualization 2004.

[18]  Andrea L. Lacaita,et al.  Quantum-corrected drift-diffusion models for transport in semiconductor devices , 2005 .