Skip to main content

Physical Design of CMOS Chips in Six Easy Steps

  • Conference paper
  • First Online:
SOFSEM 2000: Theory and Practice of Informatics (SOFSEM 2000)

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

  • 457 Accesses

Abstract

Aimed at software professional not familiar with design processes of semiconductor elements that execute their programs. This paper focuses on algorithms and software involved in a design, layout and verification of CMOS parts. The first section introduces basic building elements of a design—transistor and standard cell—and shows their representation in design database. The design flow is segmented into six distinct steps: design capture, synthesis, floorplanning, placement and routing, extraction and verification.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. E. Cheng. Risa: Accurate and efficient placement routability modeling. In ICCAD’ 94 Proceedings. IEEE Computer Society Press, 1994. 125

    Google Scholar 

  2. K. M. Hall. An r-dimensional quadratic placement algorithm. Management Science, 17, 1970. 122

    Google Scholar 

  3. P. Kurup and T. Abbasi. Logic Synthesis Using Synopsys. Kluwer Academic Publishers, 1997.

    Google Scholar 

  4. C. Y. Lee. An Algorithm for Path Connections and Its Applications. IEEE Transaction on Electronic Computers. 1961. 124

    Google Scholar 

  5. S. Malik and R. Rudell. Multi-level Logic Synthesis. ICCAD’92 Tutorial. IEEE Computer Society Press, 1992.

    Google Scholar 

  6. H. Murata, K. Fujioshi, S. Nakatake, and Y. Kajitani. Rectangle-packing-based module placement. In ICCAD’ 95 Proceedings. IEEE Computer Society Press, 1995. 121

    Google Scholar 

  7. B. Preas and M. Lorenzetti. Physical Design Automation of VLSI Systems. The Benjamin/Cummings Publishing Co., Inc., 1988. 122, 127

    Google Scholar 

  8. G. Rabbat. Handbook of Advanced Semiconductor Technology and Computer Systems. Van Nostrand Reinhold Company Inc., 1988.

    Google Scholar 

  9. N. Sherwani. Algorithms for VLSI Physical Design Automation. Kluwer Academic Publishers, 1993. 122

    Google Scholar 

  10. W. Shi. An optimal algorithm for area minimization of slicing floorplans. In ICCAD’ 95 Proceedings. IEEE Computer Society Press, 1995. 121

    Google Scholar 

  11. J. Soukup. Fast maze router. In Proceedings of 15th Design Automation Conference, pages 100–102, 1978. 124

    Google Scholar 

  12. N. Weste and K. Esraghian. Principles of CMOS VLSI Design. Addison-Wesley Publishing Co., 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benda, S.E. (2000). Physical Design of CMOS Chips in Six Easy Steps. In: Hlaváč, V., Jeffery, K.G., Wiedermann, J. (eds) SOFSEM 2000: Theory and Practice of Informatics. SOFSEM 2000. Lecture Notes in Computer Science, vol 1963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44411-4_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44411-4_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41348-6

  • Online ISBN: 978-3-540-44411-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics