An extended representation of Q-sequence for optimizing channel-adjacency and routing-cost

This paper proposes a topological representation for the general floorplan, called the H-sequence, which can check channel-adjacency and boundary-adjacency in a constant time. Moreover, we define Routing-cost for the placement to measure its routing difficulty. Experimental results indicate that the H-sequence based placement algorithm can optimize routing-cost effectively in a short time.