Placement of modules with irregular shapes in layout design

Abstract

In this paper a fast algorithm for placing modules is presented. It gradually transforms a graph structure into a highly packed placement. The positioning of the modules is such that subsequent wiring procedures can be kept simple and total interconnection length can be relatively small. Restrictions on the shapes of the concerned modules are much weaker than those imposed by algorithms with for the rest comparable potency. In an example the algorithm is applied to bipolar integrated circuits with one wiring layer.