The automation of layout synthesis design under stringent timing specifications is essential for state-of-the-art VLSI circuits and systems design. Especially, the timing-driven layout synthesis with optimal placement and routing of transistors with proper sizing is most critical in view of the chip area, interconnection parasitics, circuit delay and power dissipation. This book presents a systematic and unified view of the layout synthesis problem with a strong focus on CMOS technology. The criticality of RC parasitics in the interconnects and the optimal sizing of both p-channel and n-channel transistors are illustrated for motivation. Following the motivation, the problems of modelling circuit delays and transistor sizing are formulated and solved with mathematical rigour. Various delay models for CMOS circuits are discussed to account for realistic interconnection parasitics, the effect of transistor sizes, and also the input slew rates. Also many of the efficient transistor sizing algorithms are critically reviewed and the most recent transistor sizing algorithm based on convex programming techniques is introduced.For design automation of the rigorous CMOS layout synthesis, an integrated system that employs a suite of functional modules is introduced for step-by-step illustration of the design optimization process that produces highly compact CMOS layout that meet used-specified timing and logical nettist requirements. Through most rigorous discussion of the essential design automation process steps and important models and algorithms this book presents a unified systems approach that can be practised for high-performance CMOS VLSI designs. The book should serve as a valuable reference and can be used as text in advanced courses covering VLSI design, especially for design automation of physical design.
1 Introduction.- 1.1 The Process of IC Design.- 1.2 Layout Styles.- 1.3 Timing-driven Layout.- 1.4 Outline of the Book.- 2 Delay Estimation.- 2.1 Introduction.- 2.2 Micromodeling — The RC Model.- 2.3 Macromodeling.- 2.4 Worst-case Delay Estimation.- 2.5 Delay Calculation at the Circuit Level.- 2.6 Posynomial Delay Modeling.- 2.7 A Case Study: iCONTRAST’s Timing Analyzer.- 2.8 Summary.- 3 Transistor Sizing Algorithms: Existing Approaches.- 3.1 Introduction.- 3.2 The TILOS Algorithm.- 3.3 The Method of Feasible Directions (MFD) Algorithm.- 3.4 Lagrangian Multiplier Approaches.- 3.5 Two-step Optimization.- 3.6 Other Approaches.- 3.7 Summary of Previous Approaches.- 4 A Convex Programming Approach to Transistor Sizing.- 4.1 Introduction.- 4.2 The Convex Programming Algorithm.- 4.3 Experimental Results.- 4.4 Summary.- 5 Global Routing Using Zero-one Integer Linear Programming.- 5.1 Introduction.- 5.2 Extracting Global Routing Information.- 5.3 Global Routing Phases.- 5.4 Global Routing on Medium-sized Arrays.- 5.5 Application to Custom Logic Layout.- 5.6 Handling Very Large Circuits.- 5.7 Runtime Complexity.- 5.8 Conclusion.- 6 Timing-driven CMOS Layout Synthesis.- 6.1 Introduction.- 6.2 A Methodology for Designing CMOS Standard Cells.- 6.3 The Metal-Metal Matrix (M3) Layout Style for Two level Technologies.- 6.4 iCGEN: A CMOS Layout Synthesis System for Three-level Metal Technology.