| Summary: | 碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 97 === In recent years, a number of studies have been done on Computer-Aided Design (CAD) for IC design. Legalization is one of important issues on CAD. The existed methods for legalization usually try to minimize the total displacements of cells. However, consideration of total displacements only may lead to the problem that wirelength is too large. Another critical problem is the row management, which may influence the efficiency of legalization. Therefore, the legalization must simultaneously consider the displacement and the wirelength, as well as the good row searching management. In this paper, we propose a novel clustering-based mechanism for row searching management. At first, a row index structure is established to search the best row by using recursive clustering algorithms. Then, we propose a method for trial placement to find the position of the cell on the row. Finally, all the cells would be inserted into their corresponding best rows. To evaluate our proposed method, we use ACM ISPD 2005 and 2006 placement contest benchmarks [30] as experimental data. Experimental results show that our proposed method can efficiently obtain high-quality results.
|
|---|
