'Vlsi physical design' diaporamas de présentation

Professor Kuh and Us

Professor Kuh and Us. Chung- Kuan Cheng CSE Department UC San Diego La Jolla, CA 92130 ckcheng@ucsd.edu. Advisor, Mentor, Supporter . Advisor: 1981-1984 Host: 1990 Investor: CLK CAD 1998 Technical Advisor: CLK CAD Co-Investigator: Micro Program 1991-2008 Coauthor: 1983-2009

465 views • 32 slides

Yoshimura-Kuh Channel Routing

Yoshimura-Kuh Channel Routing. Perform YK channel routing with K = 100 TOP = [1,1,4,2,3,4,3,6,5,8,5,9] BOT = [2,3,2,0,5,6,4,7,6,9,8,7]. Constrained Left-Edge Algorithm. First perform CLE on original problem (for comparison) Assign VCG nodes with no incoming edge first

511 views • 16 slides

TimberWolf 7.0 Placement

TimberWolf 7.0 Placement. Perform TimberWolf placement Based on the given standard cell placement Initial HPBB wirelength = 23. First Swap. Swap node b and e We shift node h : on the shorter side of the receiving row Node b included in nets { n 3 , n 9 }, and e in { n 1 , n 7 }.

310 views • 16 slides

Fiduccia-Mattheyses Algorithm

Fiduccia-Mattheyses Algorithm. Perform FM algorithm on the following circuit: Area constraint = [3,5] Break ties in alphabetical order. Initial Partitioning. Random initial partitioning is given. Gain Computation and Bucket Set Up. First Move. Second Move. Third Move. Forth Move.

1.89k views • 12 slides

Mincut Placement

231 views • 12 slides

Stockmeyer Algorithm

Stockmeyer Algorithm. Determine optimal orientation of the blocks Internal nodes in the slicing tree: top- H -bottom, left- V -right lower-left corner of the block ? lower-left corner of its room Block dimension: (2,4), (1,3), (3,3), (3,5), (3,2), (5,3), (1,2), (2,4).

656 views • 7 slides

Network Flow-based Bipartitioning

Network Flow-based Bipartitioning. Perform flow-based bipartitioning under: Area constraint [4,5] Source = a , sink = i Break ties alphabetically. First Max-Flow and Its Cut. First Node Merging. Second Max-Flow and Its Cut. Second Node Merging. Third Max-Flow and Its Cut.

223 views • 6 slides