Skip to main content
SpringerLink
Log in

Combinatorial Algorithms for Integrated Circuit Layout

  • Textbook
  • © 1990

Overview

Authors:
  1. Thomas Lengauer

    1. University of Paderborn, Paderborn, West Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: XApplicable Theory in Computer Science (XATCS)

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

Access this book

Log in via an institution
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

  1. Front Matter

    Pages i-xxviii
    Download chapter PDF

  2. Background

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Introduction to Circuit Layout

      • Thomas Lengauer
      Pages 3-29

    3. Optimization Problems

      • Thomas Lengauer
      Pages 31-45

    4. Graph Algorithms

      • Thomas Lengauer
      Pages 47-135

    5. Operations Research and Statistics

      • Thomas Lengauer
      Pages 137-217

  3. Combinatorial Layout Problems

    1. Front Matter

      Pages 219-219
      Download chapter PDF

    2. The Layout Problem

      • Thomas Lengauer
      Pages 221-250

    3. Circuit Partitioning

      • Thomas Lengauer
      Pages 251-301

    4. Placement, Assignment, and Floorplanning

      • Thomas Lengauer
      Pages 303-377

    5. Global Routing and Area Routing

      • Thomas Lengauer
      Pages 379-454

    6. Detailed Routing

      • Thomas Lengauer
      Pages 455-578

    7. Compaction

      • Thomas Lengauer
      Pages 579-647

  4. Back Matter

    Pages 649-697
    Download chapter PDF
Back to top

Keywords

About this book

The last decade has brought explosive growth in the technology for manufac­ turing integrated circuits. Integrated circuits with several hundred thousand transistors are now commonplace. This manufacturing capability, combined with the economic benefits of large electronic systems, is forcing a revolution in the design of these systems and providing a challenge to those people in­ terested in integrated system design. Modern circuits are too complex for an individual to comprehend completely. Managing tremendous complexity and automating the design process have become crucial issues. Two groups are interested in dealing with complexity and in developing algorithms to automate the design process. One group is composed of practi­ tioners in computer-aided design (CAD) who develop computer programs to aid the circuit-design process. The second group is made up of computer scientists and mathemati'::~l\ns who are interested in the design and analysis of efficient combinatorial aJ::,orithms. These two groups have developed separate bodies of literature and, until recently, have had relatively little interaction. An obstacle to bringing these two groups together is the lack of books that discuss issues of importance to both groups in the same context. There are many instances when a familiarity with the literature of the other group would be beneficial. Some practitioners could use known theoretical results to improve their "cut and try" heuristics. In other cases, theoreticians have published impractical or highly abstracted toy formulations, thinking that the latter are important for circuit layout.

Authors and Affiliations

  • University of Paderborn, Paderborn, West Germany

    Thomas Lengauer

Bibliographic Information

  • Book Title: Combinatorial Algorithms for Integrated Circuit Layout

  • Authors: Thomas Lengauer

  • Series Title: XApplicable Theory in Computer Science

  • DOI: https://doi.org/10.1007/978-3-322-92106-2

  • Publisher: Vieweg+Teubner Verlag Wiesbaden

  • eBook Packages: Springer Book Archive

  • Copyright Information: John Wiley & Sons Ltd 1990

  • Softcover ISBN: 978-3-322-92108-6Published: 25 May 2012

  • eBook ISBN: 978-3-322-92106-2Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: XXVIII, 720

  • Number of Illustrations: 32 b/w illustrations

  • Topics: Engineering, general

Publish with us

Policies and ethics

Back to top

Search

Navigation