由於IC設計的複雜度越來越高，使得電路的尺寸也越變越大，為了要處理更複雜的IC設計問題，因此階層式設計與智慧財產權的觀念在今日備受歡迎，這個趨勢也導致平面規劃在設計流程當中扮演非常具關鍵性的角色，而在平面規劃的表示法當中，序列對的表示法是非常有彈性的，因此在本篇論文當中，我們研究以非切割性結構的序列對表示法來解決叢聚限制的問題，我們提出一種以模擬退火法為基礎的演算法，可以從解空間當中辨別出能滿足叢聚限制的解。 我們以MCNC benchmark circuits 實驗，其結果顯示，使用我們發展的叢聚限制判斷方式，無叢聚限制與叢聚限制其Dead Space的差異在0~4.03 %之間，其結果算是蠻不錯的。 Due to the growth in design complexity, circuit size is getting larger. To cope with the increasing design complexity, hierarchical design and Intellectual Properties(IP) modules are widely used. This trend makes block Floorplanning/placement much more critical to the quality of a design. The Sequence Pair representation is very flexible for floorplanning. In this thesis, we consider the problem of non-slicing floorplan with clustering constraints based on the Sequence Pair. We propose an algorithm based on the simulated annealing for the problem, it could distinguish the solution which satisfied the clustering constraints from the solution space. In our experiments, we use the MCNC benchmark circuits. The results show that the difference between the floorplans without clustering constraint and the floorplans with clustering constraint are in 0~4.03% in dead space. Experimental results are very well.
