23
Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PT Topics Layouts for logic networks. Channel routing. Simulation.

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Embed Size (px)

Citation preview

Page 1: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Topics

Layouts for logic networks. Channel routing. Simulation.

Page 2: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Standard cell layout

Layout made of small cells: gates, flip-flops, etc.

Cells are hand-designed. Assembly of cells is automatic:

– cells arranged in rows;– wires routed between (and through) cells.

Page 3: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Standard cell structure

VDD

VSS

n tub

p tub

Intra-cell wiring

pullups

pulldowns

pin

pin

Fee

dthr

ough

are

a

Page 4: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Standard cell design

Pitch: height of cell.– All cells have same pitch, may have different

widths. VDD, VSS connections are designed to run

through cells. A feedthrough area may allow wires to be

routed over the cell.

Page 5: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Single-row layout design

Routing channel

cell cell cell cell cell

cellcellcellcellcell

wire Horizontal trackVertical track

height

Page 6: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Routing channels

Tracks form a grid for routing.– Spacing between tracks is center-to-center

distance between wires.– Track spacing depends on wire layer used.

Different layers are (generally) used for horizontal and vertical wires.– Horizontal and vertical can be routed relatively

independently.

Page 7: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Routing channel design

Placement of cells determines placement of pins. Pin placement determines difficulty of routing problem. Density: lower bound on number of horizontal tracks needed to

route the channel.– Maximum number of nets crossing from one end of channel to the other.

Page 8: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Pin placement and routing

before

a b c

b c a

before

a b c

bca

Density = 3 Density = 2

Page 9: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Example: full adder layout

Two outputs: sum, carry.

sum

carry

x1

x2

n1

n2

n3

n4

Page 10: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Layout methodology

Generate candidates, evaluate area and speed.– Can improve candidate without starting from

scratch. To generate a candidate:

– place gates in a row;– draw wires between gates and primary

inputs/outputs;– measure channel density.

Page 11: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

A candidate layout

x1 x2 n1 n2 n3 n4

a

b

c

s

cout

Density = 5

Page 12: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Improvement strategies

Swap pairs of gates.– Doesn’t help here.

Exchange larger groups of cells.– Swapping order of sum and carry groups doesn’t

help either. This seems to be the placement that gives the

lowest channel density.– Cell sizes are fixed, so channel height determines

area.

Page 13: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Left-edge algorithm

Basic channel routing algorithm. Assumes one horizontal segment per net. Sweep pins from left to right:

– assign horizontal segment to lowest available track.

Page 14: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Example

A B C

A B B C

Page 15: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Limitations of left-edge algorithm

Some combinations of nets require more than one horizontal segment per net.

B A

A B

aligned

?

Page 16: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Vertical constraints

Aligned pins form vertical constraints.– Wire to lower pin must be on lower track; wire

to upper pin must be above lower pin’s wire.

B A

A B

Page 17: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Dogleg wire

A dogleg wire has more than one horizontal segment.

B A

A B

Page 18: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Rat’s nest plot

Can be used to judge placement before final routing.

Page 19: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Simulation

Goals of simulation:– functional verification;– timing;– power consumption;– testability.

Page 20: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Types of simulation

Circuit simulation:– analog voltages and currents.

Timing simulation:– simple analog models to provide timing but not

detailed waveforms. Switch simulation:

– transistors as semi-ideal switches.

Page 21: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Types of simulation, cont’d.

Gate simulation:– logic gates as primitive elements.

Models for gate simulation:– zero delay;– unit delay;– variable delay.

Fault simulation:– models fault propagation (more later).

Page 22: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Example: switch simulation

a

+

+

b

cd

c1

0

0

X

X

Xo

0

1

1

Page 23: Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation

Modern VLSI Design 3e: Chapter 4 Copyright 1998, 2002 Prentice Hall PTR

Example, cont’d.

a

+

+

b

cd

c1

0

0

0

1

1o

0

1

0

0