Algorithms for VLSI Physical Design Automation, Second Edition is a core reference text for graduate students and CAD professionals. Based on the very successful First Edition, it provides a comprehensive treatment of the principles and algorithms of VLSI physical design, presenting the concepts and algorithms in an intuitive manner. Each chapter contains 3-4 algorithms that are discussed in detail. Additional algorithms are presented in a somewhat shorter format. References to advanced algorithms are presented at the end of each chapter. Algorithms for VLSI Physical Design Automation covers all aspects of physical design. In 1992, when the First Edition was published, the largest available microprocessor had one million transistors and was fabricated using three metal layers. Now we process with six metal layers, fabricating 15 million transistors on a chip. Designs are moving to the 500-700 MHz frequency goal. These stunning developments have significantly altered the VLSI field: over-the-cell routing and early floorplanning have come to occupy a central place in the physical design flow. This Second Edition introduces a realistic picture to the reader, exposing the concerns facing the VLSI industry, while maintaining the theoretical flavor of the First Edition. New material has been added to all chapters, new sections have been added to most chapters, and a few chapters have been completely rewritten. The textual material is supplemented and clarified by many helpful figures. Audience: An invaluable reference for professionals in layout, design automation and physical design.

Today's electronics industry requires new design automation methodologies that allow designers to incorporate high performance integrated circuits into smaller packaging. The aim of this book is to present current and future techniques and algorithms of high performance multichip modules (MCMs) and other packaging methodologies. Innovative technical papers in this book cover design optimization and physical partitioning; global routing/multi-layer assignment; timing-driven interconnection design (timing models, clock and power design); crosstalk, reflection, and simultaneous switching noise minimization; yield optimization; defect area minimization; low-power physical layout; and design methodologies. Two tutorial reviews review some of the most significant algorithms previously developed for the placement/partitioning, and signal integrity issues, respectively. The remaining articles review the trend of prime design automation algorithms to solve the above eight problems which arise in MCMs and other packages.

On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for high-performance, high-density interconnections during the global and detailed routing phases of circuit layout. First, the book addresses area minimization, with a focus on near-optimal approximation algorithms for minimum-cost Steiner routing. In addition to practical implementations of recent methods, the implications of recent results on spanning tree degree bounds and the method of Zelikovsky are discussed. Second, the book addresses delay minimization, starting with a discussion of accurate, yet algorithmically tractable, delay models. Recent minimum-delay constructions are highlighted, including provably good cost-radius tradeoffs, critical-sink routing algorithms, Elmore delay-optimal routing, graph Steiner arborescences, non-tree routing, and wiresizing. Third, the book addresses skew minimization for clock routing and prescribed-delay routing formulations. The discussion starts with early matching-based constructions and goes on to treat zero-skew routing with provably minimum wirelength, as well as planar clock routing. Finally, the book concludes with a discussion of multiple (competing) objectives, i.e., how to optimize area, delay, skew, and other objectives simultaneously. These techniques are useful when the routing instance has heterogeneous resources or is highly congested, as in FPGA routing, multi-chip packaging, and very dense layouts. Throughout the book, the emphasis is on practical algorithms and a complete self-contained development. On Optimal Interconnections for VLSI will be of use to both circuit designers (CAD tool users) as well as researchers and developers in the area of performance-driven physical design.

This book constitutes the refereed proceedings of the 15th International Conference on Integrated Formal Methods, IFM 2019, held in Bergen, Norway, in December 2019. The 25 full papers and 3 short papers were carefully reviewed and selected from 95 submissions. The papers cover a broad spectrum of topics: from language design to verification and analysis techniques, to supporting tools and their integration into software engineering practice including both theoretical approaches and practical implementations. Also included are the extended abstracts of 6 "journal-first" papers.

Electrical Engineering/Signal Processing High-Performance VLSI Signal Processing Innovative Architectures and Algorithms Volume 2 Systems Design And Applications The second volume in a two-volume set, High-Performance VLSI Signal Processing: Innovative Architectures and Algorithms brings together the most innovative papers in the field, focused introductory material, and extensive references. The editors present timely coverage of the latest design tools, design environments, and implementations of VLSI signal processing systems. These volumes will serve as vital resources for engineers who want a comprehensive knowledge of the extremely interdisciplinary field of high-performance VLSI processing. The editors provide a practical understanding of the merits of total system design through an insightful, synergistic presentation of methodology, architecture, and infrastructure. Each volume features: Major papers that span the wide range of research areas in the field Chapter introductions including historical perspectives Numerous applications-oriented design examples Coverage of current and future technological trends