Title :
A lower bound on channel density after global routing
Author_Institution :
Dept. of Electr. Eng., Alberta Univ., Edmonton, Alta., Canada
fDate :
5/1/1989 12:00:00 AM
Abstract :
The author addresses the minimum density switchable segment assignment (MINDESSA) problem, which arises during the global routing of standard cell integrated circuits. A switchable segment is a portion of a net that can be routed in one of two adjacent channels. The MINDESSA problem is the problem of assigning switchable segments to one of the two possible channels so that the total channel density of the IC is minimized. The author presents an algorithm for calculating a lower bound on channel density for the MINDESSA problem
Keywords :
cellular arrays; circuit layout CAD; MINDESSA; global routing; lower bound on channel density; minimum density switchable segment assignment; problem of assigning switchable segments; standard cell integrated circuits; switchable segment; total channel density; Area measurement; Conductors; Councils; Density measurement; Heuristic algorithms; Integrated circuit interconnections; Routing; Switching circuits; Wires; Wiring;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
