考慮大型類比電路對稱性限制區塊放置的演算法

Abstract

近年來，在高性能類比電路中為了處理匹配問題，通常一些區塊需要以對稱的方式放置。在佈局(floorplan)的時候，對於類比電路中的對稱區塊，我們希望把屬於同一群的對稱區塊放置(placement)在一起。我們提出一個簡單而且有效率的方法，在滿足對稱限制下達到最緊密的區塊放置。對於這些有對稱性限制的區塊放置，我們使用順序對(sequence-pair)以及線性規劃(linear program)來實現。為了得到有效的解答，我們在模擬冶煉(simulated annealing)中交互執行配置對稱區塊和非對稱區塊。最後，我們和近年來的論文所提出的實驗數據比較，從數據我們證實可以得到有效的結果。

In recent years, in order to handle matching in high performance analog circuits, some cells are often required placed symmetrically to the axis. For the symmetry components for the analog circuits in our full floorplan, we hope that the cells of the same symmetry groups are placed together. We propose a simple and efficient method to obtain the closest cell placement satisfying the symmetry constrains and the cell placement with symmetry constraints implemented by the linear programming with sequence pair. With the sequence pair, in order to obtain solutions effectively, we execute the simulated annealing with the positions of the symmetry and non-symmetry cells in a way of correlation. Then, we compare our experiment results to the papers with symmetry constraints recently and we will demonstrate the effectiveness of our approach by experiment result.