VLSI physical design : from graph partitioning to timing closure / Andrew B. Kahng, Jens Lienig, Igor L. Markov, Jin Hu.
2022
TK7874
Linked e-resources
Linked Resource
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
VLSI physical design : from graph partitioning to timing closure / Andrew B. Kahng, Jens Lienig, Igor L. Markov, Jin Hu.
Author
Edition
2nd ed.
ISBN
9783030964153 (electronic bk.)
3030964159 (electronic bk.)
9783030964146
3030964140
3030964159 (electronic bk.)
9783030964146
3030964140
Publication Details
Cham : Springer, 2022.
Language
English
Description
1 online resource (329 pages)
Item Number
10.1007/978-3-030-96415-3 doi
Call Number
TK7874
Dewey Decimal Classification
621.39/5
Summary
Design and optimization of integrated circuits are essential to the creation of new semiconductor chips, and physical optimizations are becoming more prominent as a result of semiconductor scaling. Modern chip design has become so complex that it is largely performed by specialized software, which is frequently updated to address advances in semiconductor technologies and increased problem complexities. A user of such software needs a high-level understanding of the underlying mathematical models and algorithms. On the other hand, a developer of such software must have a keen understanding of computer science aspects, including algorithmic performance bottlenecks and how various algorithms operate and interact. "VLSI Physical Design: From Graph Partitioning to Timing Closure" introduces and compares algorithms that are used during the physical design phase of integrated-circuit design, wherein a geometric chip layout is produced starting from an abstract circuit design. The emphasis is on essential and fundamental techniques, ranging from hypergraph partitioning and circuit placement to timing closure
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed June 29, 2022).
Available in Other Form
Linked Resources
Record Appears in
Table of Contents
1 Introduction
2 Netlist and System Partitioning
3 Chip Planning
4 Global and Detailed Placement
5 Global Routing
6 Detailed Routing
7 Specialized Routing
8 Timing Closure. A Solutions to Chapter Exercises
B Example CMOS Cell Layouts.
2 Netlist and System Partitioning
3 Chip Planning
4 Global and Detailed Placement
5 Global Routing
6 Detailed Routing
7 Specialized Routing
8 Timing Closure. A Solutions to Chapter Exercises
B Example CMOS Cell Layouts.