rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Leaf Cell and Hierarchical Compaction Techniques
  name:
    name part: Bamji, Cyrus.
    role:
      role term: creator
  name:
    name part: Varadarajan, Ravi.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: mau
    date issued: 1997
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (xiv, 161 pages)
  abstract: Leaf Cell and Hierarchical Compaction Techniques presents novel algorithms developed for the compaction of large layouts. These algorithms have been implemented as part of a system that has been used on many industrial designs. The focus of Leaf Cell and Hierarchical Compaction Techniques is three-fold. First, new ideas for compaction of leaf cells are presented. These cells can range from small transistor-level layouts to very large layouts generated by automatic Place and Route tools. Second, new approaches for hierarchical pitchmatching compaction are described and the concept of a Minimum Design is introduced. The system for hierarchical compaction is built on top of the leaf cell compaction engine and uses the algorithms implemented for leaf cell compaction in a modular fashion. Third, a new representation for designs called Virtual Interface, which allows for efficient topological specification and representation of hierarchical layouts, is outlined. The Virtual Interface representation binds all of the algorithms and their implementations for leaf and hierarchical compaction into an intuitive and easy-to-use system. From the Foreword: ` ... In this book, the authors provide a comprehensive approach to compaction based on carefully conceived abstractions. They describe the design of algorithms that provide true hierarchical compaction based on linear programming, but cut down the complexity of the computations through introduction of innovative representations that capture the provably minimum amount of required information needed for correct compaction. In most compaction algorithms, the complexity goes up with the number of design objects, but in this approach, complexity is due to the irregularity of the design, and hence is often tractable for most designs which incorporate substantial regularity. Here the reader will find an elegant treatment of the many challenges of compaction, and a clear conceptual focus that provides a unified approach to all aspects…
  note: by Cyrus Bamji, Ravi Varadarajan.
  note: Electronic resource.
  subject:
    topic: Engineering
  subject:
    topic: Computer-aided design
  subject:
    topic: Computer engineering
  subject:
    topic: Systems engineering
  subject:
    topic: Computer-aided design
  subject:
    topic: Computer engineering
  subject:
    topic: Engineering
  subject:
    topic: Systems engineering
  classification: TK7888.4
  classification: 621.3815
  related item:
    title info:
      title: Springer International Series in Engineering and Computer Science, VLSI, Computer Architecture and Digital Signal Processing ; 407
  identifier: 9781461561392 (electronic bk.)
  identifier: 1461561396 (electronic bk.)
  identifier: 9781461378136
  identifier: 1461378133
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: AU@
    record creation date: 121227
    record change date: 20260422211340.6
    record identifier: in00003570392
    language of cataloging:
      language term: eng