Title :
Pin assignment with global routing for general cell designs
Author_Institution :
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
fDate :
11/1/1991 12:00:00 AM
Abstract :
The author presents an algorithm which combines the pin assignment step and the global routing step in the physical design of VLSI circuits. The algorithm is based on two key theorems: the channel pin assignment theorem and the block boundary decomposition theorem. These two theorems deal successfully with the high complexity resulting from combining the pin assignment and global routing steps. According to these two theorems, one only needs to generate a coarse pin assignment and global routing solution. The exact pin locations and global routing topology can be determined optimally later by a linear time algorithm. The author implemented a pin assignment and global routine package named BeauticianGR based on the proposed algorithm. This package produces satisfactory results on test circuits
Keywords :
VLSI; circuit layout CAD; graph theory; integrated circuit technology; network topology; BeauticianGR; CAD; IC layout design; VLSI circuits; block boundary decomposition theorem; channel pin assignment theorem; global routing; linear time algorithm; routing topology; Algorithm design and analysis; Automatic testing; Circuit testing; Circuit topology; Joining processes; Pins; Process design; Routing; Semiconductor device packaging; Very large scale integration;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on