Skip to main content

Optimization of Custom MOS Circuits by Transistor Sizing

  • Chapter
The Best of ICCAD

Abstract

Optimization of a circuit by transistor sizing is often a slow, tedious and iterative manual process which relies on designer intuition. Circuit simulation is carried out in the inner loop of this tuning procedure. Automating the transistor sizing process is an important step towards being able to rapidly design high-performance, custom circuits. Jiffy Tune is a new circuit optimization tool that automates the tuning task. Delay, rise/fall time, area and power targets are accommodated. Each (weighted) target can be either a constraint or an objective function. Minimax optimization is supported. Transistors can be ratioed and similar structures grouped to ensure regular layouts. Bounds on transistor widths are supported.

Jiffy Tune uses LANCELOT, a large-scale nonlinear optimization package with an augmented Lagrangian formulation. Simple bounds are handled explicitly and trust region methods are applied to minimize a composite objective function. In the inner loop of the optimization, the fast circuit simulator SPECS is used to evaluate the circuit. SPECS is unique in its ability to efficiently provide time-domain sensitivities, thereby enabling gradient-based optimization. Both the adjoint and direct methods of sensitivity computation have been implemented in SPECS.

To assist the user, interfaces in the Cadence and SLED design systems have been constructed. These interfaces automate the specification of the optimization task, the running of the optimizer and the back-annotation of the results on to the circuit schematic.

Jiffy Tune has been used to tune over 100 circuits for a custom, high-performance microprocessor that makes use of dynamic logic circuits. Circuits with over 250 tunable transistors have been successfully optimized. Automatic circuit tuning has been found to facilitate design re-use. The designers’ focus shifts from solving the optimization problem to specifying it correctly and completely. This paper describes the algorithms of Jiffy Tune, the environment in which it is used and presents a case study of the application of Jiffy Tune to individual circuits of the microprocessor.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. D. Marple, “Transistor size optimization in the Tailor layout system,” Proc, 1989 Design Automation Conference, pp. 43–48, June 1989.

    Google Scholar 

  3. R. B. Hitchcock, Sr., G. L. Smith, and D. D. Cheng, “Timing analysis of computer hardware,” IBM Journal of Research and Development, pp. 100–105, January 1982.

    Google Scholar 

  4. W. C. Elmore, “The transient analysis of damped linear networks with particular regard to wideband amplifiers,” Journal of Applied Physics, vol. 19, no. 1, pp. 55–63, 1948.

    Article  Google Scholar 

  5. P. Penfield and J. Rubinstein, “Signal delay in RC tree networks,” in Proceedings of the 2nd Caltech VLSI Conference, pp. 269–283, March 1981.

    Google Scholar 

  6. S. S. Sapatnekar and W. Chuang, “Power vs. delay in gate sizing: conflicting objectives?,” IEEE International Conference on Computer-Aided Design, pp. 463–466, November 1995.

    Google Scholar 

  7. F. Najm, “Probabilistic simulation for reliability analysis of CMOS VLSI circuits,” IEEE International Conference on Computer-Aided Design,vol. CAD-9, pp. 439–450, April 1990.

    Google Scholar 

  8. J. J. Cong and C.-K. Koh, “Simultaneous driver and wire sizing for performance and power optimization,” IEEE Transactions on VLSI Systems, vol. 2, pp. 408–425, December 1994.

    Article  Google Scholar 

  9. N. Menezes, R. Baldick, and L. T. Pileggi, “A sequential quadratic programming approach to concurrent gate and wire sizing,” IEEE International Conference on Computer-Aided Design, pp. 144–151, November 1995.

    Google Scholar 

  10. W. Nye, D. C. Riley, A. Sangiovanni-Vincentelli, and A. L. Tits, “DELIGHT.SPICE: An optimization-based system for the design of integrated circuits,” IEEE Transactions on Computer-Aided Design of ICs and Systems, vol. CAD-7, pp. 501–519, April 1988.

    Article  Google Scholar 

  11. J.-M. Shyu and A. Sangiovanni-Vincentelli, “ECSTASY: a new environment for IC design optimization,” IEEE International Conference on Computer-Aided Design,pp. 484–487, November 1988.

    Google Scholar 

  12. C. Visweswariah and R. A. Rohrer, “Piecewise approximate circuit simulation,” IEEE International Conference on Computer-Aided Design, pp. 248–251, November 1989.

    Google Scholar 

  13. C. Visweswariah and R. A. Rohrer, “Piecewise approximate circuit simulation,” IEEE Transactions on Computer-Aided Design of lCs and Systems, vol. 10, pp. 861–870, July 1991.

    Article  Google Scholar 

  14. 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.

    Article  MathSciNet  MATH  Google Scholar 

  15. 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.

    Article  MathSciNet  MATH  Google Scholar 

  16. 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.

    Google Scholar 

  17. J. J. Moré “The Levenberg-Marquardt algorithm, implementation and theory,” in Numerical Analysis, Lecture Notes in mathematics 630 (G. A. Watson, ed.), Springer Verlag, 1977.

    Google Scholar 

  18. B. A. Murtagh and M. A. Saunders, “MINOS 5.1 user’s guide,” Tech. Rep. SOL 83–20R, Stanford University, Stanford, CA, December 1983. Revised January 1987.

    Google Scholar 

  19. I. Bongartz, A. R. Conn, N. I. M. Gould, and Ph. L. Toint, “CUTE: constrained and un-constrained testing environment,” ACM Transactions on Mathematical Software, vol. 21, pp. 123–160, March 1995.

    Article  MATH  Google Scholar 

  20. W. T. Weeks, A. J. Jimenez, G. W. Mahoney, D. Mehta, H. Quassemzadeh, and T. R. Scott, “Algorithms for ASTAP - a network analysis program,” IEEE Transactions on Circuit Theory, vol. CT, pp. 628–634, November 1973.

    Google Scholar 

  21. L. T. Pillage, R. A. Rohrer, and C. Visweswariah, Electronic circuit and system simulation methods. McGraw-Hill, 1995.

    Google Scholar 

  22. T. V. Nguyen, P. Feldmann, S. W. Director, and R. A. Rohrer, “SPECS simulation validation with efficient transient sensitivity computation,” IEEE International Conference on Computer-Aided Design, pp. 252–255, November 1989.

    Google Scholar 

  23. 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.

    Article  Google Scholar 

  24. T. V. Nguyen, “Transient sensitivity computation and applications,” Tech. Rep. CMUCAD-91–40, Carnegie Mellon University, Pittsburgh, PA, 1991.

    Google Scholar 

  25. S. W. Director and R. A. Rohrer, “The generalized adjoint network and network sensitivities,” IEEE Transactions on Circuit Theory, vol. CT-16, pp. 318–323, August 1969.

    Article  Google Scholar 

  26. D. A. Hocevar, P. Yang, T. N. Trick, and B. D. Epler, “Transient sensitivity computation for MOSFET circuits,” IEEE Transactions on Computer-Aided Design of ICs and Systems, vol. CAD-4, pp. 609–620, October 1985.

    Article  Google Scholar 

  27. J. J. Moré, “Recent developments in algorithms and software for trust region methods,” in Mathematical programming: the state of the art (A. Bachem, M. Grötschel, and B. Korte, eds.), (Berlin), pp. 258–287, Springer Verlag, 1983.

    Chapter  Google Scholar 

  28. P. E. Gill, W. Murray, and M. H. Wright, Practical optimization. London and New York: Academic Press, 1981.

    MATH  Google Scholar 

  29. A. R. Conn, N. I. M. Gould, and Ph. L. Toint, “On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear equality constraints and simple bounds,” in Proceedings of the 14th Biennial Numerical Analysis Conference Dundee 1991 (D. F. Griffiths and G. A. Watson, eds.), pp. 49–68, Longmans, 1992.

    Google Scholar 

  30. I. S. Duff, A. M. Erisman, and J. K. Reid, Direct methods for sparse matrices. Oxford, U.K.: Clarendon Press, 1986.

    MATH  Google Scholar 

  31. R. B. Schnabel and E. Eskow, “A new modified cholesky factorization,” SIAM Journal on Scientific and Statistical Computing, vol. 11, pp. 1136–1158, 1991.

    Article  MathSciNet  Google Scholar 

  32. C. D. S. Inc., “Design entry: Composer users’ guide 4.3,” 1994.

    Google Scholar 

  33. M. Rubin, “View: A user tailorable interface for circuit design graphics,” Tech. Rep. TR-19.90629, IBM, August 1990.

    Google Scholar 

  34. 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Conn, A.R., Coulman, P.K., Haring, R.A., Morrill, G.L., Visweswariah, C. (2003). Optimization of Custom MOS Circuits by Transistor Sizing. In: Kuehlmann, A. (eds) The Best of ICCAD. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0292-0_28

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0292-0_28

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5007-1

  • Online ISBN: 978-1-4615-0292-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics