A Timing-driven Pin Assignment Algorithm with Improvement of Cell Placement in Standard Cell Layout

摘要

In this paper, we propose a timing-driven pin assignment algorithm with improvement of cell placement in standard cell layout. The objective of the algorithm is to minimize the channel density as well as the total wire length by assigning nets to pins of cells under the given timing constraints. The layout model assumed in this paper consists of three cell rows, and the middle cell row is the one to which the proposed algorithm is applied. If the number of possible pin assignments for each cell is bounded by some con8tant k and the cell is allowed to be moved from its original position within r cells, then the proposed algorithm can solve the problem in linear time on the number of cells in the middle cell row. The proposed algorithm can easily be extended to a heuristic pin assignment algorithm to the general standard cell layout model. Experimental results with benchmark data show the effectivenes8 of the proposed algorithm.