Routing Area Compaction Based On Iterative Construction

In this paper, an iterative-construction based layout approach composed of three algorithms: Net-forest routing, track assignment, and block position refinement, is presented. These algorithms, unlike the conventional methods implemented separately with a sequence of tools, are linked with a common data structure — H-V model of corner-stitching. Thus, they have maximal compatibility. Given an initial non-overlapping placement, the approach always generates a more compact final layout. Several layout examples in the literature are tested to prove the effectiveness of our approach; these experimental results show that our approach is better than the 1-D compactors and sorhe of the 2-D compactors.