Title: Interconnect Routing in VLSI
1Interconnect Routing in VLSI
Glauco Borges Valim dos Santos - FUCAS - GME - II
- UFRGS - 2004
2Interconnect Routing is the task of making
electrically equivalent a set of points
concerning to gates inputs/outputs. Consider the
logic gate schematic representation of an
hypothetical circuit
3Each set of inputs/output correspond to a net
whose terminals should be connected in order to
make them electrically equivalent by the
definition of physical conductive wire segments
4So, this is a net ...
5and also is this ...
6and this ...
7Now, lets focus our attention to a single net
8Say this one
9With the output coming from a nand gate and the
inputs going into an inverter, a nor gate and
another nand gate
10Lets call them NANDA, INV, NOR and NANDB
respectively
11So, weve got
INV
NOR
NANDA
NANDB
12Lets now suppose they are mapped to physical
standard cells
INV
NOR
NANDA
NANDB
13With the respective relation between their
inputs/output terminals
INV
NOR
NANDA
NANDB
14Now imagine that a previous placement process...
INV
NOR
NANDA
NANDB
15Have placed them in rows, like this
other cells
INV
cell row
NOR
NANDA
NANDB
16The routing task is to connect the net terminals
with metal segments, generally only in
horizon/vertical directions, and vias for layers
connection
INV
net termninals
NOR
NANDA
NANDB
17The problem is abstracted to a Graph Theory
problem with the vertices corresponding to cell
pins and the edges to metal segments. This is
called symbolic routing