【摘要】 对于LSI/VLSI具有积木块的单元时,本文给出单行安置的算法.一般来说,给出矩形单元的相对位置后,须从2~N个状态中选出最优解.我们证明在单行安置时可归结为N个状态的问题,得到一种很有效的算法.此算法曾用Fortran语言编程并在IBM-PC机上通行,结果令人满意.更多还原

【Abstract】 In this paper, a single line location algorithm for building block cells in LSI/VLSI is presented. When the relative positions of rectangular cells are given, there are 2N states according to the two orientations of a cell. It is proved that to find the optimum solution from the 2N states can be reduced to calculate the N states in single line algorithm.So the algorithm is shown very effectively and can be used with association for cluster method in BBL placement. The program has been written in Fortran language and realized on an IBM-PC computer.更多还原