Practical problems in VLSI physical design automation

Select an Action

Place Hold(s)
Add to My Lists
Email
Print

Title:

Personal Author:

Lim, Sung Kyu

Publication Information:

[Dordrecht] : Springer, 2008

Physical Description:

xxxvi, 260 p. : ill. ; 24 cm.

ISBN:

9781402066269

Subject Term:

Integrated circuits -- Very large scale integration -- Computer-aided design

Available:*

Library	Item Barcode	Call Number	Material Type	Item Category 1	Status
Searching... PSZ JB	30000010196850	TK7874.75 L54 2008	Open Access Book	Book	Searching... Unknown

Practical Problems in VLSI Physical Design Automation contains problems and solutions related to various well-known algorithms used in VLSI physical design automation. Dr. Lim believes that the best way to learn new algorithms is to walk through a small example by hand. This knowledge will greatly help understand, analyze, and improve some of the well-known algorithms. The author has designed and taught a graduate-level course on physical CAD for VLSI at Georgia Tech. Over the years he has written his homework with such a focus and has maintained typeset version of the solutions.

Author Notes

Dr. Sung Kyu Lim received his PhD at UCLA in Los Angeles, USA and he majored in VLSI CAD. He recently received tenure at Georgia Tech.

Dedication	p. v
List of Figures	p. ix
List of Tables	p. xxiii
Foreword	p. xxvii
Foreword	p. xxix
Preface	p. xxxi
Acknowledgments	p. xxxv
1 Clustering	p. 1
1 Rajaraman and Wong Algorithm	p. 2
2 FlowMap Algorithm	p. 10
3 Multi-Level Coarsening Algorithm	p. 19
4 More Practice Problems	p. 25
5 Probing Further	p. 27
2 Partitioning	p. 31
1 Kernighan and Lin Algorithm	p. 32
2 Fiduccia and Mattheyses Algorithm	p. 37
3 EIG Algorithm	p. 44
4 FBB Algorithm	p. 49
5 More Practice Problems	p. 56
6 Probing Further	p. 58
3 Floorplanning	p. 63
1 Stockmeyer Algorithm	p. 64
2 Normalized Polish Expression	p. 70
3 ILP Floorplanning Algorithm	p. 76
4 Sequence Pair Representation	p. 87
5 More Practice Problems	p. 95
6 Probing Further	p. 97
4 Placement	p. 101
1 Mincut Placement	p. 102
2 GORDIAN Algorithm	p. 112
3 TimberWolf Algorithm	p. 122
4 More Practice Problems	p. 132
5 Probing Further	p. 134
5 Steiner Routing	p. 139
1 L-Shaped Steiner Routing Algorithm	p. 140
2 1-Steiner Routing Algorithms	p. 151
3 Bounded Radius Routing Algorithms	p. 160
4 A-tree Algorithm	p. 170
5 Elmore Routing Tree Algorithms	p. 181
6 More Practice Problems	p. 190
7 Probing Further	p. 192
6 Multi-Net Routing	p. 197
1 Steiner Min-Max Tree Algorithm	p. 198
2 Multi-Commodity Flow Routing Algorithm	p. 207
3 Iterative Deletion Algorithm	p. 221
4 Yoshimura and Kuh Algorithm	p. 235
5 More Practice Problems	p. 245
6 Probing Further	p. 247
References	p. 251

Available:*

On Order

Summary

Summary

Author Notes

Table of Contents