Advertisement

Exploiting Optimality Conditions in Accurate Static Circuit Tuning

  • Chandu Visweswariah
  • Andrew R. Conn
  • Luís G. Silva
Part of the Applied Optimization book series (APOP, volume 82)

Abstract

This paper describes, in a manner that is meant to be amenable to both mathematicians and engineers, the accurate optimization of transistor sizes on a static timing basis. Delays of individual gates (and gradients thereof) are obtained by transient (i.e. time-domain) simulation rather than simplified Elmore or analytical delay models. Slews (rise/fall times)1 and their effects on delay are correctly taken into account. The optimization problem is stated in a form amenable to general-purpose nonlinear optimization. However, the size and inherent degeneracy of the resulting optimization problem make it difficult to solve. By considering the structure of the problem, optimality conditions are derived and conditions can be exploited to carry out the tuning more effectively and efficiently. Numerical results from the optimization of high-performance microprocessor circuits are presented. Further, an investigation of the viability and merits of an implementation of Lagrangian Relaxation in the same circuit optimization environment are detailed.

Keywords

circuit optimization Lagrangian relaxation optimality conditions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. D. Matson and L. A. Glasser, “Macromodeling and optimization of digital MOS VLSI circuits,” IEEE Transactions on Computer-Aided Design of ICs and Systems, vol. CAD-5, pp. 659–678, October 1986.CrossRefGoogle Scholar
  2. [2]
    D. Marple, “Transistor size optimization in the Tailor layout system,” Proc. 1989 Design Automation Conference,pp. 43–48, June 1989.Google Scholar
  3. [3]
    A. Srinivasan, K. Chaudhary, and E. S. Kuh, “RITUAL: A performance driven placement algorithm for small cell ICs,” IEEE International Conference on Computer-Aided Design, pp. 48–51, November 1991.Google Scholar
  4. [4]
    J. P. Fishburn and A. E. Dunlop, “TILOS: A posynomial programming approach to transistor sizing,” IEEE International Conference on Computer-Aided Design,pp. 326–328, November 1985.Google Scholar
  5. [5]
    A. R. Conn, I. M. Elfadel, W. W. Molzen, Jr., P. R. O’Brien, P. N. Strenski, C. Visweswariah, and C. B. Whan, “Gradient-based optimization of custom circuits using a static-timing formulation,” Proc. 1999 Design Automation Conference, pp. 452–459, June 1999.Google Scholar
  6. [6]
    C. Visweswariah and A. R. Conn, “Formulation of static circuit optimization with reduced size, degeneracy and redundancy by timing graph manipulation,” IEEE International Conference on Computer-Aided Design, pp. 244–251, November 1999.Google Scholar
  7. [7]
    A. R. Conn, P. K. Coulman, R. A. Haring, G. L. Morrill and C. Visweswariah, “Optimization of custom MOS circuits by transistor sizing,” IEEE International Conference on Computer-Aided Design, pp. 174–180, November 1996.Google Scholar
  8. [8]
    A. R. Conn, C. Visweswariah, R. A. Haring and C. W. Wu, “Circuit optimization via adjoint Lagrangians,” IEEE International Conference on Computer-Aided Design, pp. 281–288, November 1997.Google Scholar
  9. [9]
    C. Visweswariah, R. A. Haring and A. R. Conn, “Noise considerations in circuit optimization,” IEEE Transactions on Computer-Aided Design of ICs and Systems, pp. 679–690, vol. 19, June 2000.Google Scholar
  10. [10]
    A. R. Conn, P. K. Coulman, R. A. Haring, G. L. Morrill, C. Visweswariah and C. W. Wu, “JiffyTune: circuit optimization using time-domain sensitivities,” IEEE Transactions on Computer-Aided Design of ICs and Systems,pp. 1292–1309, vol. 17, December 1998.Google Scholar
  11. [11]
    C.-P. Chen, C. N. Chu, and D. F. Wong, “Fast and exact simultaneous gate and wire sizing by Lagrangian Relaxation,” IEEE Transactions on Computer-Aided Design of ICs and Systems, vol. 18, July 1999.Google Scholar
  12. [12]
    C. Visweswariah and R. A. Rohrer, “Piecewise approximate circuit simulation,” IEEE Transactions on Computer-Aided Design of ICs and Systems,vol. 10, pp. 861–870, July 1991.CrossRefGoogle Scholar
  13. [13]
    C. Visweswariah and J. A. Wehbeh, “Incremental event-driven simulation of digital FET circuits,” Proc. 1993 Design Automation Conference, pp. 737–741, June 1993.Google Scholar
  14. [14]
    P. Feldmann, T. V. Nguyen, S. W. Director, and R. A. Rohrer, “Sensitivity computation in piecewise approximate circuit simulation,” IEEE Transactions on Computer-Aided Design of ICs and Systems,vol. 10, pp. 171–183, February 1991.CrossRefGoogle Scholar
  15. [15]
    A. R. Conn, N. I. M. Gould, and Ph. L. Toint, LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A). Springer Verlag, 1992.zbMATHGoogle Scholar
  16. [16]
    A. R. Conn, N. I. M. Gould, and Ph. L. Toint, “Global convergence of a class of trust region algorithms for optimization with simple bounds,” SIAM Journal on Numerical Analysis, vol. 25, pp. 433–460, 1988. See also same journal, pp. 764–767, volume 26, 1989.Google Scholar
  17. [17]
    A. R. Conn, N. I. M. Gould, and Ph. L. Toint, “A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds,” SIAM Journal on Numerical Analysis,vol. 28, no. 2, pp. 545–572, 1991.MathSciNetzbMATHCrossRefGoogle Scholar
  18. [18]
    A. R. Conn, L. N. Vicente, and C. Visweswariah, “Two-step algorithms for nonlinear optimization with structured applications,” SIAM Journal on Optimization,vol. 9, pp. 924–947, September 1999.MathSciNetzbMATHCrossRefGoogle Scholar
  19. [19]
    C. Lemaréchal and J. Zowe, “A condensed introduction to bundle methods in nonsmooth optimizations,” in Algorithms for continuous optimization: the state of the art (E. Spedicato, ed.), no. 434 in NATO ASI Series C: Mathematical and Physical Sciences, (Dordrecht, The Netherlands), pp. 357–382, Kluwer Academic Publishers, 1994.Google Scholar
  20. [20]
    G. L. Nemhauser and L. A. Wolsey, Integer and combinatorial optimization. New York: John Wiley and Sons, 1988. Chapter 6.zbMATHGoogle Scholar

Copyright information

© Kluwer Academic Publishers B.V. 2003

Authors and Affiliations

  • Chandu Visweswariah
    • 1
  • Andrew R. Conn
    • 1
  • Luís G. Silva
    • 2
  1. 1.IBM Thomas J. Watson Research CenterYorktown HeightsUSA
  2. 2.IST/INESCLisbonPortugal

Personalised recommendations