Process ompilation of thin film microdevices

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 15, Issue 7, 1996, Pages 745-764

  Hasanuzzaman, Mohammed ^a   Mastrangelo, Carlos H ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CMOS INTEGRATED CIRCUITS; COMPUTER SOFTWARE; GRAPH THEORY; OPTIMIZATION; SEMICONDUCTOR DEVICE MANUFACTURE; SEMICONDUCTOR DEVICE MODELS; SEMICONDUCTOR DEVICE STRUCTURES; VLSI CIRCUITS;

DIRECTED ACYCLIC GRAPH; MICROELECTROMECHANICAL SYSTEMS;

THIN FILM DEVICES;

EID: 0030196670     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.503943     Document Type: Article

References (73)

1. S. M. Sze, VLSI Technology.New York: McGraw-Hill, 1988.
2. K. Lee, "SIMPL-2 simulated profiles from the layout - Version 2,"Ph.D. thesis, Univ. California, Berkeley, 1985.
3. S. D. Senturia, R. M. Harriset al., "A computer-aided design system for microelectromechanical systems (MEMCAD),"IEEE J. Microelectromechanical Syst.,vol. 1,pp. 3-13, 1992.
4. J. S. Wenstrand, H. Iwai, and R. W. Dutton, "A manufacturing oriented environment for synthesis of fabrication processes,"in IEEE Int. Conf. CAD, 1989, pp. 276-379.
5. C.-Y. Fu, N. H. Chang, and K.-K. Lin, "Smart integrated circuit processing,"IEEE Trans. Semiconduct. Manufact.,vol. 2,pp. 151-158, 1989.
6. R. T. Howe, "Pulysilicon integrated microsystems: Technologies and applications,"in Transducers' 95: Proc. 8th Int. Conf. Solid-State Sensors Act.,Stockholm, Sweden, June 1995, pp. 43-46.
7. C. Lu, M. Lemkin, and B. E. Boser, "A monolithic surface micromachined accelerometer with digital output,"in Proc. IEEE Int. Solid-State Circuits Conf., San Francisco, CA, Feb.1995, pp. 160-161.
8. D. S. Boning, M. B. McIlrath, P. Penfield, and E. M. Sachs, "A general semiconductor process modeling framework,"IEEE Trans. Semiconduct. Manufact.,vol. 5,pp. 266-280, 1992.
9. F. Harary, R. Z. Norman, and D. Cartwright, Structural Models: An Introduction to the Theory of Directed Graphs.New York: Wiley, 1965.
10. G. D. Battista and R. Tamassia, "Algorithms for plane representations of acyclic digraphs,"Theor. Camp. Sci.,vol. 61,pp. 175-198, 1988.
11. R. Tamassia and J. Vitter, "Parallel transitive closure and point location in planar structures,"Siam J. Comput.,vol. 20,pp. 708-725, June 1991.
12. P. Rosenstiehl and R. E. Tarjan, "Rectilinear planar layouts and bipolar orientations of planar graphs,"Discrete Comp. Geom.,vol. 1,pp. 343-353, 1986.
13. B. Dushnik and E. W. Miller, "Partially ordered sets,"Am. J. Math.,vol. 63,pp. 600-610, 1941.
14. P. C. Fishburn, Interval Orders and Interval Graphs.New York: Wiley, 1985.
15. L. Budach, Algebraic and Topological Properties of Finite Partially Ordered Sets. Leipzig: Teubner, 1988.
16. I. Rival,Ordered Sets.Boston, MA: Kluwer, 1981.
17. Algorithms and Order.Dordrecht: Kluwer, 1989.
18. W. T. Trotter, Combinatorics and Partially Ordered Sets. Baltimore, MD: Johns Hopkins University Press, 1992.
19. R. A. Brualdy and H. J. Ryser,Combinatorial Matrix Theory.New York: Cambridge Univ. Press.1991.
20. K. H. Kim, Boolean Matrix Theory and Applications.New York: M. Dekker, 1982.
21. R. A. Brualdy and H. J. Ryser,A Survey of Finite Mathematics.New York: Cambridge Univ. Press.1991.
22. A. Kaufmann, Graphs, Dynamic Programming, and Finite Games.New York: Academic, 1967.
23. D. E. Knuth and J. L. Szwarcfiter, "A structured program to generate all topological sorting arrangements,"Info, Proc. Letters,vol. 2,pp. 153-157, 1974.
24. E. Szpilrajn, "Sur l'extension de l'ordre partiel,"Fund. Math,vol. 60,pp. 175-186, 1930.
25. N. Linial, "Hard enumeration problems in geometry and combinatorics,"SIAM. J. Alg. Disc. Meth.,vol. 7,pp. 331-335,Apr.1986.
26. S. G. Mohanty,Lattice Path Countings and Applications.New York: Academic, 1979.
27. I. Rival, "Linear extensions of finite ordered sets,"Annals Discrete Math.,vol. 23,pp. 355-370, 1984.
28. G. R. Brightwell, "Linear extensions of infinite posets,"Discrete Mathematics,vol. 70,pp. 113-136, 1988.
29. M. Pouzet and I. Rival, "Which ordered sets have a complete linear extension?"Can. J. Math.,vol. XXXIII,pp. 1245-1254, 1981.
30. V. Bouchitte and M. Habib, "NP-completeness properties about linear extensions,"Order,vol. 4,pp. 143-154, 1987.
31. G. R. Brightwell and P. Winkler, "Counting linear extensions is NP-complete,"in Proc. Twenty-Third Annual ACM Symp. Theory Comput., 1991, pp. 175-181.
32. M. D. Atkinson and H. W. Chang, "Computing the number of mergings with constraints,"Info. Process. Letters,vol. 24,pp. 289-292, 1987.
33. M. Dyer, A. Frieze, and R. Kannan, "A random polynomial time algorithm for approximating the volume of convex bodies,"in Proc. Twenty-First Annual ACM Symp. Theory Comput., 1989, pp. 375-381.
34. D. Applegate and R. Kannan, "Sampling and integration of near log-concave functions,"in Proc. Twenty-Third Annual ACM Symp. Theory Comput., 1991, pp. 156-163.
35. S. W. Director and G. D.Hatchel, "The simplicial approximation approach to design centering,"IEEE Trans. Circuits Syst., vol.CAS-24,pp. 363-372, 1977.
36. H. S. M. Coxeter, Regular Polytopes.New York: Dover, 1973.
37. V. Bryant,Aspects of Combinatorics.New York: Cambridge Univ. Press, 1993.
38. M. Marcus,A Survey of Finite Mathematics.New York: Dover, 1993.
39. M. Marcus and H. Mine,A Survey of Matrix Theory and Matrix Inequalities.New York: Dover, 1992.
40. W. Wan-di, "Permutations with restricted positions and k-permanent,"Acta Math. Appl. Sinica,vol. 6,pp. 177-182, 1983.
41. H. Mine,Permanents. Reading,MA: Addison-Wesley, 1978.
42. N. Alon, J. H. Spencer, and P. Erdos,The Probabilistic Method.New York: Wiley, 1992.
43. B. Gogoi, R. Yuen, and C. H. Mastrangelo, "The automatic synthesis of planar fabrication process flows for surface micromachined devices,"in Proc. MEMS, Int. Conf. Microelectromechanical Syst., 1994, pp. 153-157.
44. D. J. Kleitman and B. L. Rothschild, "Asymptotic enumeration of partial orders on a finite set,"Trans. Amer. Math. Soc.,vol. 205,pp. 205-221, 1975.
45. "The number of finite topologies,"in Proc. Amer. Math. Soc.,vol. 25, 1970, pp. 276-282.
46. R. L. Davis, "The number of structures of finite relations,"in Proc. Amer. Math. Soc.,vol. 4, 1953, pp. 486-495.
47. K. K. Butler, "The number of partially ordered sets,"J. Comb. Theor.,vol. 13,pp. 276-289, 1972.
48. F. Harary, "The number of linear, directed, rooted and connected graphs,"Trans. Amer. Math. Soc.,vol. 78,pp. 445-463, 1955.
49. M. H. El-Zahar, "Enumeration of ordered sets,"in Algorithms and Order,I. Rival, Ed. Dordrecht: Kluwer,pp. 327-352, 1989.
50. J. Neggers, "Representations of finite partially ordered sets,"J. Combin.,vol. 3,pp. 113-133, 1978.
51. R. P. Stanley, "Ordered structures and partitions,"Memoirs Amer. Math. Soc.,vol. 119,pp. 1-102, 1972.
52. A. D. Kalvin and Y. L. Varol, "On the generation of all topological sortings,"J. Algorithms,vol. 4,pp. 150-162, 1983.
53. A. B. Kahn, "Topological sortings of large networks,"Comm. ACM,vol. 5,pp. 558-562, 1962.
54. D. E. Knuth, The Art of Computer Programming,vol. 1. Reading, MA: Addison-Wesley, 1968.
55. Y. L. Varol and D. Rotem, "An algorithm to generate all topological sorting arrangements,"Comput. J.,vol. 24,pp. 83-84, 1981.
56. G. Steiner, "An algorithm to generate the ideals of a partial order,"Operations Res. Letters,vol. 5,pp. 317-320, 1986.
57. A. V. Aho, M. R. Garey, and J. D. Ullman, "The transitive reduction of a directed graph,"SIAM J. Comput.,vol. 1,pp. 131-137, 1972.
58. E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1977.
59. R. Tarjan, "Finding dominators in directed graphs,"SIAM J. Comput.,vol. 3,pp. 62-89, 1974.
60. A. Nijenhuis and H. S. Wilf,Combinatorial Algorithms.New York: Academic, 1975.
61. M. C. Er, "A parallel computation approach to topological sorting,"The Comput. J.,vol. 26,pp. 293-295, 1983.
62. P. Chaudhuri, "Fast parallel algorithms for a class of graph problems,"Jr. Comb. Inf. Syst. Sci.,vol. 12,no. 1,pp. 51-65, 1987.
63. K. Culik and I. Fris, "Topological transformations as a tool in the design of systolic networks,"Theor. Comput. Sci.,vol. 37,pp. 183-216, 1985.
64. 2) time,"Inform. Process. Letters,vol. 20,pp. 167-171, 1990.
65. S. Foldes, I. Rival, and J. Urrutia, "Light sources, obstructions and spherical orders,"Discrete Mathematics,vol. 102,pp. 13-23, 1992.
66. J. L. Vossen, Thin Film Processes. New York; Academic, 1978.
67. B. R. Penumalli, "A comprehensive two dimensional VLSI process simulation program, BICEPS,"IEEE Trans. Electron Devices,vol.ED-30,pp. 986-992, 1983.
68. C. P. Ho, J. D. Plummer, S. E. Hansen, and R. W. Dutton, "VLSI process modeling - SUPREM III,"IEEE Trans. Electron Devices, vol.ED-30,pp. 1438-1453, 1983.
69. J. Mockus,Bayesian Approach to Global Optimization: Theory and Applications.Boston, MA: Kluwer, 1989.
70. W. H. Press, B. P. Flannery, S. A. Teulosky, and W. T. Vetterling, Numerical Recipes in C.New York: Cambridge Univ., 1993.
71. A. J. Strowjas,Statistical Design of Integrated Circuits.New York: IEEE, 1987.
72. S. W. Director and W. Maly,Statistical Approach to VLSI.New York: North-Holland, 1994.
73. D. Moore and H. Walker, Yield Simulation For Integrated Circuits.New York: Kluwer, 1987.