The Simplicial Approximation Approach to Design Centering

IEEE Transactions on Circuits and Systems

Volumn 24, Issue 7, 1977, Pages 363-372

  Director, Stephen W ^a   Hachtel, Gary D ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - APPROXIMATION THEORY;

DESIGN CENTERING; SIMPLICIAL APPROXIMATION;

INTEGRATED CIRCUITS;

EID: 0017515253     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCS.1977.1084353     Document Type: Article

References (20)

1. J. W. Bandler, P. C. Liu, and H. Tromp, “Practical design centering, tolerancing and tuning,” in Proceedings of the 1975 IEEE International Symposium on Circuits and Systems, Apr. 1975, pp. 206-209.
2. J. F. Pinel and K. A. Roberts, “Tolerance assignment in linear networks using nonlinear programming,” IEEE Trans, on Circuit Theory, vol. CT-19, pp. 475-479, Sept. 1972.
3. A. R. Thorbjornsen and S. W. Director, “Computer-aided tolerance assignment for linear circuits with correlated elements,” IEEE Trans, on Circuit Theory, vol. CT-20, pp. 518-524, Sept. 1973.
4. B. J. Karafin, “An efficient computational procedure for estimating circuit yield,” Ph.D. dissertation, University of Penn., 1974.
5. N. J. Elias, “New statistical methods for assigning device tolerances,” in Proceedings of the 1975 IEEE Symposium on Circuits and Systems, pp. 329-332, Apr. 1975.
6. E. M. Butler, “Realistic design using large change sensitivities and performance contours,” IEEE Trans, on Circuit Theory, vol. CT-18, pp. 58-59, Jan. 1971.
7. R. Fletcher and M. J. D. Powell, “A rapidly convergent descent method for minimization,” Computer Journal, vol. 6, pp. 163-168, 1963.
8. P. Wolfe, private communication.
9. L. W. Nagel, “SPICE 2: A computer program to simulate semiconductor circuits,” Ph.D. dissertation, Univ. of Calif., May 1975.
10. Advanced Statistical Circuit Analysis Program (ASTAP) Program Reference Manual, SH20-1118-0, IBM Corporation.
11. H. Eggleston, Convexity. London, England: 1958, Cambridge University Press.
12. A. Charnes and W. Cooper, “Chance constrained programming,” Management Science, vol. 6 pp. 73-80, 1959.
13. A. M. Geoffrion, Ed., Perspectives on Optimization. Reading, MA: Addison-Wesley, 1972.
14. J. E. Kelley, “The cutting plane method for solving convex programs,” J. Soc. Indus. Appl. Math, vol. 8, pp. 703-712, 1960.
15. B. Grunbaum, Convex Polytopes. New York: Wiley-Interscience, 1967.
16. G. Dantzig, Linear Programming and Extensions. Princeton, NJ: Princeton University Press, 1963.
17. G. Dantzig and P. Wolfe, “Decomposition principle for linear programs,” Operations Research, vol. 8, no. 1, pp. 101-111, 1960.
18. L. Cooper and D. Steinberg, Methods and Applications of Linear Programming. Philadelphia, PA: W. B. Saunders, 1974.
19. D. Luenberger, Introduction to Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1973.
20. S. W. Director and G. D. Hachtel, “Yield estimation using simpliCial approximation,” in Proceedings of the 1977 IEEE Symposium on Circuits and Systems.