Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2799))

  • 1048 Accesses

Abstract

In this paper we address the problem of delay constraint distribution on a CMOS combinatorial path. We first define a way to determine on any path the reasonable bounds of delay characterizing the structure. Then we define two constraint distribution methods that we compare to the equal delay distribution and to an industrial tool based on the Newton-Raphson like algorithm. Validation is obtained on a 0.25μm process by comparing the different constraint distribution techniques on various benchmarks.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Shyu, J.M., Sangiovanni-Vincentelli, A., Fishburn, J., Dunlop, A.: Optimization-based transistor sizing. IEEE J. Solid State Circuits 23(2), 40–109 (1988)

    Article  Google Scholar 

  2. Fishburn, J., Dunlop, A.: TILOS: a posynomial programming approach to transistor sizing. In: Proc. Design Automation Conf., pp. 326–328 (1985)

    Google Scholar 

  3. Mead, C., Rem, M.: Minimum propagation delays in VLSI. IEEE J. Solid State Circuits SC17(4), 773–775 (1982)

    Article  Google Scholar 

  4. Sutherland, I., Sproull, B., Harris, D.: Logical Effort: Designing Fast CMOS Circuits. Morgan Kaufmann Publishers, Inc., San Francisco (1999)

    Google Scholar 

  5. Jeppson, K.O.: Modeling the influence of the transistor gain ratio and the input-to-output coupling capacitance on the CMOS inverter delay. IEEE J. Solid State Circuits 29, 646–654 (1994)

    Article  Google Scholar 

  6. Chakraborty, S., Murgai, R.: Lay-out driven timing optimization by generalized DeMorgan transform. In: IWLS 2001, pp. 53–59 (2001)

    Google Scholar 

  7. Ketkar, M., Kasamsetty, K., Sapatnekar, S.: Convex delay models for transistor sizing. In: Proc. of the 2000 Design Automation Conf., pp. 655–660 (2000)

    Google Scholar 

  8. Grodstein, J., Lehman, E., Harhness, H., Grundmann, B., Wanatabe, Y.: A delay model for logic synthesis of continuously-sized networks. In: ICCAD 1995 (Novemeber 1995)

    Google Scholar 

  9. Brayton, R.K., Spence, R.: Sensitivity and Optimization. Elsevier, Amsterdam (1980)

    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-Verlag Berlin Heidelberg

About this paper

Cite this paper

Verle, A., Michel, X., Maurine, P., Azémard, N., Auvergne, D. (2003). CMOS Gate Sizing under Delay Constraint. In: Chico, J.J., Macii, E. (eds) Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation. PATMOS 2003. Lecture Notes in Computer Science, vol 2799. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39762-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39762-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20074-1

  • Online ISBN: 978-3-540-39762-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics