Process compilation of thin film microdevices

This paper describes a systematic method for the automatic generation of fabrication processes of thin film devices. The method uses a partially ordered set (poset) representation of device topology describing the order between its various components in the form of a directed acyclic graph. The sequence in which these components are fabricated is determined from the poset linear extensions, and the component sequence is expanded into a corresponding process flow. The graph-theoretic synthesis method is powerful enough to establish existence and multiplicity of flows thus creating a design space D suitable for optimization. The cardinality /spl par/D/spl par/ for a device with N components is large with a worst case /spl par/D/spl par//spl les/(N-1)! yielding in general a combinatorial explosion of solutions. The number of solutions is controlled through a priori estimates of /spl par/D/spl par/ and condensation of the device graph. The method has been implemented in the computer program MISTIC (Michigan Synthesis Tools for Integrated Circuits) which calculates specific process parameters using an internal database of process modules and materials. Currently, MISTIC includes process modules for deposition, lithography, etching, ion implantation, coupled simultaneous diffusions, and reactive growth. The compilation procedure was applied to several device structures. For a double metal twin-well BiCMOS structure, the compiler generated 168 complete process flows.

[1]  Alfred V. Aho,et al.  The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..

[2]  Mike D. Atkinson,et al.  Computing the Number of Mergings with Constraints , 1987, Inf. Process. Lett..

[3]  Norman,et al.  Structural Models: An Introduction to the Theory of Directed Graphs. , 1966 .

[4]  Robert E. Tarjan,et al.  Finding Dominators in Directed Graphs , 1974, SIAM J. Comput..

[5]  I. Rival.  Algorithms and Order , 1988 .

[6]  T. C. Hu,et al.  Combinatorial algorithms , 1982 .

[7]  B. Rothschild,et al.  Asymptotic enumeration of partial orders on a finite set , 1975 .

[8]  V. Bryant.  Aspects of Combinatorics: A Wide-ranging Introduction , 1993 .

[9]  Kim Ki-Hang Butler.  The number of partially ordered sets , 1972 .

[10]  N. Linial.  Hard enumeration problems in geometry and combinatorics , 1986 .

[11]  Jacob K. White,et al.  A computer-aided design system for microelectromechanical systems (MEMCAD) , 1992 .

[12]  Andrzej J. Strojwas.  Statistical Design of Integrated Circuits , 1987 .

[13]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[14]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[15]  Ivan Rival,et al.  Linear Ectensions of Finite Ordered Sets , 1984 .

[16]  J. Vossen,et al.  Thin Film Processes , 1979 .

[17]  R. Stanley.  Ordered Structures And Partitions , 1972 .

[18]  F. Harary.  THE NUMBER OF LINEAR, DIRECTED, ROOTED, AND CONNECTED GRAPHS , 1955 .

[19]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[20]  Ben Dushnik,et al.  Partially Ordered Sets , 1941 .

[21]  Richard A. Brualdi,et al.  Combinatorial matrix theory , 1991 .

[22]  Graham R. Brightwell.  Linear extensions of infinite posets , 1988, Discret. Math..

[23]  W. Schroeder,et al.  Graphs, Dynamic Programming, and Finite Games , 1968 .

[24]  M. C. Er,et al.  A Parallel Computation Approach to Topological Sorting , 1983, Comput. J..

[25]  C.-Y. Fu,et al.  Smart integrated circuit processing , 1989 .

[26]  C. Mastrangelo,et al.  The automatic synthesis of planar fabrication process flows for surface micromachined devices , 1994, Proceedings IEEE Micro Electro Mechanical Systems An Investigation of Micro Structures, Sensors, Actuators, Machines and Robotic Systems.

[27]  J. Mockus.  Bayesian Approach to Global Optimization: Theory and Applications , 1989 .

[28]  B. Boser,et al.  A monolithic surface micromachined accelerometer with digital output , 1995 .

[29]  Martin E. Dyer,et al.  A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.

[30]  Ki Hang Kim.  Boolean matrix theory and applications , 1982 .

[31]  Robert L. Davis.  The number of structures of finite relations , 1953 .

[32]  Michel Habib,et al.  NP-completeness properties about linear extensions , 1987 .

[33]  Yaakov L. Varol,et al.  On the Generation of All Topological Sortings , 1983, J. Algorithms.

[34]  Jonas Mockus,et al.  Bayesian Approach to Global Optimization , 1989 .

[35]  R.W. Dutton,et al.  VLSI Process modeling—SUPREM III , 1983, IEEE Transactions on Electron Devices.

[36]  Roger T. Howe,et al.  Polysilicon Integrated Microsystems: Technologies And Applications , 1995, Proceedings of the International Solid-State Sensors and Actuators Conference - TRANSDUCERS '95.

[37]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[38]  Duane S. Boning,et al.  A General Semiconductor Process Modeling Framework , 1992 .

[39]  Karel Culik,et al.  Topological Transformations as a Tool in the Design of Systolic Networks , 1985, Theor. Comput. Sci..

[40]  Christoph Meinel,et al.  Algebraic and topological properties of finite partially ordered sets , 1988 .

[41]  Wojciech Maly,et al.  Statistical approach to VLSI , 1994 .

[42]  George Steiner,et al.  An algorithm to generate the ideals of a partial order , 1986 .

[43]  K. Lee,et al.  SIMPL-2 (SIMulated Profiles from the Layout-Version 2) , 1985, 1985 Symposium on VLSI Technology. Digest of Technical Papers.

[44]  A. Nijenhuis.  Combinatorial algorithms , 1975 .

[45]  Maurice Pouzet,et al.  Which ordered sets have a complete linear extension , 1981 .

[46]  Jorge Urrutia,et al.  Light sources, obstructions and spherical orders , 1992, Discret. Math..

[47]  D. Kleitman,et al.  The number of finite topologies , 1970 .

[48]  G. Hachtel.  The simplicial approximation approach to design centering , 1977 .

[49]  Ira Pohl,et al.  Graphs, dynamic programming, and finite games , 1967 .

[50]  Duane S. Boning,et al.  A general semiconductor press modeling framework , 1992 .

[51]  Doron Rotem,et al.  An Algorithm to Generate all Topological Sorting Arrangements , 1981, Computer/law journal.

[52]  S. G. Mohanty,et al.  Lattice Path Counting and Applications. , 1980 .

[53]  David Applegate,et al.  Sampling and integration of near log-concave functions , 1991, STOC '91.

[54]  Peter Winkler,et al.  Counting linear extensions is #P-complete , 1991, STOC '91.

[55]  E. Szpilrajn.  Sur l'extension de l'ordre partiel , 1930 .

[56]  Duncan M. Walker.  Yield simulation for integrated circuits , 1987 .

[57]  M. Marcus,et al.  A Survey of Matrix Theory and Matrix Inequalities , 1965 .

[58]  E. S. Wolk.  Partially well ordered sets and partial ordinals , 1967 .

[59]  A. B. Kahn,et al.  Topological sorting of large networks , 1962, CACM.

[60]  Robert W. Dutton,et al.  A manufacturing-oriented environment for synthesis of fabrication processes , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[61]  B. Penumalli,et al.  A comprehensive two-dimensional VLSI process simulation program, BICEPS , 1983, IEEE Transactions on Electron Devices.

[62]  M. El-Zahar.  Enumeration of Ordered Sets , 1989 .

[63]  Jeffrey Scott Vitter,et al.  Parallel Transitive Closure and Point Location in Planar Structures , 1991, SIAM J. Comput..

[64]  Jayme Luiz Szwarcfiter,et al.  A Structured Program to Generate all Topological Sorting Arrangements , 1974, Information Processing Letters.

[65]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[66]  Marvin Marcus.  A Survey of Finite Mathematics , 1964 .