Crosstalk minimization of local channel routing algorithms in VLSI CAD

Author

Rui Miguel de Carvalho Lopes

Date of Award

5-2000

Degree Type

Thesis

Degree Name

Master of Science

Major

Computer Science

Major Professor

D. P. Mehta

Committee Members

Bruce Whitehead, Bruce Bomar

Abstract

The greedy and left edge algorithms, as applied to local routing in VLSI CAD, were modified to decrease crosstalk between neighboring wires. The modifications on the algorithms use spacing, and segregation to improve the routing of wires in a channel. The modified greedy and left edge algorithms use a grid, but the minimum distance between two wires can be varied depending on the crosstalk between them. Crosstalk information must be obtained separately and is part of the required set of inputs to the algorithms. The improved algorithms route all the channel problems tested in less tracks than the original algorithms, if crosstalk constraints exist, and in the same number of tracks, if no crosstalk constraints exist.

Recommended Citation

Lopes, Rui Miguel de Carvalho, "Crosstalk minimization of local channel routing algorithms in VLSI CAD. " Master's Thesis, University of Tennessee, 2000.
https://trace.tennessee.edu/utk_gradthes/9426