1. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Topics n CAD systems. n Simulation. n Placement and routing. n Layout analysis.

2. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR CAD systems n Tools aren’t very useful if they don’t talk to each other. n Design interchange languages: –VHDL (TM), Verilog (TM) (function and structure); –EDIF (netlists); –GDS, CIF (masks).

3. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR CAD tool interactions database tool 1tool 2 tool 3tool 4 database (hub-and-spoke)translator tool 1tool 2 tool 3tool 4 xlate a xlate c xlate b xlate e xlate d

4. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Back annotation n Often want to iteratively improve design. n Back annotation updates a more-abstract design with information from later design stages. –Example: annotate logic schematic with extracted parasitic Rs and Cs. n Back annotation requires tools to know more about each other.

5. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Event-driven simulation n Event-driven simulation is designed for digital circuit characteristics: –small number of signal values; –relatively sparse activity over time. n Event-driven simulators try to update only those signals which change in order to reduce CPU time requirements.

6. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Event-driven simulator structure n An event is a change in a signal value. n A timewheel is a queue of events. n Simulator traces structure of circuit to determine causality of events—event at input of one gate may cause new event at gate’s output.

7. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Event-driven simulation example A B C D logic networkbehavior

8. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Event-driven simulation example, cont’d n Events at primary inputs: –A changes at t=1; –B changes at t=2. n Immediate causality: –C changes at t=3 when both inputs to NOR are 0. n Event propagation: –D changes at t=4.

9. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Delay models n Unit-delay simulators assume that each component has a one-unit delay. Model function but not performance. n Variable-delay simulators allow each component to have its own delay. Accuracy of performance estimates from variable- delay simulators depends on how well circuits can be extracted to digital model.

10. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Switch simulation n Special type of event-driven simulation optimized for MOS transistors. n Treats transistor as switch. Takes capacitance into account to model charge sharing, etc. n Can also be enhanced to model transistor as resistive switch.

11. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Switch simulation example

12. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Switch simulation example, cont’d n Node g may be connected to either power supply, but signals on that node are terminated by gate of transistor. n To solve for values of a and b nodes, must first solve for value of g node. –If g=1, then a=b. –If g=0, other parts of circuit determine a and b independently.

13. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Switch simulation and charge sharing n Closed transistor connects source and drain nodes. Want to determine voltages of source/drain nodes taking into account capacitance. n Capacitance determines node size. Use size of connected nodes to determine new value of nodes. n Result may be X (unknown).

14. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Layout synthesis n Two critical phases of layout design: –placement of components on the chip; –routing of wires between components. n Placement and routing interact, but separating layout design into phases helps us understand the problem and find good solutions.

15. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Placement metrics n Quality metrics for layout: –area; –delay. n Area and delay deterined in part by wiring. n How do we judge a placement without wiring? Estimate wire length without actually performing routing.

16. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Wire length as a quality metric bad placementgood placement

17. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Wire length measures n Estimate wire length by distance between components. n Possible distance measures: –Euclidean distance (sqrt(x 2 + y 2 )); –Manhattan distance (x + y). n Multi-point nets must be broken up into trees for good estimates.

18. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Placement techniques n Can construct an initial solution, improve an existing solution. n Pairwise interchange is a simple improvement metric: –Interchange a pair, keep the swap if it helps wire length. –Heuristic determines which two components to swap.

19. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Placement by partitioning n Works well for components of fairly uniform size. n Partition netlist to minimize total wire length using min-cut criterion. n Partitioning may be interpreted as 1-D or 2- D layout.

20. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Min-cut bisecting partitioning partition 1partition 2 A B C D 3 nets 1 net

21. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Min-cut bisecting partitioning, cont’d n Swapping A and B: –B drags 1 net; –A drags 3 nets; –total cut increase: 4 nets. n Conclusion: probably not a good swap, but must be compared with other pairs.

22. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Kernighan-Lin algorithm n Compute min cut criterion: –count total net cut change. n Algorithm exchanges sets of nodes to perform hill-climbing—finding improvements where no single swap will improve the cut. n Recursively subdivide to determine placement detail.

23. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Simulated annealing n Powerful but CPU-intensive optimization technique. n Analogy to annealing of metals: –temperature determines probability of a component jumping position; –probabilistically accept moves. –start at high temperature, cool to lower temperature to try to reach good placement.

24. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Routing n Major phases in routing: –global routing assigns nets to routing areas; –detailed routing designs the routing areas. n Net ordering is a major problem. Order in whch nets are routed determines quality fo result. Net ordering is a heuristic.

25. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Maze routing n Will find shortest path for a single wire, if such a path exists. n Two phases: –Label nodes with distance, radiating from source. –Use distances to trace from sink to source, choosing a path that always decreases distance to source.

26. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Maze routing example

27. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Detailed routing n Dogleg router breaks net into multiple segments as needed. n Try to minimize number of dogleg segments per net to minimize congestion for future nets. n One good heuristic—use left-edge criterion on each dogleg segment to fill up the channel.

28. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Rivest-Fiduccia channel router n Routes from left to right. Assigns all nets that cross the current column to tracks. n Heuristics: –Make connections to pins. –Add jogs to put multi-track net into one track. –Add jogs to reduce distance in multi-track nets. –Add jogs to move net toward next pin. –Add tracks when necessary.

29. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR YACR2 n Tries to minimize number of vias as well as number of tracks. n Temporarily satisfies vertical constraints by adding blank space between pins. n Eliminates blank space ater by adding jobs. n May route in both directions on same layer.

30. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Layout analysis n Test design rules using Boolean combinations of masks, grow/shrink. M1 M2 M1 and M2 not (M1 or M2) M1 M2

31. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Scan line algorithm n Mark each edge of polygon with direction. n Sweep scan line across layout. n At each point on scan line, count number of left-hand and right-hand edges to determine what rectangle that point is in.

32. Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Scan line algorithm example M1 M2 sweep a b