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 ofcompaction, and a clear conceptual focus that provides a unified approach to all aspects of the compaction task...'
Jonathan Allen, Massachusetts Institute of Technology

Inhalt
1 Introduction.- 1.1 Compaction.- 1.2 Applications of Compaction.- 1.3 Outline of the Book.- 2 Leaf Cell Compaction.- 2.1 Introduction.- 2.2 Survey of Leaf Cell Compaction.- 2.3 Graph Based Compaction.- 2.4 Scanline Generators.- 2.5 Net Extraction.- 2.6 Constraint Generation.- 2.7 Graph Solution.- 2.8 Wire Length Minimization.- 2.9 Automatic Jogging of Wires.- 2.10 Enhanced Network Flow Algorithm.- 2.11 Yield Optimization.- 3 Hierarchical Compaction.- 3.1 Overview.- 3.2 Formulation of the Hierarchical Compaction Problem.- 3.3 Hierarchical Pitchmatching Compaction.- 4 Hierarchical Pitchmatching Compaction using Minimum Design.- 4.1 Overview.- 4.2 Hierarchy Normalization.- 4.3 Minimum Design.- 4.4 Over the Cell Routing.- 4.5 Reporting Overconstraints in Hierarchical Compaction.- 4.6 Results.- 5 Virtual Interface.- 5.1 Overview.- 5.2 Introduction to Virtual Interface.- 5.3 Virtual Interface Representation.- 5.4 Example of Virtual Interface.- 6 Conclusion.- References.