摘要
In this paper,a K-line location algorithm for building block cells in LSI/VLSI ispresented.When the relative positions of rectangular cells are given,there are 2 states accordingto the two orientations of a cell.It is proved that to find the optimum solution from the 2~N statescan be reduced to calculate the N states in K-line algorithm.So the algorithm is shown veryeffective and can be used with association for cluster method in BBL placement.Under certainconditions,this method can also be used to pesudo BBL placement directly.
In this paper,a K-line location algorithm for building block cells in LSI/VLSI is presented.When the relative positions of rectangular cells are given,there are 2 states according to the two orientations of a cell.It is proved that to find the optimum solution from the 2~N states can be reduced to calculate the N states in K-line algorithm.So the algorithm is shown very effective and can be used with association for cluster method in BBL placement.Under certain conditions,this method can also be used to pesudo BBL placement directly.
