An efficient relative placement algorithm for custom chip design

An efficient relative placement model derived from probability space by using circle model is described. Each block is represented by a circle. The size of circle is proportional to the size of the block. Both size effect and connectivity effect are considered simultaneously. The model attains a low polynomial time complexity O(kn/sup 2/) without loss of global perspective, where k is a constant and depends on the accuracy the placement required. As expected, the wire length of the model is shorter than that of point model.<
>