Pin assignment with global routing for general cell designs

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. >

[1]  Martin D. F. Wong,et al.  Channel routing order for building-block layout with rectilinear modules , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[2]  Bryan Thomas Preas.  Placement and routing algorithms for hierarchical integrated circuit layout , 1979 .

[3]  C. L. Liu,et al.  Permutation Channel Routing , 1988 .

[4]  Martin D. F. Wong,et al.  A New Algorithm for Floorplan Design , 1986, 23rd ACM/IEEE Design Automation Conference.

[5]  Leah Mory-Rauch.  Pin Assignment on a Printed Circuit Board , 1978, 15th Design Automation Conference.

[6]  H. Nelson Brady.  An Approach to Topological Pin Assignment , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[8]  Ernest S. Kuh,et al.  A Dynamic and Efficient Representation of Building-Block Layout , 1987, 24th ACM/IEEE Design Automation Conference.

[9]  Norman L. Koren.  Pin assignment in automated printed circuit board design , 1972, DAC '72.

[10]  C. L. Liu,et al.  A new approach to the pin assignment problem , 1988, DAC '88.