Gate Sizing for Cell-Based Designs

  • Chapter
Logic Synthesis and Optimization

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 212))

  • 298 Accesses

Abstract

Without changing to its topology, a logic circuit can be optimized for area, speed or both by sizing its gates. In this chapter, we describe an approach to the gate sizing problem in cell-based logic designs. Our algorithm picks from the cell library one out of several functionally-identical cells for every gate of a combinational Boolean logic circuit so that the circuit delay meets a user-specified constraint while the total gate size is minimized. Specifically, we deal with the relationship between the delays of a set of paths and the total size of the constituent gates of the path set. We also describe a fine-step sizing strategy that enables the sizer to treat all paths fairly. A software system called Theda.CBS (Tsing Hua Electronic Design Automation — Cell-Based Sizing) has been implemented. We have tested Theda.CBS on a set of benchmark circuits targeting towards different cell libraries. A series of experiments have been conducted to investigate the effectiveness of the algorithm.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 103.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 129.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
GBP 129.99
Price includes VAT (United Kingdom)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** 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.

Similar content being viewed by others

References

  1. R. Brayton et al., “MIS: A Multiple-Level Logic Optimization System,” IEEE Transactions on CAD of ICS, Vol. 6, No. 11, pp. 1062–1081, November 1987.

    Google Scholar 

  2. P. K. Chan, “Algorithms for Library-Specific Sizing of Combinational Logic,” 27th ACM/IEEE Design Automation Conference, pp. 353–356, June 1990.

    Google Scholar 

  3. M-C. Chang and C-F. Chen, “PROMPT3 — A Cell-Based Transistor Sizing Program Using Heuristic and Simulated Annealing Algorithms,” IEEE 1989 Custom Integrated Circuits Conference, pp. 17.2.1–17.2.4., May 1989.

    Google Scholar 

  4. H. Y. Chen and S. M. Kang, “iCOACH: A Circuit Optimization Aid for CMOS High-performance Circuits,” International Conference on Computer-Aided Design, pp. 372–375, November 1988.

    Google Scholar 

  5. H. Y. Chen and S. M. Kang, “A New Circuit Optimization Technique for High Performance CMOS Circuits,” IEEE Transactions on CAD of ICS, Vol. 10, No. 5, pp. 670–676, May 1991.

    MathSciNet  Google Scholar 

  6. Z-J. Dai and K. Asada, “MOSIZ: A Two-step Transistor Sizing Algorithm Based on Optimal Timing Assignment Method for Multi-stage Complex Gates,” IEEE 1989 Custom Integrated Circuits Conference, pp. 17.3.1–17.3.4, May 1989.

    Google Scholar 

  7. D. H. Du, S. H. Yen, and H. Ghanta, “Efficient Algorithms for Extracting the k-Most Critical Paths in Timing Analysis,” Journal of Computer-Aided VLSI Design, pp. 191–215, March 1991.

    Google Scholar 

  8. J. P. Fishburn and A. E. Dunlop, “TILOS: A Posynomial Programming Approach to Transistor Sizing,” International Conference on Computer-Aided Design, pp. 326–328, November 1985.

    Google Scholar 

  9. T. Gao, P. M. Vaidya, and C. L. Liu, “A New Performance Driven Placement Algorithm,” International Conference on Computer-Aided Design, pp. 44–47, November 1991.

    Google Scholar 

  10. L. S. Hensler and W. Fichtner, “Transistor Sizing for Large Combinational Digital CMOS Circuits,” INTEGRATION, the VLSI Journal, Vol. 10, pp. 155–168, 1991.

    Article  Google Scholar 

  11. Hua-Lon Microelectronics Co., “Hua-Lon 1.2 t CMOS Cell Library Data Book,” Hsin-Chu Taiwan, 1991.

    Google Scholar 

  12. S. Lin, M. Marek-Sadowska and E. Kuh, “Delay and Area Optimization in Standard Cell Design,” 27th ACM/IEEE Design Automation Conference, pp. 349–352, June 1990.

    Chapter  Google Scholar 

  13. D. Marple, “Transistor Size Optimization in the Tailor Layout System,” 26th ACM/IEEE Design Automation Conference, pp. 43–48, June 1989.

    Google Scholar 

  14. S. S. Sapatnekar and V. B. Rao, “IDEAS: A Delay Estimator and Transistor Sizing Tool for CMOS Circuits,” IEEE 1990 Custom Integrated Circuits Conference, pp. 9.3.1 — 9.3.4, May 1990.

    Google Scholar 

  15. S. Sutanthavibul and E. Shragowitz, “Dynamic Prediction of Critical Paths And Nets For Constructive Timing-Driven Placement,” 28th ACM/IEEE Design Automation Conference, pp. 632–635, June 1991.

    Google Scholar 

  16. J-M. Shyu, A. Sangiovanni-Vincentelli, J. P. Fishburn and A. E. Dunlop, “Optimization-Based Transistor Sizing,” IEEE Journal of Solid-State Circuits, Vol. 23, No. 2, pp. 400–409, April 1988.

    Article  Google Scholar 

  17. H. Youssef, E. Shragowitz and L. C. Bening, “Critical Path Issue in VLSI Design,” International Conference on Computer-Aided Design, pp. 520–523, November 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

Lee, WP., Lin, YL. (1993). Gate Sizing for Cell-Based Designs. In: Sasao, T. (eds) Logic Synthesis and Optimization. The Kluwer International Series in Engineering and Computer Science, vol 212. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3154-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-3154-8_16

  • Publisher Name: Springer, Boston, MA

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

  • Online ISBN: 978-1-4615-3154-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Navigation