A Survey of Optimization Techniques for Integrated-Circuit Design

Proceedings of the IEEE

Volumn 69, Issue 10, 1981, Pages 1334-1362

  Brayton, Robert K ^a   Hachtel, Gary D ^a   Sangiovanni Vincentelli, Alberto L ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84944982891     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/PROC.1981.12170     Document Type: Article

References (85)

1. K. J. Antreich and R. K. Koblitz, “An interactive procedure to design centering,” in Proc. Int. Symp. Circuits and Systems, pp. 139–142, 1981.
2. L. Armijo “Minimization of functions having continuous partial derivatives,” Pacific J. Math., vol. 16, pp. 1–3, 1966.
3. “ASTAP-Advanced statistical analysis program,” IBM program product document SH20-1118-0, IBM Data Processing Div., 1133 Westchester Ave., White Plains, NY 10604, 1973.
4. J. W. Bandler and H. L. Abdel-Malek, “Modeling and approximation for statistical evaluation and optimization of microwave designs,” in Proc. 7th European Microwave Conf., (Copenhagen, Denmark), 1977.
5. J. W. Bandler, P. C. Liu and H. Tromp, “Efficient, automated design centering and tolerancing,” in Proc. IEEE Int. Symp. Circuits and Systems, pp. 710–713, 1976.
6. J. W. Bandler, P. C. Liu, and J.H.K. Chen, “Worst case network tolerance optimization,” IEEE Trans. Microwave Theory Tech., vol. MTT-23, 1975.
7. J. W. Bandler and M. R. Rizk “Optimization of electrical circuits,” Math. Program. Study, vol. 11, pp. 1–64, 1979.
8. D. P. Bertsekas, “Multiplier methods: A survey,” Automatica, vol. 2, pp. 133–145, 1976.
9. M. A. Bhatti, T. Essebo, W. Nye, K. S. Pister, E. Polak, A. L. Sangiovanni-Vincentelli and A. L. Tits, “A software system for optimization-based interactive computer-aided design,” Univ. California, Berkeley, Memo. N. UCB/ERL M80/14, Apr. 1980.
10. M. A. Bhatti, E. Polak and K. Pister, OPTDYN-A general purpose optimization program for problems with or without dynamic constraints,” Earthquake Engineering Research Center, Univ. California, Berkeley, Rep. N. UCB/EERC 79-16, 1979.
11. M. C. Biggs, “Constrained minimization using recursive quadratic programming: Some alternative subproblem formulations,” in Towards Global Optimization, L.C.W. Dixon and G. P. Szego, Eds. Amsterdam, The Netherlands: North Holland Publ., 1975.
12. R. K. Brayton and R. Spence, Sensitivity and Optimization. New York: Elsevier, 1980.
13. R. K. Brayton, S. W. Director, and G. D. Hachtel, “Arbitrary norms for statistical design via linear programming,” Proc. IEEE Int. Symp. Circuits and Systems, pp. 161–164, 1978.
14. R. K. Brayton, S. W. Director, and G. D. Hachtel, “Yield maximization and worst case design with arbitrary statistical distributions,” IEEE Trans. Circuits Syst., vol. CAS-26, Sept. 1979.
15. R. K. Brayton, A. J. Hoffman, and T. R. Scott “A theorem on inverses of convex sets of real matrices with application to the worst case dc problem,” IEEE Trans. Circuits Syst., vol. CAS-24, pp. 409–415, Aug. 1977.
16. R. K. Brayton, S. W. Director, G. D. Hachtel, and L. Vidigal “A new algorithm for statistical circuit design based on quasi-Newton methods and function splitting,” IEEE Trans. Circuits Syst., vol. CAS-26, pp. 784–794, Sept. 1979.
17. Y. Censor “Pareto optimality in multiobjective problems,” Appl. Math. Optimiz., vol. 4, pp. 41–59, 1977.
18. D. R. Chand and S. S. Kapur “An algorithm for convex polytopes,” J. ACM, vol. 17, no. 7, pp. 78–86, 1970.
19. C. Charalambous and J. Bandler “New algorithms for network optimization,” IEEE Trans. Microwave Theory Tech., vol. MTT-21, pp. 815–818, Dec. 1973.
20. V. F. Demyanov and V. N. Malozemov, Introduction to Minimax. New York: Wiley, 1974.
21. S. W. Director and G. D. Hachtel “The simplicial approximation approach to design centering and tolerance assignment,” IEEE Trans. Circuits Syst., vol. CAS-24, pp. 363–371, 1977.
22. S. W. Director and L. M. Vidigal, “Comparison of two methods of design centering,” in Proc. IEEE Int. Symp. Circuits and Systems, (Chicago, IL), pp. 843–846, 1981.
23. J. J. Dongarra et al., LINPACK Users' Guide. Philadephia, PA: SLAM, 1979.
24. B. C. Eaves and W. I. Zangwill, Generalized cutting plane algorithms, SIAM J. Cont., vol., 9, no. 4, pp. 529–542, 1971.
25. N. J. Elias, “New statistical methods for assigning device tolerances,” in Proc. Int. Symp. Circuits and Systems, pp. 329–332, 1975.
26. C. Gonzaga and E. Polak “On constraints dropping schemes and optimality functions for a class of outer approximations algorithms,” SIAM J. Contr. Opt., vol. 17, no. 4, pp. 477–493, 1979.
27. C. Gonzaga, E. Polak, and R. Trahan “An improved algorithm for optimization problems with functional inequality constraints,” IEEE Trans. Automat. Contr., vol. AC-25, pp. 49–54, Jan. 1980.
28. G. D. Hachtel and R. A. Rohrer “Techniques for the optimal design and synthesis of switching circuits,” IEEE Proc., vol. 55, pp. 1864–1867, Nov. 1967.
29. G. D. Hachtel, R. K. Brayton, and F. G. Gustavson, “The sparse tableau approach to network analysis and design,” IEEE Trans. Circuits Theory, vol. CT-18, pp. 101–113, Jan. 1971.
30. G. D. Hachtel, M. R. Lightner, and H. J. Kelley, “Techniques for the application of the ASTAP compatible optimization program A20P to the design of memory circuits,” IEEE Trans. Circuits and Systems, vol. CAS-22, Oct. 1975.
31. G. D. Hachtel, T. R. Scott and R. P. Zug “An interactive linear programming approach to model parameter fitting and worst-case circuit design,” IEEE Trans. Circuits Syst., vol. CAS-27, pp. 871–882, Oct. 1980.
32. —, “APLSTAP users guide,” IBM Tech. Rep., to be published 1981.
33. G. D. Hachtel, A. L. Sangiovanni-Vincentelli and V. Visvanathan, “An optimization based approach to model simplification,” in Proc. Int. Symp. Circuits and Systems, pp. 995–1000, 1981.
34. J. Hald and K. Madsen “Combined LP and quasi-Newton methods for minimax optimization,” Math. Program., vol. 20, no. 1, pp. 49–62, 1981.
35. J. M. Hammersley and D. C. Handscomb, Monte Carlo Methods. London, England: Methuen, 1964.
36. S. P. Han “Superlinearly convergent variable metric algorithms for general nonlinear programming problems,” Math. Program., vol. 11, pp. 263–282, 1976.
37. Harwell Subroutine Library, Harwell, England.
38. H. Y. Hsieh, N. B. Rabbat and A. Ruehli, “MacromodeUing and macro-simulation techniques,” Proc. IEEE Int. Symp. Circuits and Systems, pp. 336–339, 1978.
39. B. W. Kernighan and P. Plauger, Software Tools, Reading, MA: Addison-Wesley, 1976.
40. G. Kjellstrom and L. Taxen, “On the efficient use of stochastic optimization in network design,” in Proc. Int. Symp. Circuits and Systems, pp. 714–717, 1976.
41. K.-H. Leung and R. Spence “Efficient statistical circuit analysis,” Elec. Lett., vol. 10, no. 17, pp. 377–378, 1974.
42. M. R. Lightner, “Multiple criterion optimization and statistical design for electronic circuits,” Ph.D. dissertation, Carnegie-Mellon Univ., Pittsburgh, PA, 1979.
43. K. Maasen, H. Schjaer-Jacobsen, and J. Voldby “Automated minimax design of networks,” IEEE Trans. Circuits Syst., vol. CAS-22, pp. 791–795, Oct. 1975.
44. K. Madsen, G. Nielson, H. Schjaer-Jacobsen, and L. Thrane “Efficient minimax design of networks without using derivatives,” IEEE Trans. Microwave Theory Tech., vol. MTT-23, pp. 803–809, Oct. 1975.
45. K. Madsen and H. Schjaer-Jacobsen, “Singularities in minimax optimization of networks,” IEEE Trans. Circuits and Systems, CAS-23, no. 7, 456–460, 1976.
46. K. Madsen “An algorithm for minimax solution of overdetermined systems of nonlinear equations,” J. Inst. Math. Appl., vol. 16, pp. 321–328, 1975.
47. K. Madsen and H. Schjaer-Jacobsen, “Algorithms for worst case tolerance optimization,” Numerisk Institute, Danmarks Tekniske Hojskole, Lyngby, Denmark, Rep. NI-78-05, 1978.
48. —, “New algorithms for worst-case tolerance optimization,” in Proc. IEEE Int. Symp. Circuits and Systems (New York), pp. 681–685, 1978.
49. —, “Algorithms for worst case tolerance optimization,” IEEE Trans. Circuits and Systems, vol. CAS-26, Sept. 1979.
50. D. Q. Mayne, E. Polak, and R. Trahan “An outer approximation algorithm for computer-aided design problems,” J. Opt. Theory Appl., vol. 28, no. 3, pp. 331–352, 1979.
51. T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall, “The double description method,” in Contributions to the Theory of Games II, H. W. Kuhn and A. W. Tucker, Eds. Princeton, NJ: Princeton Univ. Press, 1953.
52. L. W. Nagel, “SPICE2: A computer program to simulate semiconductor circuits,” Univ. California, Berkeley, ERL Memo ERL-M520, May 1975.
53. T. Neumann and D. Agnew “Tracking sensitivity: A practical algorithm,” Electron. Lett., vol. 13, no. 12, pp. 371–372, 1977.
54. W. M. Newman and R. F. Sproul, Principles of Interactive Computer Graphics, 2nd ed., New York: McGraw-Hill, 1979.
55. J. W. Nye et al., “Delight, an optimization based computer aided design system,” in Proc. IEEE Int. Symp. Circuits and Systems, (Chicago, IL), pp. 851–855, 1981.
56. W. Nye, RATTLE/DELIGHT Programming Manual, Univ. California, Berkeley, 1980.
57. W. Nye and A. Tits, “The design of digital filters using interactive optimization,” in Proc. 20th CDC, 1981.
58. L. Opalski and M. Styblinski, “An outer approximations algorithm for the design centering and tolerancing in nonconvex acceptability regions,” in Proc. 1981 Eur. Conf. Circuits Theory and Design (The Hague, The Netherlands), Sept. 1981.
59. J. Pinel and K. Roberts “Tolerance assignment in linear networks using nonlinear programming,” IEEE Trans. Circuits Syst., vol. CAS-19, pp. 475–479, Sept. 1972.
60. O. Pironneau and E. Polak “Rate of convergence of a class of methods of feasible directions,” SIAM J. Numer. Anal., vol. 10, pp. 161–274, 1968.
61. E. Polak, “An implement able algorithm for the optimal design centering, tolerancing and tuning problem,” Electronics Research Lab., Univ. California, Berkeley.
62. E. Polak “Algorithms for a class of computer-aided design problems: A review,” Automatica, vol. 15, pp. 795–813, Sept. 1979.
63. E. Polak, Computational Methods in Optimization. New York: Academic Press, 1971.
64. E. Polak and A. Sangiovanni-Vincentelli, “An algorithm for design centering, tolerancing and tuning,” in Proc. European Conf. Circuit Theory and Design, (Lausanne, Switzerland), pp. 582–585, 1978.
65. —, “Theoretical and computational aspects of the optimal design centering, tolerancing and tuning problem,” IEEE Trans. Circuits Syst., vol CAS-26, pp. 795–813, Sept. 1979.
66. E. Polak and A. Tits, “A recursive quadratic programming algorithm for semi-infinite optimization problems,” J. Appl. Math. Optimiz., to be published.
67. E. Polak, R. Trahan, and D. Q. Mayne “Phase I-Phase II methods of feasible directions,” Math. Progr., vol. 17, pp. 61–73, 1979.
68. M.J.D. Powell, “A fast algorithm for nonlinearly constrained optimization calculations,” in Proc. Dundee Conf. Numerical Analysis, A. Dold and B. Eckmann, Eds. (Lecture Notes in Mathematics, Springer Verlag), p. 630, 1977.
69. P. J. Rankin and R. S. Soin, “Efficient Monte Carlo yield prediction using control variate,” in Proc. Int. Symp. Circuits and Systems, pp. 143–148, 1981.
70. H. Schjaer-Jacobsen and K. Madsen “Algorithms for worst-case tolerance optimization,” IEEE Trans. Circuits Syst., vol. CAS-26, pp. 775–783, Sept. 1979.
71. T. R. Scott and T. P. Walker “Regionalization: A method for generating joint density estimates,” IEEE Trans. Circuits Syst., vol. CAS-23, pp. 229–234, Apr. 1976.
72. K. Singhal and J. F. Pinel, “Statistical design centering and tolerancing using parametric sampling,” in Proc. Int. Symp. Circuits and Systems, pp. 822–885, 1980.
73. R. S. Soin and R. Spence “Statistical exploration approach to design centering,” Proc. Inst. Elec. Eng., vol. 127, part G, no. 6, pp. 260–269, 1980.
74. R. Spence and T. Neumann, “On model simplification,” in Proc. Int Symp. Circuits and Systems, pp. 350–353, 1978.
75. M. A. Styblinski, L. Opalski, and J. Ogrodzki, “An orthogonal search of the region of acceptability in tolerance problems,” in Proc. Int. Symp. SPACE-CAD (Bologna, Italy) 1979.
76. K. S. Tahim and R. Spence, “Statistical circuit analysis-A practical algorithm for linear circuits, in Proc. Int. Symp. Circuits and Systems, pp. 180–184, 1978.
77. —, “A radial exploration approach to manufacturing yield estimation and design centering,” IEEE Trans. Circuits Syst., vol. CAS-26, Sept. 1979.
78. H. Tromp, “The generalized tolerance problem and worst case search,” in Proc. Conf. Computer-Aided Design of Electronic and Microwave Circuits and Systems (Hull, England), pp. 72–77, 1977.
79. —, “Generalized worst case design, with applications to microwave networks,” Doctoral dissertation (in Dutch), Faculty of Engineering, Univ. Ghent, Ghent, Belgium, 1978.
80. L. M. Vidigal, “Statistical design of electronic circuits,” Ph.D. dissertation, Carnegie-Mellon Univ., Pittsburgh, PA, 1980.
81. J. Wilander “An interactive programming system for Pascal,” BIT, vol. 20, no. 2, pp. 163–174, 1980.
82. N. Wirth, “Modula—A language for modular multiprogramming,” Software-Practice and Experience, vol. 7, 1977.
83. P. Wolfe, “On the convergence of gradient methods under constraints,” IBM Res. Rep. RC 1752, Yorktown Heights, NY, 1967.
84. D. A. Zein, C. W. Ho and A. J. Gruodis, “A new interactive circuit design program,” in Proc. IEEE Int. Symp. Circuits and Systems, (Houston, TX), pp. 913–917, 1980.
85. G. Zoutendijk, Methods of Feasible Directions. Amsterdam, The Netherlands: Elsevier, 1960.