Search

A non-Manhattan hexagon/triangle placement (HTP for short) paradigm is proposed in the present paper. The main feature of the paradigm lies in adapting to the X- and Y-architectures. As is known the X architecture is supposed to be dominant in the nanometer realm for the coming years. Triangle circuit blocks are placed into a hexagonal shape chip by using a graph representation called helical sequence (HS for short) and a placement strategy named as corner coincidence compact placement (CCCP for short). Also provided is a theorem showing that a packing algorithm called HS2PL enables us to get a unique CCCP by the use of HS. Two examples with benchmark data transformed from the Manhattan BBL mode placement (ami33/49) are presented to justify the feasibility and effectiveness of our algorithms.

The single-sequence (SS) is simply a sequence of integers 1, 2, 3, ..., n. But it leads a unique set of ABLR-relations (above, below, left-of, right-of) that hold among n objects on a plane. The direct relation set (DRS) is used to represent the direct ABLR-relations among rooms. It can be reused for any packing under the same floorplan. In this paper we analyze the relation between DRS and SS, and propose a general packing algorithm based on SS. It can update each room's coordinates on the fly. As a feature of SS, this algorithm covers all possible placements, if our objective is in bounding-box area minimization. Experimental results showed that the proposed algorithm is pretty fast and efficient compared with the performance attained by conventional algorithms.